SEFM
2006
IEEE
13 years 10 months ago
2006
IEEE
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...
SAS
2007
Springer
13 years 10 months ago
2007
Springer
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...
IFL
2007
Springer
13 years 10 months ago
2007
Springer
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...
ICALP
2007
Springer
13 years 10 months ago
2007
Springer
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...
CC
2007
Springer
13 years 10 months ago
2007
Springer
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 ...
CAV
2007
Springer
13 years 10 months ago
2007
Springer
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...
ICNP
2007
IEEE
13 years 11 months ago
2007
IEEE
—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...
DATE
2007
IEEE
13 years 11 months ago
2007
IEEE
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 ...
ACSC
2007
IEEE
13 years 11 months ago
2007
IEEE
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...
ISMVL
2008
IEEE
13 years 11 months ago
2008
IEEE
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...