Proc. of the European symposium on programming on ESOP 86
A simple approach to specifying concurrent systems
Communications of the ACM
The existence of refinement mappings
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Three logics for branching bisimulation
Journal of the ACM (JACM)
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Forward and backward simulations I.: untimed systems
Information and Computation
Programming with threads
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Processes are in the eye of the beholder
Theoretical Computer Science
Liveness-preserving simulation relations
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Reduction: a method of proving properties of parallel programs
Communications of the ACM
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Simulations Between Specifications of Distributed Systems
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Trace Refinement of Action Systems
CONCUR '94 Proceedings of the Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Stepwise Refinement of Action Systems
Proceedings of the International Conference on Mathematics of Program Construction, 375th Anniversary of the Groningen University
Using eternity variables to specify and prove a serializable database interface
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
A theory of normed simulations
ACM Transactions on Computational Logic (TOCL)
Eternity variables to prove simulation of specifications
ACM Transactions on Computational Logic (TOCL)
Distributed Computing - Special issue: Specification of concurrent systems
Critique of the lake arrowhead three
Distributed Computing - Special issue: Specification of concurrent systems
Distributed Computing - Special issue: Verification of lazy caching
Stuttering Abstraction for Model Checkin
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
A criterion for atomicity revisited
Acta Informatica
Universal extensions to simulate specifications
Information and Computation
A challenge for atomicity verification
Science of Computer Programming
Simulation Refinement for Concurrency Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Completeness of ASM Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
A queue based mutual exclusion algorithm
Acta Informatica
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
| Hi-index | 0.00 |
In recent years, we applied and extended the theory of Abadi and Lamport (1991) [1] on the existence of refinement mappings. The present paper presents an overview of our extensions of the theory. For most concepts we provide examples or pointers to case studies where they occurred. The paper presents the results on semantic completeness. It sketches out how the theory is related to the other formalisms in the area. It discusses the tension between semantic completeness and methodological convenience. It concludes with our experience with the theorem provers NQTHM and PVS that were used during these projects.