Forward and backward simulations I.: untimed systems
Information and Computation
Forward and backward simulations II.: timing-based systems
Information and Computation
Specifying and using a partitionable group communication service
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Providing automated support to deductive analysis of time critical systems
ESEC '97/FSE-5 Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering
Formalizing space shuttle software requirements: four case studies
ACM Transactions on Software Engineering and Methodology (TOSEM)
Using Abstraction and Model Checking to Detect Safety Violations in Requirements Specifications
IEEE Transactions on Software Engineering
Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394
Formal Methods in System Design
Human-Style Theorem Proving Using PVS
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Towards a Duration Calculus Proof Assistant in PVS
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Verifying Hybrid Systems Modeled as Timed Automata: A Case Study
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
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)
Mechanical verification of timed automata: a case study
RTAS '96 Proceedings of the 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96)
WIFT '95 Proceedings of the 1st Workshop on Industrial-Strength Formal Specification Techniques
The Industrial Use of Formal Methods: Was Darwin Right?
WIFT '98 Proceedings of the Second IEEE Workshop on Industrial Strength Formal Specification Techniques
An Introduction to Requirements Capture Using PVS: Specification of a Simple Autopilot
An Introduction to Requirements Capture Using PVS: Specification of a Simple Autopilot
Automated deductive requirements analysis of critical systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
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
Applying Practical Formal Methods to the Specification and Analysis of Security Properties
MMM-ACNS '01 Proceedings of the International Workshop on Information Assurance in Computer Networks: Methods, Models, and Architectures for Network Security
Specification Modeling and Validation Applied to a Family of Network Security Products
Proceedings of the 16th IEEE international conference on Automated software engineering
| Hi-index | 0.00 |
TAME is a special-purpose interface to PVS designed to support developers of software systems in proving properties of automata models. One of TAME's major goals is to allow a software developer who has basic knowledge of standard logic, and can do hand proofs, to use PVS to represent and to prove properties about an automaton model without first becoming a PVS expert. A second goal is for a human to be able to read and understand the content of saved TAME proofs without running them through the PVS proof checker. A third goal is to make proving properties of automata with TAME less costly in human time than proving such properties using PVS directly. Recent work by Romijn and Devillers et al., based on the I/O automata model, has provided the basis for two case studies on how well TAME achieves these goals. Romijn specified the RPC-Memory Problem and its solution, while Devillers et al. specified a tree identify protocol. Hand proofs of specification properties were provided by the authors. In addition, Devillers et al. used PVS directly to mechanize the specifications and proofs of the tree identify protocol. In one case study, the third author, a new TAME user with no previous PVS experience, used TAME to create PVS specifications of the I/O automata presented by Romijn and Devillers et al. and to check the hand proofs of invariant properties. The PVS specifications and proofs of Devillers et al. \hspace*{-.03in} provide the basis for the other case study, which compares the TAME approach to an alternate approach which uses PVS directly.