Sciweavers

79 search results - page 5 / 16
» Splitting Logics
Sort
View
FM
2009
Springer
124views Formal Methods» more  FM 2009»
15 years 4 months ago
Reasoning about Memory Layouts
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
Holger Gast
79
Voted
LMCS
2006
119views more  LMCS 2006»
14 years 9 months ago
The monadic second-order logic of graphs XVI : Canonical graph decompositions
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...
Bruno Courcelle
LPNMR
2009
Springer
15 years 4 months ago
Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programs
Modular nonmonotonic logic programs (MLPs) under the answer-set semantics have been recently introduced as an ASP formalism in which modules can receive context-dependent input fro...
Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas ...
TPHOL
2009
IEEE
15 years 4 months ago
Practical Tactics for Separation Logic
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctne...
Andrew McCreight
79
Voted
LPNMR
1997
Springer
15 years 1 months ago
Power Defaults
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
Guo-Qiang Zhang, William C. Rounds