Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Proving entailment between conceptual state specifications
Theoretical Computer Science - First European Symposium on Programming, Saarbru:9Aicken, W. Germany, March 17:8
Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
On decomposing and refining specifications of distributed systems
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
The existence of refinement mappings
Theoretical Computer Science
Proving correctness with respect to nondeterministic safety specifications
Information Processing Letters
Larch: languages and tools for formal specification
Larch: languages and tools for formal specification
Compositional specification and verification of distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving nondeterministically specified safety properties using progress measures
Information and Computation
Proof-checking a data link protocol
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Three logics for branching bisimulation
Journal of the ACM (JACM)
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
IEEE Transactions on Software Engineering
Forward and backward simulations I.: untimed systems
Information and Computation
Branching bisimilarity is an equivalence indeed!
Information Processing Letters
Forward and backward simulations II.: timing-based systems
Information and Computation
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Equational term graph rewriting
Fundamenta Informaticae - Special issue on graph transformations
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
A model and proof system for asynchronous networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394
Formal Methods in System Design
Distributed Algorithms
Communication and Concurrency
Incremental Verification by Abstraction
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Possibly Infinite Sequences in Theorem Provers: A Comparative Study
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
Simulations Between Specifications of Distributed Systems
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
A Simple Characterization of Stuttering Bisimulation
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Computer-Assisted Simulation Proofs
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Powerful Techniques for the Automatic Generation of Invariants
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Verifying Safety Properties Using Non-deterministic Infinite-state Automata
Verifying Safety Properties Using Non-deterministic Infinite-state Automata
Focus Points and Convergent Process Operators
Focus Points and Convergent Process Operators
LIVENESS IN TIMED AND UNTIMED SYSTEMS
LIVENESS IN TIMED AND UNTIMED SYSTEMS
Correctness of Communications Protocols, A case Study
Correctness of Communications Protocols, A case Study
An algebraic definition of simulation between programs
An algebraic definition of simulation between programs
Data Refinement: Model-Oriented Proof Methods and their Comparison
Data Refinement: Model-Oriented Proof Methods and their Comparison
Universal extensions to simulate specifications
Information and Computation
On the Minimisation of Acyclic Models
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Compositional Abstraction in Real-Time Model Checking
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Simulation refinement for concurrency verification
Science of Computer Programming
On the refinement of liveness properties of distributed systems
Formal Methods in System Design
Hi-index | 0.00 |
In existing simulation proof techniques, a single step in a lower-level specification may be simulated by an extended execution fragment in a higher-level one. As a result, it is cumbersome to mechanize these techniques using general-purpose theorem provers. Moreover, it is undecidable whether a given relation is a simulation, even if tautology checking is decidable for the underlying specification logic. This article studies various types of normed simulations. In a normed simulation, each step in a lower-level specification can be simulated by at most one step in the higher-level one, for any related pair of states. In earlier work we demonstrated that normed simulations are quite useful as a vehicle for the formalization of refinement proofs via theorem provers. Here we show that normed simulations also have pleasant theoretical properties: (1) under some reasonable assumptions, it is decidable whether a given relation is a normed forward simulation, provided tautology checking is decidable for the underlying logic; (2) at the semantic level, normed forward and backward simulations together form a complete proof method for establishing behavior inclusion, provided that the higher-level specification has finite invisible nondeterminism.