Sciweavers

590 search results - page 7 / 118
» Non-Failure Analysis for Logic Programs
Sort
View
113
Voted
TPHOL
2007
IEEE
15 years 10 months ago
Proof Pearl: The Termination Analysis of Terminator
Terminator is a static analysis tool developed by Microsoft Research for proving termination of Windows device drivers written in C. This proof pearl describes a formalization in h...
Joe Hurd
161
Voted
JELIA
2010
Springer
15 years 2 months ago
A Normal Form for Linear Temporal Equilibrium Logic
In previous work, the so-called Temporal Equilibrium Logic (TEL) was introduced. This formalism provides an extension of the Answer Set semantics for logic programs to arbirary the...
Pedro Cabalar
137
Voted
CLEF
2005
Springer
15 years 9 months ago
A Logic Programming Based Approach to QA@CLEF05 Track
Abstract. In this paper the methodology followed to build a questionanswering system for the Portuguese language is described. The system modules are built using computational ling...
Paulo Quaresma, Irene Pimenta Rodrigues
POPL
2006
ACM
16 years 3 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
144
Voted
ICLP
2003
Springer
15 years 8 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...