315 search results - page 20 / 63 » Reasoning about Assignments in Recursive Data Structures |
121
Voted
SEMWEB
2009
Springer
15 years 8 months ago
2009
Springer
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...
193
click to vote
POPL
2011
ACM
14 years 4 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
126
click to vote
IANDC
2007
15 years 1 months ago
2007
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
140
Voted
FMCO
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Separation logic is a program logic for reasoning about programs that manipulate pointer data structures. We describe Smallfoot, a tool for checking certain lightweight s...
101
click to vote
VMCAI
2009
Springer
15 years 8 months ago
2009
Springer
Vectors and bags are basic collection data structures, which are used frequently in programs and specifications. Reasoning about these data structures is supported by established ...