Sciweavers

9 search results - page 1 / 2
» A Hybrid Intuitionistic Logic: Semantics and Decidability
Sort
View
LOGCOM
2006
105views more  LOGCOM 2006»
13 years 4 months ago
A Hybrid Intuitionistic Logic: Semantics and Decidability
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [14, 15]. The modalities of the logic allow us to validate propertie...
Rohit Chadha, Damiano Macedonio, Vladimiro Sassone
LICS
2010
IEEE
13 years 3 months ago
The Undecidability of Boolean BI through Phase Semantics
We solve the open problem of the decidability of Boolean BI logic (BBI), which can be considered as the core of separation and spatial logics. For this, we define a complete phas...
Dominique Larchey-Wendling, Didier Galmiche
ESOP
2006
Springer
13 years 8 months ago
ILC: A Foundation for Automated Reasoning About Pointer Programs
This paper presents a new program logic designed for facilitating automated reasoning about pointer programs. The program logic is directly inspired by previous work by O'Hea...
Limin Jia, David Walker
ICFP
2003
ACM
14 years 4 months ago
An effective theory of type refinements
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
Yitzhak Mandelbaum, David Walker, Robert Harper
WOLLIC
2009
Springer
13 years 11 months ago
Sound and Complete Tree-Sequent Calculus for Inquisitive Logic
Abstract. We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish th...
Katsuhiko Sano