Task support in an office system
ACM Transactions on Information Systems (TOIS)
Communicating sequential processes
Communicating sequential processes
Describing and analyzing distributed software system designs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A model and temporal proof system for networks of processes
Distributed Computing
IEEE Transactions on Software Engineering
A general-purpose algorithm for analyzing concurrent programs
Communications of the ACM
ACM Computing Surveys (CSUR)
A New Approach to Proving the Correctness of Multiprocess Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
A language for formal problem specification
Communications of the ACM
Synchronization of communicating processes
Communications of the ACM
The specification of process synchronization by path expressions
Operating Systems, Proceedings of an International Symposium
PETRI NET LANGUAGE
Experiments in Constrained Expression Analysis
Experiments in Constrained Expression Analysis
Analysis of distributed systems using constrained expressions (concurrent systems)
Analysis of distributed systems using constrained expressions (concurrent systems)
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Experiments in automated analysis of concurrent software systems
TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
Integrated concurrency analysis in a software development enviornment
TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
Experiments with an improved constrained expression toolset
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Interprocedural static analysis of sequencing constraints
ACM Transactions on Software Engineering and Methodology (TOSEM)
Automated Analysis of Concurrent Systems with the Constrained Expression Toolset
IEEE Transactions on Software Engineering
Automated Derivation of Time Bounds in Uniprocessor Concurrent Systems
IEEE Transactions on Software Engineering
A concurrency analysis tool suite for Ada programs: rationale, design, and preliminary experience
ACM Transactions on Software Engineering and Methodology (TOSEM)
Generation of multi-formalism state-space analysis tools
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
ICSE '97 Proceedings of the 19th international conference on Software engineering
Specification of Realtime Systems Using ASTRAL
IEEE Transactions on Software Engineering
Specification of realtime systems using ASTRAL
IEEE Transactions on Software Engineering
Software process validation: quantitatively measuring the correspondence of a process to a model
ACM Transactions on Software Engineering and Methodology (TOSEM)
Identical tasks and counter variables in an integer programming-based approach to verification
IWSSD '93 Proceedings of the 7th international workshop on Software specification and design
| Hi-index | 0.00 |
It is extremely difficult to characterize the possible behaviors of a distributed software system through informal reasoning. Developers of distributed systems require tools that support formal reasoning about properties of the behaviors of their systems. These tools should be applicable to designs and other preimplementation descriptions of a system, as well as to completed programs. Furthermore, they should not limit a developer's choice of development languages.In this paper we present a basis for broadly applicable analysis methods for distributed software systems. The constrained expression formalism can be used with a wide variety of distributed system development notations to give a uniform closed-form representation of a system's behavior. A collection of formal analysis techniques can then be applied with this representation to establish properties of the system. Examples of these formal analysis techniques appear elsewhere. Here we illustrate the broad applicability of the constrained expression formalism by showing how constrained expression representations are obtained from descriptions of systems in three different notations: SDYMOL, CSP, and Petri nets. Features of these three notations span most of the significant alternatives for describing distributed software systems. Our examples thus offer persuasive evidence for the broad applicability of the constrained expression approach.