213 search results - page 22 / 43 » Logic programs with annotated disjunctions |
POPL
2010
ACM
14 years 5 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
We present an analysis which takes as its input a sequential program, augmented with annotations indicating potential parallelization opportunities, and a sequential proof, writte...
PADL
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
PEPM
2010
ACM
14 years 4 months ago
2010
ACM
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
DAGSTUHL
2003
13 years 9 months ago
2003
In this chapter, we summarize the research on querying inconsistent databases we have been conducting over the last five years. The formal framework we have used is based on two c...