756 search results - page 60 / 152 » Using Logic Programs to Reason about Infinite Sets |
LPNMR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present a purely model-theoretic semantics for disjunctive logic programs with negation, building on the infinite-valued approach recently introduced for normal logic...
ICLP
1997
Springer
15 years 1 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
TLDI
2009
ACM
15 years 6 months ago
2009
ACM
Object-oriented programs are notable for making use of both rder abstractions and mutable, aliased state. Either feature alone is challenging for formal verification, and the com...
101
click to vote
PPOPP
2011
ACM
14 years 18 days ago
2011
ACM
We propose a cooperative methodology for multithreaded software, where threads use traditional synchronization idioms such as locks, but additionally document each point of potent...
115
click to vote
ICFP
2012
ACM
13 years 4 days ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...