Sciweavers

2084 search results - page 170 / 417
» Set Constraints in Logic Programming
Sort
View
JFP
2008
125views more  JFP 2008»
13 years 8 months ago
Types and trace effects of higher order programs
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher order programs. The...
Christian Skalka, Scott F. Smith, David Van Horn
ENTCS
2002
129views more  ENTCS 2002»
13 years 8 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi
PLDI
2011
ACM
12 years 11 months ago
Evaluating value-graph translation validation for LLVM
Translation validators are static analyzers that attempt to verify that program transformations preserve semantics. Normalizing translation validators do so by trying to match the...
Jean-Baptiste Tristan, Paul Govereau, Greg Morrise...
AMAST
1998
Springer
14 years 17 days 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
MST
2010
140views more  MST 2010»
13 years 6 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh