Paper Info
Title
Precise goal-independent abstract interpretation of constraint logic programs
Abstract
We present a goal-independent abstract interpretation framework for constraint logic programs, and prove the sufficiency of a set of conditions for abstract domains to ensure that the analysis will never lose precision. Along the way, we formally define constraint logic programming systems, give a formal semantics that is independent of the actual constraint domain and the details of the proof algorithm, and formally define the maximally precise abstraction of a constraint logic program.
Year
DOI
Venue
2003
10.1016/S0304-3975(02)00614-X
Electr. Notes Theor. Comput. Sci.
Keywords
Field
DocType
precise goal-independent abstract interpretation,actual constraint domain,abstract domain,constraint logic program,proof algorithm,maximally precise abstraction,constraint logic programming system,goal-independent abstract interpretation framework,formal semantics
Constraint satisfaction,Discrete mathematics,Computer science,Constraint programming,Multimodal logic,Theoretical computer science,Concurrent constraint logic programming,Logic programming,Constraint logic programming,Higher-order logic,Satisfiability modulo theories
Journal
Volume
Issue
ISSN
293
3
Theoretical Computer Science
Citations 
PageRank 
References 
2
0.37
17
Authors
1
Name
Order
Citations
PageRank
Peter Schachte125622.76