Sciweavers

94 search results - page 4 / 19
» Weakest-precondition of unstructured programs
Sort
View
SAS
2005
Springer
162views Formal Methods» more  SAS 2005»
14 years 29 days ago
Boolean Heaps
We show that the idea of predicates on heap objects can be cast in the framework of predicate abstraction. This leads to an alternative view on the underlying concepts of three-val...
Andreas Podelski, Thomas Wies
POPL
2001
ACM
14 years 7 months ago
Avoiding exponential explosion: generating compact verification conditions
Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. ...
Cormac Flanagan, James B. Saxe
TRIER
2002
13 years 7 months ago
Polynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
Markus Müller-Olm, Helmut Seidl
POPL
2007
ACM
14 years 7 months ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
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,...