Larch: languages and tools for formal specification
Larch: languages and tools for formal specification
Computer aided serendipity: the role of autonomous assistants in problem solving
Proceedings of the 1999 conference on Graphics interface '99
TAME: Using PVS strategies for special-purpose theorem proving
Annals of Mathematics and Artificial Intelligence
Proving Invariants of I/O Automata with TAME
Automated Software Engineering
Mechanical Translation of I/O Automaton Specifications into First-Order Logic
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
Tackling the RPC-Memory Specification Problem with I/O Automata
Formal Systems Specification, The RPC-Memory Specification Case Study (the book grow out of a Dagstuhl Seminar, September 1994)
Compact propositional encoding of first-order theories
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
PVS Strategies for Proving Abstraction Properties of Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
In presenting specifications and specification properties to a theorem prover, there is a tension between convenience for the user and convenience for the theorem prover. A choice of specification formulation that is most natural to a user may not be the ideal formulation for reasoning about that specification in a theorem prover. However, when the theorem prover is being integrated into a system development framework, a desirable goal of the integration is to make use of the theorem prover as easy as possible for the user. In such a context, it is possible to have the best of both worlds: specifications that are natural for a system developer to write in the language of the development framework, and representations of these specifications that are well matched to the reasoning techniques provided in the prover. In a tactic-based prover, these reasoning techniques include the use of tactics (or strategies) that can rely on certain structural elements in the theorem prover's representation of specifications. This paper illustrates how translation techniques used in integrating PVS into the TIOA (Timed Input/Output Automata) system development framework produce PVS specifications structured to support development of PVS strategies that implement reasoning steps appropriate for proving TIOA specification properties.