Sciweavers

1461 search results - page 12 / 293
» Analysis of Constraint Logic Programs
Sort
View
ISSTA
2004
ACM
14 years 1 months ago
Faster constraint solving with subtypes
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...
AMAST
1998
Springer
13 years 12 months ago
Type Analysis for CHIP
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
Wlodzimierz Drabent, Pawel Pietrzak
AAAI
2008
13 years 10 months ago
Loop Formulas for Logic Programs with Arbitrary Constraint Atoms
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
Jia-Huai You, Guohua Liu
ICLP
2010
Springer
13 years 11 months ago
Constraint Answer Set Programming Systems
Abstract. We present an integration of answer set programming and constraint processing as an interesting approach to constraint logic programming. Although our research is in a ve...
Christian Drescher
ICFEM
2004
Springer
14 years 1 months ago
Memory-Model-Sensitive Data Race Analysis
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom