203 search results - page 26 / 41 » Datatype-Generic Termination Proofs |
124
click to vote
ICLP
1999
Springer
15 years 6 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
124
click to vote
ICTAC
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. Many software applications are based on collaborating, yet competing, agents or virtual organisations exchanging services. Contracts, expressing obligations, permissions ...
106
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...
TPHOL
2003
IEEE
15 years 7 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
121
click to vote
LPAR
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...