Sciweavers

13 search results - page 1 / 3
» Beyond Shapes: Lists with Ordered Data
Sort
View
FOSSACS
2009
Springer
13 years 11 months ago
Beyond Shapes: Lists with Ordered Data
Standard analysis on recursive data structures restrict their attention to shape properties (for instance, a program that manipulates a list returns a list), excluding properties t...
Kshitij Bansal, Rémi Brochenin, Étie...
CAV
2010
Springer
192views Hardware» more  CAV 2010»
13 years 8 months ago
Invariant Synthesis for Programs Manipulating Lists with Unbounded Data
We address the issue of automatic invariant synthesis for sequential programs manipulating singly-linked lists carrying data over infinite data doe define for that a framework ba...
Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, A...
CAV
2007
Springer
126views Hardware» more  CAV 2007»
13 years 11 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...
CPAIOR
2009
Springer
13 years 11 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin
AGTIVE
2003
Springer
13 years 10 months ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman