Sciweavers

3891 search results - page 557 / 779
» A logic for strategic reasoning
Sort
View
TPHOL
2003
IEEE
14 years 3 months ago
Inductive Invariants for Nested Recursion
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
Sava Krstic, John Matthews
ASP
2003
Springer
14 years 3 months ago
Implementing OCLP as a front-end for Answer Set Solvers: From Theory to Practice
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
Martin Brain, Marina De Vos
FM
2003
Springer
98views Formal Methods» more  FM 2003»
14 years 3 months ago
Generating Counterexamples for Multi-valued Model-Checking
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model...
Arie Gurfinkel, Marsha Chechik
ICLP
2003
Springer
14 years 3 months ago
Termination Analysis with Types Is More Accurate
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
Vitaly Lagoon, Frédéric Mesnard, Pet...
ECOOP
2010
Springer
14 years 3 months ago
Verifying Generics and Delegates
Recently, object-oriented languages, such as C , have been extended with language features prevalent in most functional languages: parametric polymorphism and higher-order function...
Kasper Svendsen, Lars Birkedal, Matthew Parkinson