Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Parallel program design: a foundation
Parallel program design: a foundation
Programming distributed systems
Programming distributed systems
A proof system for the parallel object-oriented language POOL
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Common LISP: the language (2nd ed.)
Common LISP: the language (2nd ed.)
Object-oriented specification of reactive systems
ICSE '90 Proceedings of the 12th international conference on Software engineering
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
The existence of refinement mappings
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modular reasoning in the presence of subclassing
Proceedings of the tenth annual conference on Object-oriented programming systems, languages, and applications
Theoretical Computer Science - Special issue on algebraic methodology and software technology
Java Virtual Machine Specification
Java Virtual Machine Specification
Verification of a Distributed Summation Algorithm
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
A Proof Technique for Rely/Guarantee Properties
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
Incremental Specification with Joint Actions: The RPC-Memory Specification Problem
Formal Systems Specification, The RPC-Memory Specification Case Study (the book grow out of a Dagstuhl Seminar, September 1994)
Now you may compose temporal logic specifications
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
P-A logic: a compositional proof system for distributed programs
Distributed Computing
| Hi-index | 0.00 |
Objects are a convenient representation for building compositional open systems. Many object models exist in the literature and building a new proof system for each is infeasible. Instead of constructing a new proof system from first principles, we show how proof methodologies for non-object-oriented systems can be adapted. We give a sample object model that includes inheritance, active objects, and unbounded creation of both objects and threads. We show how a proof system for this model can be built from a modular concurrent logic. We also discuss the reuse of proofs during the construction of subclasses.