Sciweavers

191 search results - page 5 / 39
» A Reasoner for Simple Conceptual Logic Programs
Sort
View
VSTTE
2010
Springer
13 years 6 months ago
Local Reasoning and Dynamic Framing for the Composite Pattern and Its Clients
Abstract. The Composite design pattern is an exemplar of specification and verification challenges for sequential object-oriented programs. Region logic is a Hoare logic augmente...
Stan Rosenberg, Anindya Banerjee, David A. Naumann
POPL
2004
ACM
14 years 8 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
ICLP
2010
Springer
13 years 11 months ago
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
Fabrizio Riguzzi, Terrance Swift
ICCS
2009
Springer
14 years 2 months ago
Default Conceptual Graph Rules: Preliminary Results for an Agronomy Application
Abstract. In this paper, we extend Simple Conceptual Graphs with Reiter’s default rules. The motivation for this extension came from the type of reasonings involved in an agronom...
Jean-François Baget, Madalina Croitoru, J&e...
POPL
2010
ACM
13 years 7 months ago
Nested interpolants
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
Matthias Heizmann, Jochen Hoenicke, Andreas Podels...