Sciweavers

SEFM
2006
IEEE
14 years 5 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
SAS
2007
Springer
14 years 5 months ago
Shape Analysis with Structural Invariant Checkers
Abstract. Developer-supplied data structure specifications are important to shape analyses, as they tell the analysis what information should be tracked in order to obtain the des...
Bor-Yuh Evan Chang, Xavier Rival, George C. Necula
IFL
2007
Springer
120views Formal Methods» more  IFL 2007»
14 years 5 months ago
Lazy Contract Checking for Immutable Data Structures
Existing contract checkers for data structures force programmers to choose between poor alternatives. Contracts are either built into the functions that construct the data structur...
Robert Bruce Findler, Shu-yu Guo, Anne Rogers
ICALP
2007
Springer
14 years 5 months ago
Checking and Spot-Checking the Correctness of Priority Queues
We revisit the problem of memory checking considered by Blum et al. [3]. In this model, a checker monitors the behavior of a data structure residing in unreliable memory given an a...
Matthew Chu, Sampath Kannan, Andrew McGregor
CC
2007
Springer
208views System Software» more  CC 2007»
14 years 5 months ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Bernhard Scholz, Johann Blieberger
CAV
2007
Springer
126views Hardware» more  CAV 2007»
14 years 5 months ago
Shape Analysis for Composite Data Structures
We propose a shape analysis that adapts to some of the complex composite data structures found in industrial systems-level programs. Examples of such data structures include “cyc...
Josh Berdine, Cristiano Calcagno, Byron Cook, Dino...
ICNP
2007
IEEE
14 years 5 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
DATE
2007
IEEE
85views Hardware» more  DATE 2007»
14 years 5 months ago
QuteSAT: a robust circuit-based SAT solver for complex circuit structure
We propose a robust circuit-based Boolean Satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit netlist structure. Several novel techniques are proposed in ...
Chi-An Wu, Ting-Hao Lin, Chih-Chun Lee, Chung-Yang...
ACSC
2007
IEEE
14 years 5 months ago
HAT-Trie: A Cache-Conscious Trie-Based Data Structure For Strings
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
Nikolas Askitis, Ranjan Sinha
ISMVL
2008
IEEE
102views Hardware» more  ISMVL 2008»
14 years 5 months ago
On the Data Structure Metrics of Quantum Multiple-Valued Decision Diagrams
This paper describes new metrics for the data structure referred to as quantum multiple-valued decision diagrams (QMDD) which are used to represent the matrices describing reversi...
David Y. Feinstein, Mitchell A. Thornton, D. Micha...