315 search results - page 9 / 63 » Reasoning about Assignments in Recursive Data Structures |
CADE
2010
Springer
14 years 10 months ago
2010
Springer
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
83
Voted
CADE
2010
Springer
14 years 10 months ago
2010
Springer
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
CSL
2009
Springer
15 years 4 months ago
2009
Springer
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level language...
LICS
2002
IEEE
15 years 2 months ago
2002
IEEE
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about low-level imperative pr...
DSN
2002
IEEE
15 years 2 months ago
2002
IEEE
We present ideas on how to structure software systems for high availability by considering MTTR/MTTF characteristics of components in addition to the traditional criteria, such as...