Sciweavers

476 search results - page 4 / 96
» The Complexity of Equality Constraint Languages
Sort
View
LICS
2002
IEEE
13 years 11 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
ESOP
2008
Springer
13 years 7 months ago
Upper Adjoints for Fast Inter-procedural Variable Equalities
We present a polynomial-time algorithm which at the extra cost of a factor O(k) (k the number of variables) generalizes inter-procedural copy constant propagation. Our algorithm in...
Markus Müller-Olm, Helmut Seidl
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 5 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
JFPLC
1998
13 years 7 months ago
DF - a feature constraint system and its extension to a logic concurrent language
Abstract. This paper presents a feature constraint system that, compared with the well-known systems OSF 1] and CFT 5], incorporates several interesting characteristics. The new sy...
Liviu-Virgil Ciortuz