193 search results - page 6 / 39 » Decidable logics combining heap structures and data |
POPL
2007
ACM
14 years 7 months ago
2007
ACM
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
ICSE
2011
IEEE-ACM
12 years 11 months ago
2011
IEEE-ACM
We present a unified environment for running declarative specifications in the context of an imperative object-oriented programming language. Specifications are Alloy-like, wri...
JAR
2006
13 years 7 months ago
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
ICFEM
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Verification of programs with invocations to unknown procedures is a practical problem, because in many scenarios not all codes of programs to be verified are available...
FROCOS
2009
Springer
14 years 2 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...