Sciweavers

232 search results - page 1 / 47
» Completeness and Decidability in Sequence Logic
Sort
View
LPAR
2007
Springer
13 years 11 months ago
Completeness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
Marc Bezem, Tore Langholm, Michal Walicki
LFCS
2007
Springer
13 years 11 months ago
Reasoning About Sequences of Memory States
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
Rémi Brochenin, Stéphane Demri, &Eac...
ATAL
2004
Springer
13 years 10 months ago
A Complete and Decidable Logic for Resource-Bounded Agents
We propose a context-logic style formalism, Timed Reasoning Logics (TRL), to describe resource-bounded reasoners who take time to derive consequences of their knowledge. The seman...
Natasha Alechina, Brian Logan, Mark Whitsey
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
ICFP
2009
ACM
14 years 5 months ago
Complete and decidable type inference for GADTs
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
Tom Schrijvers, Simon L. Peyton Jones, Martin Sulz...