Sciweavers

1151 search results - page 67 / 231
» Collaborative Programming: Applications of Logic and Automat...
Sort
View
119
Voted
LICS
2009
IEEE
15 years 10 months ago
Logical Step-Indexed Logical Relations
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
Derek Dreyer, Amal Ahmed, Lars Birkedal
125
Voted
POPL
2010
ACM
16 years 25 days ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
LOPSTR
2007
Springer
15 years 9 months ago
Termination Analysis of Logic Programs Based on Dependency Graphs
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
Manh Thang Nguyen, Jürgen Giesl, Peter Schnei...
132
Voted
RWEB
2009
Springer
15 years 10 months ago
Answer Set Programming: A Primer
Abstract. Answer Set Programming (ASP) is a declarative problem solving paradigm, rooted in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing attentio...
Thomas Eiter, Giovambattista Ianni, Thomas Krennwa...
113
Voted
SAS
2005
Springer
118views Formal Methods» more  SAS 2005»
15 years 9 months ago
Inference of Well-Typings for Logic Programs with Application to Termination Analysis
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
Maurice Bruynooghe, John P. Gallagher, Wouter Van ...