Connections between two theories of concurrency: metric spaces and synchronization trees
Information and Control
Communicating sequential processes
Communicating sequential processes
A programming language for the inductive sets, and applications
Information and Control
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Algebraic theory of processes
Understanding and debugging novice programs
Artificial Intelligence - Special issue on artificial intelligence and learning environments
Automated program recognition: a feasibility demonstration
Artificial Intelligence
Understanding natural programs using proper decomposition
ICSE '91 Proceedings of the 13th international conference on Software engineering
An Introduction to Proving the Correctness of Programs
ACM Computing Surveys (CSUR)
Communicating sequential processes
Communications of the ACM
Symbolic execution and program testing
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Automatic Program DeBugging for Intelligent Tutoring Systems
Automatic Program DeBugging for Intelligent Tutoring Systems
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Program Flow Analysis: Theory and Application
Program Flow Analysis: Theory and Application
Knowledge-Based Program Analysis
IEEE Software
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
Automatic Analysis of the Logical Structure of Programs
Automatic Analysis of the Logical Structure of Programs
Intelligent Assistance for Program Recognition, Design, Optimization, and Debugging
Intelligent Assistance for Program Recognition, Design, Optimization, and Debugging
Plan analysis of programs
CASCON '93 Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1
| Hi-index | 0.00 |
In this paper, we investigate the use of process algebras for program representation and program understanding. Process algebras can be used not only to represent process behaviour, but also to reason about, it by defining equivalence and partial order relations. In our approach, the programming language constructs are denoted as communicating agents, and the program semantics are given in a compositional way in terms of the semantics of the program's subcomponents. Semantic equivalences between code fragments and process algebra descriptions of standard programming plans can he derived in this formalism. This paper illustrates these ideas and identifies relevant. research issues.