Filters








669 Hits in 3.1 sec

PVS Strategies for Proving Abstraction Properties of Automata

Sayan Mitra, Myla Archer
2005 Electronical Notes in Theoretical Computer Science  
These strategies first set up the standard subgoals for the abstraction proofs and then execute the standard initial proof steps for these subgoals, thus making the process of proving abstraction properties  ...  Using timed I/O automata examples taken from the literature, this paper illustrates use of the templates, theories, and strategies described to specify and prove two types of abstraction property: refinement  ...  Acknowledgements We thank Sam Owre and Natarajan Shankar of SRI International for adding the features to PVS that have made our work possible. We also thank Nancy  ... 
doi:10.1016/j.entcs.2005.01.005 fatcat:sycmr4jtyfc2dgr6nar7o6gwna

Specifying and proving properties of timed I/O automata using Tempo

Myla Archer, Hongping Lim, Nancy Lynch, Sayan Mitra, Shinya Umeno
2008 Design automation for embedded systems  
Tempo, for proving system properties, including timing properties.  ...  This paper focuses on the modeling of timed systems and their properties with TIOA and on the use of TAME4TIOA, the TAME 1 (Timed Automata Modeling Environment) based theorem proving support provided in  ...  Acknowledgements We wish to thank the anonymous reviewers of earlier versions of this paper for helpful suggestions for improvements.  ... 
doi:10.1007/s10617-008-9022-2 fatcat:gbt2lm2dg5azpae3ozxoc6j6ya

Human-style theorem proving using PVS [chapter]

Myla Archer, Constance Heitmeyer
1997 Lecture Notes in Computer Science  
In developing TAME, we h a v e had moderate success in de ning specialized proof strategies to validate hand proofs of properties of Lynch-Vaandrager timed automata.  ...  TAME's support of more natural proof steps should not only facilitate mechanized checking of hand proofs, but in addition should provide assurance that theorems proved mechanically are true for the reasons  ...  Khazan for providing us with challenging examples for testing TAME. We also thank R. Je ords and S. Garland for helpful discussions.  ... 
doi:10.1007/bfb0028384 fatcat:rrrfxfg46zdddf6v6wjwa3awwq

Safety Verification of Model Helicopter Controller Using Hybrid Input/Output Automata [chapter]

Sayan Mitra, Yong Wang, Nancy Lynch, Eric Feron
2003 Lecture Notes in Computer Science  
PVS strategies for proving abstraction properties of au- tomata. Electronic Notes in Theoretical Computer Science, 125(2):45-65, 2005. 5. Sayan Mitra and L. M.  ...  Specifying and proving properties of timed I/O automata in the TIOA toolkit. To appear in Special issue of the Journal on Design Automation for Embedded Systems, 2007.  ... 
doi:10.1007/3-540-36580-x_26 fatcat:ptyxahsjffhdbk6omd5ntkkw3i

Using TAME to prove invariants of automata models

Myla Archer, Constance Heitmeyer, Elvinia Riccobene
2000 Proceedings of the third workshop on Formal methods in software practice - FMSP '00  
A third goal is to make proving properties of automata with TAME less costly in human time than proving such properties using PVS directly.  ...  TAME is a special-purpose interface to PVS designed to support developers of software systems in proving properties of automata models.  ...  A major goal of TAME is to improve on the direct support that PVS provides for specifying, and proving properties of, automata.  ... 
doi:10.1145/349360.351127 dblp:conf/fmsp/ArcherHR00 fatcat:iceo3mfga5hqzcrwtr42b26264

Integrating WS1S with PVS [chapter]

Sam Owre, Harald Rueß
2000 Lecture Notes in Computer Science  
In this way, a theorem proving system like PVS provides a common front-end and specification language for a variety of specialized tools.  ...  We are using the efficient automata-construction capabilities of MONA for building a tactic that decides a fragment of the PVS specification language.  ...  Møller for clarifying discussions about MONA internals, M. Sorea for comments on this paper, and S. Bensalem for providing interesting test cases.  ... 
doi:10.1007/10722167_42 fatcat:obik2mf2fvdvle5hetcievhhb4

A Framework for Formally Verifying Software Transactional Memory Algorithms [chapter]

Mohsen Lesani, Victor Luchangco, Mark Moir
2012 Lecture Notes in Computer Science  
We present a framework for verifying transactional memory (TM) algorithms.  ...  Specifications and algorithms are specified using I/O automata, enabling hierarchical proofs that the algorithms implement the specifications.  ...  We thank Sam Owre for PVS assistance, Andy Lewis for machines, and Simon Doherty for contributions to earlier versions of our framework.  ... 
doi:10.1007/978-3-642-32940-1_36 fatcat:xle4qgc2cvanjfpz2mkpl2brne

Verifying hybrid systems modeled as timed automata: A case study [chapter]

Myla Archer, Constance Heitmeyer
1997 Lecture Notes in Computer Science  
Recently, w e extended a mechanical veri cation system, originally developed to reason about deterministic real-time automata, to verify properties of hybrid systems.  ...  Verifying properties of hybrid systems can be highly complex. To reduce the e ort required to produce a correct proof, the use of mechanical veri cation techniques is promising.  ...  anonymous reviewers for helpful comments.  ... 
doi:10.1007/bfb0014724 fatcat:os3s6l7sbnclhho3x5iloccy6e

Translating Timed I/O Automata Specifications for Theorem Proving in PVS [chapter]

Hongping Lim, Dilsun Kaynar, Nancy Lynch, Sayan Mitra
2005 Lecture Notes in Computer Science  
This thesis describes a tool for translating from TIOA, the formal language for describing timed input/output automata, to the language of the Prototype Verification System (PVS)--a specification system  ...  In order to employ an interactive theorem prover in deducing properties of a timed input/output automaton, its statetransition based description has to be translated to the language of the theorem prover  ...  Lynch Title: NEC Professor of Software Science and Engineering  ... 
doi:10.1007/11603009_3 fatcat:dunww2rx75a4hoxxcmy4snmd2m

Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis [chapter]

Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, Yassine Lakhnech
1999 Lecture Notes in Computer Science  
We propose a realization of this approach in a framework which extends PVS with automatic invariant checking strategies, automatic procedures for generating abstract models, as well as automatabased decision  ...  We consider in particular systems modeled by means of extended automata communicating through unbounded fifo channels.  ...  Using InVeSt and the proof strategies of PVS, we have computed a finite abstraction of ABP for Mes = {0, 1}.  ... 
doi:10.1007/3-540-48683-6_15 fatcat:7i7pjhprhnaf5bkiqyyzcvmw34

Translation Templates to Support Strategy Development in PVS

Hongping Lim, Myla Archer
2007 Electronical Notes in Theoretical Computer Science  
of PVS strategies that implement reasoning steps appropriate for proving TIOA specification properties.  ...  However, rather than focusing on formulating problems for better automatic theorem proving, our work is concerned with better supporting development of strategies to simplify interactive theorem proving  ...  Acknowledgements We wish to thank Ramesh Bharadwaj, Elizabeth Leonard, and the anonymous reviewers of an earlier version of this paper for their helpful comments.  ... 
doi:10.1016/j.entcs.2007.01.057 fatcat:owksjrcgbfccvk7nhsmygelcze

Extracting FSMs from Object-Z specifications with history invariants

Jun Sun, Jin Song Dong
2005 10th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'05)  
Object-Z with history invariants can present precise and abstract models for complex systems.  ...  Safety and liveness and additional crucial requirements for open systems are ensured.  ...  To further speed up the abstriction so as to handle complex systems, a more loop-free proving strategy than grind (the highest-level command in PVS) is used to prove each lemmas in a limited amount of  ... 
doi:10.1109/iceccs.2005.44 dblp:conf/iceccs/SunD05 fatcat:2aiy5kwzbnax7aowhfcvwrvhqi

Page 8511 of Mathematical Reviews Vol. , Issue 2002K [page]

2002 Mathematical Reviews  
“Some properties of the ordinary and of the new abstract systems are described.  ...  “The main advantage of knowing our results is that they enable us to prove liveness properties for some signal-event nets even when they are unbounded: liveness in general is undecidable for signal-event  ... 

Formal Verification of a Practical Lock-Free Queue Algorithm [chapter]

Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir
2004 Lecture Notes in Computer Science  
These automata are encoded in the input language of the PVS proof system, and the properties needed to show that the algorithm implements the specification are proved using PVS's theorem prover.  ...  We describe a semi-automated verification of a slightly optimised version of Michael and Scott's lock-free FIFO queue implementation.  ...  We used the mechanical proof facilities of PVS to prove a large proportion of these lemmas automatically.  ... 
doi:10.1007/978-3-540-30232-2_7 fatcat:lci63fgvp5bzrc4ghfmuj3tkn4

Proving Safety Properties of an Aircraft Landing Protocol Using I/O Automata and the PVS Theorem Prover: A Case Study [chapter]

Shinya Umeno, Nancy Lynch
2006 Lecture Notes in Computer Science  
This paper presents an assertional-style verification of the aircraft landing protocol of NASA's SATS (Small Aircraft Transportation System) concept [1] using the I/O automata framework and the PVS theorem  ...  In addition, we translated the I/O automaton into a corresponding PVS specification, and conducted a verification of the safety properties of the protocol using the assertional proof technique and the  ...  (Strengthened Property 6) For any reachable state of the abstract model, the strengthened Property 6 holds.  ... 
doi:10.1007/11813040_5 fatcat:lmotpw536rctlfcokizuqdijdy
« Previous Showing results 1 — 15 out of 669 results