|
| |
| | Advanced Slicing of Sequential and Concurrent Programs |
 | | Program slicing is a technique to identify statements that may influence the computations in other statements. | | | 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. | | | In the theoretical part, this thesis presents a high-precision approach to slice concurrent procedural programs despite that optimal slicing is known to be undecidable. |
|
http://www.fernuni-hagen.de/ST/diss.php
(224 words)
|
|
| |
| | Chapter 15 |
| | Concurrent programming is useful in modeling or simulating physical systems, even if those systems are not directly controlled by a computer. | | | Concurrent 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 concurrent program may be literally parallel, entirely time-shared, or some combination of the two. | | | Suppose you are using the computer to edit a program or read electronic mail. |
|
http://www.seas.gwu.edu/~mfeldman/cs2-book/chap15.html
(8080 words)
|
|
| |
| | On Concurrent Programming |
| | Even the size of a large program need not be an impediment—large concurrent programs are often just small algorithms in disguise. | | | Identify a relation between the program variables that is true initially and is left true by each action of the program. | | | Such small concurrent algorithms can be programmed and analyzed; we build a model and analyze it to gain insight about the full-scale artifact. |
|
http://www.cs.cornell.edu/ugrad/FBS-Article.htm
(777 words)
|
|
| |
| | Visualizing Concurrent Programs |
| | Clustering and filtering techniques are used to examine the stream of primitive events from the program, and applies a pattern-matching algorithm to construct user-specified abstract events. | | | Gthreads package provides an animated program call graph view, which is dynamically constructed as threads are forked, functions are called, and the point of execution of a thread moves from function to function. | | | Appropriate displays of concurrent programs can help the viewer develop intuition about performance and correctness problems that stem from unanticipated interactions between processes. |
|
http://www.cc.gatech.edu/classes/cs7390_98_winter/reports/parallel/chap17.html
(808 words)
|
|
| |
| | Exforsys.com - Oracle Apps 11i Free Training : Concurrent Processing |
| | A concurrent 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. | | | Concurrent programs use concurrent program executables to locate the correct execution file. | | | Perl Concurrent Program – used for programs written in CGI Perl. |
|
http://www.exforsys.com/content/view/1507/342
(798 words)
|
|
| |
| | Annotated Transition Systems for Verifying Concurrent 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. | | | In doing so we put an emphasis on reflecting the semantic contents of programs rather than their syntax in the adopted pattern of reasoning. |
|
http://www.lfcs.inf.ed.ac.uk/reports/91/ECS-LFCS-91-150
(335 words)
|
|
| |
| | The Evans School: Concurrent Programs |
| | Concurrent degree candidates are required to meet the core and final project requirements of each program. | | | Students may wait to apply to a concurrent 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 concurrent 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: Concurrent 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: Concurrent Systems |
| | Concurrent 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. | | | Concurrent 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 Concurrent Programs |
| | A program property is a predicate on 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. |
|
http://caltechcstr.library.caltech.edu/112
(167 words)
|
|
| |
| | Chapter 7--Concurrent Robot Programs |
| | Each thread in a robot program is just like a task: a sequence of robot instructions executed one after the other until the end. | | | For example, if two computers are connected to the same printer, and the print driver on each isn't careful, it would be possible for two users to print at about the same time and have the individual characters of the two documents interleaved on the output. | | | One especially nice way to make concurrent robot programs is to let each robot be controlled by its own thread. |
|
http://www.cs.gordon.edu/courses/cs112/KarelJava/ch7/kjrCh7.html
(1765 words)
|
|
| |
| | Data Flow Analysis Frameworks for Concurrent Programs |
| | In this paper, we extend data flow frameworks for sequential program analysis to accommodate concurrent programs. | | | Data flow analysis is a well studied family of static program analyses. | | | Unfortunately, a number of important assumptions of this work are violated when we apply data flow analysis results to concurrent programs. |
|
http://www.cs.umass.edu/Dienst/UI/2.0/Describe/ncstrl.umassa_cs/UM-CS-1995-062
(162 words)
|
|
| |
| | Visual Execution of Concurrent Programs |
| | This project has developed a visual execution model for Ada tasking programs and is currently implementing the model. | | | The project is also developing a higher-level model that will help programmers understand large, complex concurrent 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. |
|
http://www.cse.msu.edu/~ldillon/cmodel-abst.html
(143 words)
|
|
| |
| | Detecting Dead Statements for Concurrent Programs |
| | With more and more concurrent programs being used in practice, technique and tools to analyze such programs are urgently needed. | | | In this method concurrent programs are represented by concurrent 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 concurrent 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 Concurrent Programs |
| | All the heuristics given apply equally to non-parallel programs as parallel 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). | | | Miller says that a visualization that `guides' leads you to discover things you didn't already know while one that `rationalizes' only illustrates things you already know, then says a tool is rationalizing if the user has to give the tool detailed instructions implying they already know how the program is working. |
|
http://www.cc.gatech.edu/classes/cs7390_96_winter/feb23q.html
(905 words)
|
|
| |
| | Slicing Concurrent 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 concurrent Java programs correctly. | | | In this paper, we propose a slicing algorithm for concurrent Java programs. | | | 454 The Program Dependence Graph and Its Use in Optimization (context) - Ferrante, Ottenstein et al. |
|
http://citeseer.ist.psu.edu/zhao99slicing.html
(588 words)
|
|
| |
| | [No title] |
| | This practice might exclude low-income students from such programs when no tuition assistance or financial aid is available Difficulty in transferring courses Course restrictions Lack of information about the availability and requirements of postsecondary options programs. | | | College Level Examination Program: The College Level Examination Program (CLEP) permits students to test out of beginning level college courses at colleges and universities. | | | Other college credit programs: Advanced Placement: Overseen by the College Board, Advanced Placement (AP) courses are offered at high schools and taught by high school faculty. |
|
http://www.ecs.org/clearinghouse/28/11/2811.doc
(5022 words)
|
|
| |
| | Caltech Computer Science Technical Reports - A Development Methodology for Concurrent Programs |
| | 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. | | | This paper describes a development methodology for the design of concurrent 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. |
|
http://caltechcstr.library.caltech.edu/225
(188 words)
|
|
| |
| | Data Flow Analysis for Verifying Properties of Concurrent Programs |
| | Using this approach, a developer specifies a property of a concurrent 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 concurrent 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)
|
|
| |
| | [No title] |
| | Good, Provable Programs and Processors, In Proceedings of 1974 National Computer Conference, AFIPS Press, 1974. | | | Gypsy: A Language for Specification and Implementation of Verifiable Programs. | | | Program Verification and Embedded Aerospace Software, W. Young, D.I. Good, Proceedings of the AIAA Computers in Aerospace Conference III, October, 1981, pp. |
|
http://www.computationallogic.com/staff/publications/conference.html
(1574 words)
|
|
| |
| | Compositional Proofs of Concurrent 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 |
| | If they are formulated in terms of computer programs, one may simply run the program and see what happens. | | | 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). |
|
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 Concurrent Programs |
| | 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. | | | Concurrent Probabilistic Programs, or: How to Schedule If You Must | | | Additional Key Words and Phrases: Program analysis, Markov chains, ergodic sets |
|
http://www.ma.huji.ac.il/~hart/abs/term-pr.html
(273 words)
|
|
| |
| | Software Systems Dept.: Context-Sensitive Slicing of Concurrent Programs |
| | Program slicing is a technique to identify statements that may influence the computations at other statements. | | | It extends the well known structures of the control flow graph and the (interprocedural) program dependence graph for concurrent programs with interference. | | | This work presents the first context-sensitive approach to slice concurrent programs accurately. |
|
http://www.infosun.fmi.uni-passau.de/st/papers/fse03
(256 words)
|
|
| |
| | Concurrent Programming Using the Java Language |
| | These example programs were developed and tested using Sun Microsystem's JDK version 1.0.2 and 1.1 for Solaris 2.x and Windows 95/NT (1996--97). | | | Some of the animation examples can be viewed as applets. | | | environment variable so that your Java programs can import the classes in the subdirectories of |
|
http://cricket.cs.drexel.edu/~shartley/ConcProgJava
(348 words)
|
|
| |
| | Citations: Translating Concurrent Communicating Programs into Asynchronous Circuits - Brunvand (ResearchIndex) |
| | Several design styles use high level languages of concurrency as their user level specification formalisms. | | | The synthesis procedures typically involve syntax driven translation [4] or algebraic transformation [5] of the specifications into delay insensitive (DI) or speed independent (SI) circuits. | | | ) as a potential means for the modelling of asynchronous designs due to the strong relationship between its semantics and the behaviour and structure of asynchronous systems: ffl CSP supports a concurrent, process based, asynchronous, non deterministic model of computation which exactly matches. |
|
http://citeseer.csail.mit.edu/context/356192/0
(3741 words)
|
|
| |
| | Concurrent Programs |
| | We describe a mechanical proof system for concurrent programs, based on a formalization of the temporal framework of Manna and Pnueli as an extension of the computational logic of Boyer and Moore. | | | The utility of the system is illustrated by a correctness proof for a two-process program that computes binomial coefficients. | | | The system provides a natural representation of specifications of concurrent programs as temporal logic formulas, which are automatically translated into terms that are subject to verification by the Boyer-Moore prover. |
|
http://www.onr.com/user/russ/david/mp.html
(118 words)
|
|
| |
| | uSystem, Concurrent MVD |
| | Analyzing Multi-Threaded Program Performance with uProfiler by Dorota Zak, M.Math Thesis | | | Statistical monitoring and visualization occurs in real-time, or monitored data can be written to a file for post-processing visualization. | | | uProfiler: Profiling User-Level Threads in a Shared-Memory Programming Environment by Peter A. Buhr and Robert Denda |
|
http://plg.uwaterloo.ca/~usystem/MVD.html
(368 words)
|
|
| |
| | CRC Bibliography |
| | Betancourt, R., "Computer Programs for 'Reliability Evaluation Programs' - A Survey," CSL TN 119. | | | Mahmood, A., and E.J. McCluskey, "Concurrent Error Detection Using Watchdog Processors - A Survey," IEEE Trans. | | | Hughes, J.L.A., "Implementing Control-flow Structures in Dataflow Programs," COMPCON82, pp. |
|
http://crc.stanford.edu/~munda/pubs.html
(11589 words)
|
|
| |
| | Debugging Concurrent Programs |
| | This research investigates a new approach to debugging concurrent programs based on dynamic slicing and execution backtracking. | | | One of the main difficulties is non-determinism, which can lead to the probe effect: any attempt to gain more information about the program may interfere with its behaviour. | | | Debugging concurrent programs is generally regarded as being more difficult than its sequential counterpart. |
|
http://www.dcs.ex.ac.uk/research/parallel/Slicing.html
(153 words)
|
|
| |
| | Testing Concurrent Java Programs using Randomized Scheduling |
| | The difficulty of finding errors caused by unexpected interleavings of threads in concurrent programs is well known. | | | Model checkers can pinpoint such errors and verify correctness but are not easily scalable to large programs. | | | We transform a given Java program by inserting calls to a scheduling function at selected points. |
|
http://www.cs.sunysb.edu/~stoller/RV2002.html
(94 words)
|
|
| |
| | NUSL: Curriculum - Concurrent Degree Programs |
| | Candidates for the concurrent program JD/MBA program must independently apply and gain admission to each program. | | | Candidates for the dual JD/MPH must independently apply and gain admission to each institution. | | | The program enables students to earn these degrees in 45 months rather than the 48 months which would be required if undertaken sequentially. |
|
http://www.slaw.neu.edu/course/concurrent.html
(843 words)
|
|
| |
| | UMCS-92-12-1 An object-based design method for concurrent programs |
| | In particular it explores ways in which object-based language concepts can be used to provide a compositional development method for concurrent programs. | | | Thirdly, the paper outlines the semantics of the design notation mapping its constructs to Milner's pi-calculus. | | | This paper is intended to contribute to tractable development methods for concurrent programs. |
|
http://www.cs.man.ac.uk/cstechrep/Abstracts/UMCS-92-12-1.html
(201 words)
|
|
| |
| | TCS - Research - Publications - Bounded Model Checking for Verifying Concurrent Programs |
| | A simple, parallel programming language is introduced and an operational semantics for it is developed. | | | Research Report A73, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, August 2002. | | | A compact boolean encoding of parallel programs is devised, together with the proofs of its soundness and completeness. |
|
http://www.tcs.hut.fi/Publications/A73.shtml
(205 words)
|
|
| |
| | Harvard Law School - Concurrent Degree Programs |
| | Concurrent degree programs are distinguished from joint degree programs. | | | It is important to note that these are examples of concurrent degrees from previous years, and they may not be available currently. | | | The only joint degree program at the Law School is with the Harvard Business School leading to a J.D./M.B.A. If you are interested in this program, a descriptive brochure is available at the Law School Admissions Office. |
|
http://www.law.harvard.edu/academics/registrar/98Catalog/harvard/ccframe.html
(220 words)
|
|
| |
| | Simple concurrent programs |
| | You should run each program several times, as the output may vary. | | | The output shows the random pattern of switches from one process to | | | cobegin, and the syntax for calling the processes to be run concurrently. |
|
http://webclass.cqu.edu.au/Examples/Case_Studies/85349/Development/BACI/Simple_concurrent_programs/index.txt.html
(237 words)
|
|
| |
| | A General Work for the Flow Analysis of Concurrent Programs |
| | Standard techniques for analysing sequential programs are severely constrained when applied to a concurrent program because they cannot take full advantage of the concurrent structure of the program. | | | A General Work for the Flow Analysis of Concurrent Programs | | | First, we introduce concurrency primitives which abstract away from the details of how concurrency features are implemented in real programming languages. |
|
http://etdindividuals.dlib.vt.edu/archive/00000135
(196 words)
|
|
| |
| | Concurrent Degree Programs |
| | They must demonstrate proficiency in a modern foreign language related to their field of interest and none of the units used to develop this proficiency can be counted in the 24 units required for the degree. | | | Click here for more information on the MBA/MPH dual-degree program requirements. | | | Students may apply during their first year in the MBA program for a concurrent degree program in international and area studies. |
|
http://www.haas.berkeley.edu/MBA/ConcurrentDegree.html
(865 words)
|
|
| |
| | Proving Concurrent Constraint Programs Correct |
| | The strongest postcondition semantics provides a justification of the declarative nature of concurrent constraint programs, since it allows to view programs as theories in the specification logic. | | | Soundness and (relative) completeness of the system are proved with respect to a denotational semantics based on the notion of strongest postcondition. | | | We develop a compositional proof-system for the partial correctness of concurrent constraint programs. |
|
http://www.di.unipi.it/~gabbri/abstracts/popl94-abs.html
(73 words)
|
|
| |
| | Concurrent Degree Programs |
| | Students must formally apply and be admitted to this program. | | | Students in the concurrent D.V.M.- Graduate Degree Program will need to have Program of Study approved by the Deans of both colleges. | | | Qualified and highly-motivated students may be concurrently enrolled in the professional curriculum leading to the D.V.M. degree and in a graduate program leading to the M.S. or Ph.D. degree at any time after completion of at least 128 semester credits in pre-veterinary and professional curricula. |
|
http://www.vetmed.iastate.edu/students/graduate/concurrent.asp
(401 words)
|
|
| |
| | Computer Science: Publication: Safe and Verifiable Design of Concurrent Programs |
| | Our approach uses recently developed Java class libraries based on Hoare's Communicating Sequential Processes (CSP); the use of CSP greatly simplifies the design of concurrent systems and, in many cases, a parallel approach often significantly simplifies systems originally approached sequentially. | | | The design of concurrent programs has a reputation for being difficult, and thus potentially dangerous in safety-critical real-time and embedded systems. | | | Below we introduce CSP and its implementation in Java and develop a small concurrent application. |
|
http://www.cs.kent.ac.uk/pubs/1999/1018
(265 words)
|
|
| |
| | Formal Specification and Verification of Concurrent Programs |
| | The Software Engineering Institute (SEI) is a federally funded research and development center sponsored by the U.S. Department of Defense and operated by Carnegie Mellon University. | | | Berry, D. This module introduces formal specification of concurrent software and verification of the consistency between concurrent programs and their specifications. | | | These vary in their coverage of the phenomena, and some can be used as the bases of formal specification of programs. |
|
http://www.sei.cmu.edu/publications/documents/cms/cm.027.html
(131 words)
|
|
| |
| | Concurrent Programs |
| | For more information concerning the Museum Studies Program, contact Jean Hart, (315) 443-4098. | | | Program requirements are partially satisfied with the sharing of two courses for credit in each program. | | | A separate application for each of these programs must be completed. |
|
http://www-hl.syr.edu/depts/fia/Pages/dualprog.htm
(78 words)
|
|
| |
| | Keyword: concurrent programs |
| | Try our search engine which allows complex field-based queries. | | | Branch Testing of Concurrent Programs Using Petri Net Models. | | | Yoo, K.-J. Lee, D.-I. Translating concurrent programs into speed-independent circuits through Petri net transformations. |
|
http://www.informatik.uni-hamburg.de/TGI/pnbib/keywords/c/concurrent_programs.html
(42 words)
|
|
| |
| | CSP25 - Model-based Design of Concurrent Programs |
| | The paper reviews a modelling approach to the design of concurrent programs in which models represent the behaviour of concurrent Java programs. | | | A notation based on CSP is used to model behaviour. | | | Imperial College London, UK Abstract: A model is a simplified representation of the real world and, as such, includes only those aspects of the real-world system relevant to the problem at hand. |
|
http://www.lsbu.ac.uk/menass/csp25/programme/csp25jm.html
(130 words)
|
|
| |
| | Concurrent Degree Programs |
| | Some concurrent programs require that the program applications for each component be submitted. | | | Concurrent degree programs have been established to provide an integrated curriculum of greater breadth between two disciplines. | | | For specific information and application deadlines for these programs, contact the departments or schools involved. |
|
http://www.grad.berkeley.edu/grad/programs/concurrent.shtml
(111 words)
|
|
|
