Sciweavers

2478 search results - page 106 / 496
» Quadtrees as an Abstract Domain
Sort
View
AIPS
2008
13 years 10 months ago
Structural Patterns Heuristics via Fork Decomposition
We consider a generalization of the PDB homomorphism abstractions to what is called "structural patterns". The bais in abstracting the problem in hand into provably trac...
Michael Katz, Carmel Domshlak
CORR
2004
Springer
85views Education» more  CORR 2004»
13 years 8 months ago
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara
TACAS
2004
Springer
111views Algorithms» more  TACAS 2004»
14 years 1 months ago
Automatic Creation of Environment Models via Training
Abstract. Model checking suffers not only from the state-space explosion problem, but also from the environment modeling problem: how can one create an accurate enough model of the...
Thomas Ball, Vladimir Levin, Fei Xie
IPPS
2006
IEEE
14 years 2 months ago
Effecting parallel graph eigensolvers through library composition
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
A. Breuer, Peter Gottschling, Douglas Gregor, Andr...
CAV
2010
Springer
192views Hardware» more  CAV 2010»
14 years 1 days 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...