Sciweavers

354 search results - page 34 / 71
» On Obligations
Sort
View
TACAS
1997
Springer
87views Algorithms» more  TACAS 1997»
14 years 2 months ago
Integration in PVS: Tables, Types, and Model Checking
Abstract. We have argued previously that the e ectiveness of a veri cation system derives not only from the power of its individual features for expression and deduction, but from ...
Sam Owre, John M. Rushby, Natarajan Shankar
ATVA
2009
Springer
99views Hardware» more  ATVA 2009»
14 years 1 months ago
CLAN: A Tool for Contract Analysis and Conflict Discovery
Abstract. As Service-Oriented Architectures are more widely adopted, it becomes more important to adopt measures for ensuring that the services satisfy functional and non-functiona...
Stephen Fenech, Gordon J. Pace, Gerardo Schneider
DATE
2009
IEEE
64views Hardware» more  DATE 2009»
14 years 1 months ago
Speculative reduction-based scalable redundancy identification
The process of sequential redundancy identification is the cornerstone of sequential synthesis and equivalence checking frameworks. The scalability of the proof obligations inhere...
Hari Mony, Jason Baumgartner, Alan Mishchenko, Rob...
CAV
2006
Springer
141views Hardware» more  CAV 2006»
14 years 1 months ago
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
We describe a formal verification of a recent concurrent list-based set algorithm due to Heller et al. The algorithm is optimistic: the add and remove operations traverse the list ...
Robert Colvin, Lindsay Groves, Victor Luchangco, M...
FORMATS
2004
Springer
14 years 1 months ago
Decomposing Verification of Timed I/O Automata
This paper presents assume-guarantee style substitutivity results for the recently published timed I/O automaton modeling framework. These results are useful for decomposing verifi...
Dilsun Kirli Kaynar, Nancy A. Lynch