Sciweavers

18 search results - page 1 / 4
» Predicate Abstraction and Canonical Abstraction for Singly-L...
Sort
View
VMCAI
2005
Springer
13 years 10 months ago
Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists
Roman Manevich, Eran Yahav, Ganesan Ramalingam, Sh...
SEFM
2006
IEEE
13 years 10 months ago
A Theory of Singly-Linked Lists and its Extensible Decision Procedure
The key to many approaches to reason about pointerbased data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encomp...
Silvio Ranise, Calogero G. Zarba
POPL
2006
ACM
14 years 5 months ago
Verifying properties of well-founded linked lists
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
Shuvendu K. Lahiri, Shaz Qadeer
LACL
2005
Springer
13 years 10 months ago
Linguistic Facts as Predicates over Ranges of the Sentence
Abstract. This paper introduces a novel approach to language processing, in which linguistic facts are represented as predicates over ranges of the intput text, usually, but not li...
Benoît Sagot
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
13 years 3 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