Sciweavers

43 search results - page 7 / 9
» Quantum weakest preconditions
Sort
View
ICCAD
2007
IEEE
134views Hardware» more  ICCAD 2007»
14 years 4 months ago
Hybrid CEGAR: combining variable hiding and predicate abstraction
ion Chao Wang NEC Laboratories America Hyondeuk Kim University of Colorado Aarti Gupta NEC Laboratories America Variable hiding and predicate abstraction are two popular abstracti...
Chao Wang, Hyondeuk Kim, Aarti Gupta
CADE
2009
Springer
14 years 2 months ago
Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...
Shuvendu K. Lahiri, Shaz Qadeer
JUCS
2008
166views more  JUCS 2008»
13 years 7 months ago
ASM Refinement Preserving Invariants
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...
Gerhard Schellhorn
TCAD
2008
114views more  TCAD 2008»
13 years 7 months ago
Word-Level Predicate-Abstraction and Refinement Techniques for Verifying RTL Verilog
el Predicate Abstraction and Refinement Techniques for Verifying RTL Verilog Himanshu Jain, Daniel Kroening, Natasha Sharygina, and Edmund M. Clarke, Fellow, IEEE As a first step, ...
Himanshu Jain, Daniel Kroening, Natasha Sharygina,...
APLAS
2006
ACM
13 years 11 months ago
Comparing Completeness Properties of Static Analyses and Their Logics
Abstract. Static analyses calculate abstract states, and their logics validate properties of the abstract states. We place into perspective the variety of forwards, backwards, func...
David A. Schmidt