|
| |
| | Advanced Slicing of Sequential and <b>Concurrentb> Programs |
 | | In the theoretical part, this thesis presents a high-precision approach to slice <b>concurrentb> procedural programs despite that optimal slicing is known to be undecidable. | | | It is the first approach to slice <b>concurrentb> programs that does not rely on inlining of called procedures. | | | Despite the ongoing research of almost 25 years, program slicing still has problems that prevent a widespread use: Sometimes, slices are too big to understand and too expensive and complicated to be computed for real-life programs. |
|
http://www.fernuni-hagen.de/ST/diss.php
(224 words)
|
|
| |
| | On <b>Concurrentb> Programming |
| | Even the size of a large program need not be an impediment—large <b>concurrentb> programs are often just small algorithms in disguise. | | | Such small <b>concurrentb> algorithms can be programmed and analyzed; we build a model and analyze it to gain insight about the full-scale artifact. | | | A <b>concurrentb> program consists of a collection of sequential processes whose execution is interleaved; the interleaving is the result of choices made by a scheduler and is not under programmer control. |
|
http://www.cs.cornell.edu/ugrad/FBS-Article.htm
(777 words)
|
|
| |
| | Chapter 15 |
| | <b>Concurrentb> programming is useful in modeling or simulating physical systems, even if those systems are not directly controlled by a computer. | | | <b>Concurrentb> programming is the creation of programs that consist of segments that have the potential for parallel execution; depending upon the actual number of CPUs available, execution of a <b>concurrentb> program may be literally parallel, entirely time-shared, or some combination of the two. | | | These are, of necessity, <b>concurrentb> programs: They must manage a number of electronic devices simultaneously; these devices, in turn, are connected to physical machines such as an automobile's fuel injection system or a railroad's "turnout" (a movable section of track that allows a train to enter one or the other of two rail lines). |
|
http://www.seas.gwu.edu/~mfeldman/cs2-book/chap15.html
(8080 words)
|
|
| |
| | Visualizing <b>Concurrentb> Programs |
| | Appropriate displays of <b>concurrentb> programs can help the viewer develop intuition about performance and correctness problems that stem from unanticipated interactions between processes. | | | <b>Concurrentb> programs are by nature large and complex and may produce vast quantities of data. | | | The most critical issue in the visualization of a <b>concurrentb> program is the ability to convey knowledge and intuition regarding the behavior of the program. |
|
http://www.cc.gatech.edu/classes/cs7390_98_winter/reports/parallel/chap17.html
(808 words)
|
|
| |
| | Exforsys.com - Oracle Apps 11i Free Training : <b>Concurrentb> Processing |
| | A <b>concurrentb> program execution file is an operating system file or database stored procedure which contains your application logic and can be executed by either invoking it directly on the command line or by invoking a program which acts upon it. | | | <b>Concurrentb> programs use <b>concurrentb> program executables to locate the correct execution file. | | | Perl <b>Concurrentb> Program – used for programs written in CGI Perl. |
|
http://www.exforsys.com/content/view/1507/342
(798 words)
|
|
| |
| | Annotated Transition Systems for Verifying <b>Concurrentb> Programs |
| | Unlike in the case of sequential programs, where annotating a program text and its control flow amounts to the same, those two possible patterns of attaching assertions are different in the presence of concurrency. | | | Therefore assertions annotate not a text of a program but a transition system which represents an object derived from the operational semantics, the control flow of a program. | | | The relative ease in establishing soundness and completeness of the proposed proof methods is due to the fact that the semantics is given a priority in suggesting the pattern of reasoning and the abstraction of program behaviours. |
|
http://www.lfcs.inf.ed.ac.uk/reports/91/ECS-LFCS-91-150
(335 words)
|
|
| |
| | The Evans School: <b>Concurrentb> Programs |
| | <b>Concurrentb> degree candidates are required to meet the core and final project requirements of each program. | | | Students may wait to apply to a <b>concurrentb> program after having completed a year of study in either program, but simultaneous admission to both programs at the outset provides optimal flexibility. | | | Students may wait to apply to the <b>concurrentb> program after having completed a year of study in either the MPA or JD program. |
|
http://evans.washington.edu/degree/concurrent.php
(645 words)
|
|
| |
| | Chapter 10: <b>Concurrentb> Programs |
| | Concurrency can be purely virtual, like the execution of a program on a computer with one single processor. | | | Only a few years ago, the majority of software developers were able to concentrate on problems occurring when a program executed one single sequential command stream. | | | But it can be actually present, when several processors or even several computers are involved. |
|
http://utjava.uw.hu/utj0072.html
(225 words)
|
|
| |
| | The World Wide Web Virtual Library: <b>Concurrentb> Systems |
| | <b>Concurrentb> and Logic Programming, Department of Computer Science, University of Bristol, UK. | | | UNITY, a programming notation and a logic to reason about parallel and distributed programs. | | | <b>Concurrentb> Systems Architecture Group, Department of Computer Science, University of Illinois at Urbana-Champaign, USA. |
|
http://vl.fmnet.info/concurrent
(955 words)
|
|
| |
| | JakeO.com - History of the C Programming Language |
| | The C programming language and its direct descendants are by far the most popular programming languages used in the world today. | | | Now, newcomers to programming learn C even though they probably are not at all familiar with the Unix environment. | | | C is now such a popular programming language that there have been several descendants from it that are in wide use. |
|
http://www.jakeo.com/words/clanguage.php
(2520 words)
|
|
| |
| | Caltech Computer Science Technical Reports - Properties of <b>Concurrentb> Programs |
| | In this paper we explore program properties of the form U -> V where U and V are either predicates on states of a program or program properties, and -> satisfies three rules that are also used in reasoning about sequential programs and safety properties of parallel programs. | | | V where U and V are either predicates on states of a program or program properties, and -> satisfies three rules that are also used in reasoning about sequential programs and safety properties of parallel programs. | | | A program property is a predicate on programs. |
|
http://caltechcstr.library.caltech.edu/112
(167 words)
|
|
| |
| | Programming language - Wikipédia |
| | The rigorous definition of the meaning of programming languages is the subject of Formal semantics. | | | Programming languages are not error tolerant; however, the burden of recognising and using the special vocabulary is reduced by help messages generated by the programming language implementation. | | | The development of programming languages, unsurprisingly, follows closely the development of the physical and electronic processes used in today's computers. |
|
http://su.wikipedia.org/wiki/Programming_language
(1603 words)
|
|
| |
| | Chapter 7--<b>Concurrentb> Robot Programs |
| | This is called <b>concurrentb> programming and we will introduce it here, with some of its pitfalls. | | | One especially nice way to make <b>concurrentb> robot programs is to let each robot be controlled by its own thread. | | | Each thread in a robot program is just like a task: a sequence of robot instructions executed one after the other until the end. |
|
http://www.cs.gordon.edu/courses/cs112/KarelJava/ch7/kjrCh7.html
(1765 words)
|
|
| |
| | Data Flow Analysis Frameworks for <b>Concurrentb> Programs |
| | In this paper, we extend data flow frameworks for sequential program analysis to accommodate <b>concurrentb> programs. | | | Unfortunately, a number of important assumptions of this work are violated when we apply data flow analysis results to <b>concurrentb> programs. | | | Data flow analysis is a well studied family of static program analyses. |
|
http://www.cs.umass.edu/Dienst/UI/2.0/Describe/ncstrl.umassa_cs/UM-CS-1995-062
(162 words)
|
|
| |
| | Visual Execution of <b>Concurrentb> Programs |
| | The project is also developing a higher-level model that will help programmers understand large, complex <b>concurrentb> programs. | | | The model provides a basis for adding visual interfaces to various kinds of software development tools, including debuggers, symbolic interpreters, structural testing tools and assertion checkers. | | | This project has developed a visual execution model for Ada tasking programs and is currently implementing the model. |
|
http://www.cse.msu.edu/~ldillon/cmodel-abst.html
(143 words)
|
|
| |
| | Detecting Dead Statements for <b>Concurrentb> Programs |
| | With more and more <b>concurrentb> programs being used in practice, technique and tools to analyze such programs are urgently needed. | | | In this method <b>concurrentb> programs are represented by <b>concurrentb> control flow graphs in a simple and precise way, and detecting rules are extracted by analyzing program behaviors. | | | Therefore, we develop a data flow approach to detect dead statements for <b>concurrentb> programs. |
|
http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/scam/2001/1387/00/1387toc.xml&DOI=10.1109/SCAM.2001.972667
(200 words)
|
|
| |
| | Questions: Visualizing <b>Concurrentb> Programs |
| | Guiding vs. Rationalizing: Miller makes the point that a guiding visualization should not need detailed instructions from the user (and that this is useful when visualizing a program when the user doesn't know everything about it). | | | Also, how important is it that the model be intuitively understandable: as long as the model is consistent, we can learn how the model works, and if this is easier to learn/understand than the underlying stuff it represents, it will be useful. | | | It was titled "An Essay on Parallel Program Visualization" but the paper hardly discussed parallel programs. |
|
http://www.cc.gatech.edu/classes/cs7390_96_winter/feb23q.html
(905 words)
|
|
| |
| | Slicing <b>Concurrentb> Java Programs - Zhao (ResearchIndex) |
| | Abstract: Although many slicing algorithms have been proposed for object-oriented programs, no slicing algorithm has been proposed which can be used to handle the problem of slicing <b>concurrentb> Java programs correctly. | | | In this paper, we propose a slicing algorithm for <b>concurrentb> Java programs. | | | To slice <b>concurrentb> Java programs, we present a dependence-based representation called multithreaded dependence graph, which extends previous dependence graphs, to represent <b>concurrentb> Java programs. |
|
http://citeseer.ist.psu.edu/zhao99slicing.html
(588 words)
|
|
| |
| | Caltech Computer Science Technical Reports - A Development Methodology for <b>Concurrentb> Programs |
| | This paper describes a development methodology for the design of <b>concurrentb> programs that provides a migration path from existing sequential C and FORTRAN programs. | | | Although the examples we present use the C programming language, the concepts will also be available in FORTRAN. | | | These programs may be executed immediately, without change, using the entire physical memory of a distributed memory machine or a network of ATM-coupled shared-memory multiprocessors. |
|
http://caltechcstr.library.caltech.edu/225
(188 words)
|
|
| |
| | Data Flow Analysis for Verifying Properties of <b>Concurrentb> Programs |
| | Using this approach, a developer specifies a property of a <b>concurrentb> program as a pattern of selected program events and asks the analysis to verify that all or no program executions satisfy the given property. | | | In this paper we present an approach, based on data flow analysis, that can provide cost-effective analysis of <b>concurrentb> programs with respect to explicitly stated correctness properties. | | | We have developed a family of polynomial-time, conservative data flow analysis algorithms that support reasoning about these questions. |
|
http://www.cs.umass.edu/Dienst/UI/2.0/Describe/ncstrl.umassa_cs/UM-CS-1994-045
(222 words)
|
|
| |
| | conference.html |
| | Principles of Proving <b>Concurrentb> Programs in Gypsy, R. Cohen, D. Good and J. Keeton-Williams, in Proceedings of the Sixth ACM Symposium on Principles of Programming Languages, January, 1979. | | | Good, W. Young, Generics and Verification in Ada, In Proceedings of the ACM Symposium on the Ada Programming Language, November, 1980. | | | Good, Provable Programs and Processors, In Proceedings of 1974 National Computer Conference, AFIPS Press, 1974. |
|
http://www.computationallogic.com/staff/publications/conference.html
(1574 words)
|
|
| |
| | <b>Concurrentb> programming language - Wikipedia, the free encyclopedia |
| | <b>Concurrentb> programming languages are programming languages that use language constructs for concurrency. | | | This style of <b>concurrentb> programming usually requires the application of some form of locking (e.g., mutexes, semaphores, or monitors) to coordinate between threads. | | | SALSA– actor language with token-passing, join, and first-class continuations for distributed computing over the internet |
|
http://en.wikipedia.org/wiki/Concurrent_programming
(483 words)
|
|
| |
| | Compositional Proofs of <b>Concurrentb> Programs |
| | The input language of Murphi, a popular model-checker, is based on UNITY [6]. | | | G : A -> B because the two programs might interfere with each other. | | | For example, if x is a shared variable, then F might increment x and G might decrement x; each program guarantees that eventually |
|
http://www.cl.cam.ac.uk/users/lcp/Grants/UNITY.html
(1651 words)
|
|
| |
| | The Digital Phoenix: How Computers are Changing Philosophy |
| | In their "Computers, Visualization, and the Nature of Reasoning", Jon Barwise and John Etchemendy describe their well-known programs Turing's World, Tarski's World and Hyperproof, which are used in logic courses all over the world. | | | The authors describe how the graphical output of their programs inspired them to explore a wholly new area of logic, namely the study of inference processes involving non-sentential representations (such as diagrams). | | | Her project is different from traditional philosophy of science in that she cannot afford to be vague about the details of the growth of scientific theories. |
|
http://www2.eur.nl/fw/fict/publications/1999phoenix.html
(2985 words)
|
|
| |
| | IBM Research - Brent Hailpern |
| | An architecture for dynamic reconfiguration in a distributed object-based programming language, with Gail E. Kaiser. | | | SW2: An object-based programming environment, with Mark Laff. | | | Dynamic reconfiguration in an object-based programming language with shared data, with Gail E. Kaiser. |
|
http://www.research.ibm.com/people/b/bth/publications.html
(803 words)
|
|
| |
| | Sergiu Hart / papers / Termination of Probabilistic <b>Concurrentb> Programs |
| | <b>Concurrentb> Probabilistic Programs, or: How to Schedule If You Must | | | The asynchronous execution behavior of several <b>concurrentb> processes, which may use randomization, is studied. | | | This is demonstrated by (1) establishing lower bounds, similar to those known for deterministic protocols, on the size of a shared variable necessary to ensure mutual exclusion and lockout-free behavior of a "randomized" protocol and (2) showing that no fully symmetric "randomized" protocol can ensure mutual exclusion and freedom from lockout. |
|
http://www.ma.huji.ac.il/~hart/abs/term-pr.html
(273 words)
|
|
| |
| | Tempo: a declarative <b>concurrentb> programming language |
| | <b>Concurrentb> logic programming languages (e.g., Parlog, KL1, etc.) are declarative in the sense that a program explicitly describes the final result (if any) that it computes. | | | Unfortunately, even "declarative" languages tend to resort to imperative ("non-logical") features for some purposes, particularly for interaction with their environment, e.g., I/O. This is perhaps especially true in <b>concurrentb> programming, where a lot of programming effort goes into ensuring that processes correctly interact with each other. | | | It improves on traditional <b>concurrentb> logic programming languages in that a program can explicitly specify its safety properties, not just the final result computed (which is a special case of a safety property). |
|
http://www.cs.bris.ac.uk/~steve/research/projects/tempo.html
(300 words)
|
|
| |
| | Designing a <b>Concurrentb> Programming Language - Ueda (ResearchIndex) |
| | GHC was born from a study of parallelism in logic programming, but turned out to be a simple and flexible <b>concurrentb> programming language with a number of nice properties. | | | is a simple <b>concurrentb> logic language born from the research on parallelism in logic programming. | | | 3 Programming Language Doc and Its Self-Description or (context) - Hirata - 1986 |
|
http://citeseer.ist.psu.edu/ueda90designing.html
(654 words)
|
|
|
