Sciweavers

2451 search results - page 118 / 491
» The Octagon Abstract Domain
Sort
View
AIPS
2008
15 years 9 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»
15 years 6 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
CORR
2000
Springer
103views Education» more  CORR 2000»
15 years 6 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...
TACAS
2004
Springer
111views Algorithms» more  TACAS 2004»
16 years 7 days 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
189
Voted
IPPS
2006
IEEE
16 years 28 days 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...