Sciweavers

181 search results - page 10 / 37
» On the Completeness of Propositional Hoare Logic
Sort
View
FOSSACS
2007
Springer
15 years 3 months ago
Logical Reasoning for Higher-Order Functions with Local State
Abstract. We introduce an extension of Hoare logic for call-by-value higherorder functions with ML-like local reference generation. Local references may be generated dynamically an...
Nobuko Yoshida, Kohei Honda, Martin Berger
ECAI
2010
Springer
14 years 10 months ago
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
Davide Bresolin, Dario Della Monica, Valentin Gora...
JAIR
2011
166views more  JAIR 2011»
14 years 4 months ago
Decidability and Undecidability Results for Propositional Schemata
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
TPHOL
2009
IEEE
15 years 4 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk
AIML
2006
14 years 11 months ago
A General Semantics for Quantified Modal Logic
In [9] we developed a semantics for quantified relevant logic that uses general frames. In this paper, we adapt that model theory to treat quantified modal logics, giving a complet...
Robert Goldblatt, Edwin D. Mares