Sciweavers

1814 search results - page 230 / 363
» Extended First-Order Logic
Sort
View
114
Voted
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
16 years 3 months ago
Polymorphic Fractional Capabilities
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...
Hirotoshi Yasuoka, Tachio Terauchi
CADE
2006
Springer
16 years 3 months ago
Blocking and Other Enhancements for Bottom-Up Model Generation Methods
In this paper we introduce several new improvements to the bottom-up model generation (BUMG) paradigm. Our techniques are based on non-trivial transformations of first-order probl...
Peter Baumgartner, Renate A. Schmidt
CADE
2006
Springer
16 years 3 months ago
Tree Automata with Equality Constraints Modulo Equational Theories
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
Florent Jacquemard, Laurent Vigneron, Michaël...
CADE
2003
Springer
16 years 3 months ago
adbmal
We make the notion of scope in the -calculus explicit. To that end, the syntax of the -calculus is extended with an end-of-scope operator , matching the usual opening of a scope du...
Dimitri Hendriks, Vincent van Oostrom
LFCS
2009
Springer
15 years 9 months ago
Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination
Canonical propositional Gentzen-type calculi are a natural class of systems which in addition to the standard axioms and structural rules have only logical rules where exactly one ...
Arnon Avron, Anna Zamansky