Sciweavers

827 search results - page 1 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
CORR
2011
Springer
153views Education» more  CORR 2011»
12 years 11 months ago
Proof-Theoretic Soundness and Completeness
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a...
Robert Rothenberg
LICS
2005
IEEE
13 years 10 months ago
Proof-Theoretic Approach to Description-Logic
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
Martin Hofmann
LFCS
1992
Springer
13 years 8 months ago
Strictness Logic and Polymorphic Invariance
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
P. N. Benton
CPP
2011
107views more  CPP 2011»
12 years 4 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
ISCA
2012
IEEE
232views Hardware» more  ISCA 2012»
11 years 7 months ago
RADISH: Always-on sound and complete race detection in software and hardware
Data-race freedom is a valuable safety property for multithreaded programs that helps with catching bugs, simplifying memory consistency model semantics, and verifying and enforci...
Joseph Devietti, Benjamin P. Wood, Karin Strauss, ...