3481 search results - page 266 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
109
click to vote
TACAS
2010
Springer
15 years 11 months ago
2010
Springer
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
151
click to vote
FSTTCS
1999
Springer
15 years 8 months ago
1999
Springer
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get fi...
260
click to vote
POPL
2007
ACM
16 years 4 months ago
2007
ACM
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
130
click to vote
LPNMR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
154
click to vote
WLP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...