Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Statecharts: A visual formalism for complex systems
Science of Computer Programming
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Parallel program design: a foundation
Parallel program design: a foundation
STATEMATE: A Working Environment for the Development of Complex Reactive Systems
IEEE Transactions on Software Engineering
Design and validation of computer protocols
Design and validation of computer protocols
Interleaving set temporal logic
Theoretical Computer Science
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
The Z notation: a reference manual
The Z notation: a reference manual
An introduction to formal specification and Z
An introduction to formal specification and Z
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
IEEE Transactions on Software Engineering
Better verification through symmetry
Formal Methods in System Design - Special issue on symmetry in automatic verification
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Refinement with global equivalence proofs in temporal logic
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Elements of distributed algorithms: modeling and analysis with Petri nets
Elements of distributed algorithms: modeling and analysis with Petri nets
Symbolic Model Checking
LOTOSphere: Software Development with Lotos
LOTOSphere: Software Development with Lotos
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
STeP: The Stanford Temporal Prover (Educational Release) User''s Manual
STeP: The Stanford Temporal Prover (Educational Release) User''s Manual
A Framework for Translating Models and Specifications
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
Science of Computer Programming
A proof framework for concurrent programs
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
| Hi-index | 0.00 |
Numerous translations exist between the design notations of formal methods tools, usually between two specific notations. In addition, more general translation frameworks are under development. For any translation it is vital that properties true of the semantic interpretations of the source and the translated notations are closely related. Some possible applications of translations among model descriptions are described and key issues in translating among models with inconsistent features are identified, leading to a source and a target model that do not always preserve the correctness of properties in a simple way. The concept is presented of a faithful relation among models and families of properties true of those models. In this framework families of properties are provided with uniform syntactic transformations, in addition to the translations of the models. Three variants are presented, depending on the intended use of the translation, so that the correctness of a property in a model corresponds to the correctness of the transformed property in the translated model. This framework is shown appropriate for common instances of relations among translations previously treated in an ad hoc way. Furthermore, it allows expressing connections among models where one is neither a refinement nor an abstraction of the other. The classes of properties that can be faithful for a given translation provide a measure of the usefulness of the translation.