Handbook of theoretical computer science (vol. B)
Larch: languages and tools for formal specification
Larch: languages and tools for formal specification
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Specification of abstract dynamic-data types: a temporal logic approach
Theoretical Computer Science - Special issue: algebraic development techniques
Subtypes for Specifications: Predicate Subtyping in PVS
IEEE Transactions on Software Engineering
A Classification and Comparison Framework for Software Architecture Description Languages
IEEE Transactions on Software Engineering
Formal Specification and Proof Techniques for Mixed Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
From algebra transformation to labelled transition systems
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Symbolic Bisimulation for Full LOTOS
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Introducing Dynamic Constraints in B
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Abstract Datatypes in PVS
| Hi-index | 0.00 |
Formal specification of mixed systems is one of the main issues in software engineering. However several difficulties remain. Amongst them is the ability to produce a coherent mixed specification and to provide tools for verifying it. The Graphic Abstract data Type (GAT) approach is proposed to cope with this issue. GAT is a mixed formalism based on Symbolic Transition Systems (STSs) and algebraic specifications of partial abstract data types. This paper presents how to translate a GAT into PVS. The principle is to define a total data type with generators and predicates. Then a partial data type is obtained using the previous one and the definedness predicate as a PVS subtype predicate. This allows us to get the benefit of the PVS automatic generation of type-correctness conditions. Several ways to translate operation axioms are discussed. Lastly our paper shows some proofs of temporal properties.