Sciweavers

200 search results - page 12 / 40
» Invariant Logics
Sort
View
FOSSACS
2006
Springer
13 years 11 months ago
A Logic of Reachable Patterns in Linked Data-Structures
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sag...
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
13 years 6 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
APAL
2006
94views more  APAL 2006»
13 years 7 months ago
Classifiable theories without finitary invariants
: It follows directly from Shelah's structure theory that if T is a classifiable theory, then the isomorphism type of any model of T is determined by the theory of that model ...
Elisabeth Bouscaren, Ehud Hrushovski
ESOP
2006
Springer
13 years 11 months ago
ILC: A Foundation for Automated Reasoning About Pointer Programs
This paper presents a new program logic designed for facilitating automated reasoning about pointer programs. The program logic is directly inspired by previous work by O'Hea...
Limin Jia, David Walker
CAV
2009
Springer
137views Hardware» more  CAV 2009»
14 years 8 months ago
VS3: SMT Solvers for Program Verification
We present VS3 , a tool that automatically verifies complex properties of programs and infers maximally weak preconditions and maximally strong postconditions by leveraging the pow...
Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Fost...