Sciweavers

LICS
2006
IEEE
13 years 10 months ago
Boolean Algebras for Lambda Calculus
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
Giulio Manzonetto, Antonino Salibra
LICS
2006
IEEE
13 years 10 months ago
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
Olivier Laurent, Lorenzo Tortora de Falco
LICS
2006
IEEE
13 years 10 months ago
A Characterisation of First-Order Constraint Satisfaction Problems
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...
Benoit Larose, Cynthia Loten, Claude Tardif
LICS
2006
IEEE
13 years 10 months ago
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
C.-H. Luke Ong
LICS
2006
IEEE
13 years 10 months ago
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
Dietrich Kuske, Markus Lohrey
LICS
2006
IEEE
13 years 10 months ago
Avoiding Determinization
Automata on infinite objects are extensively used in system specification, verification, and synthesis. While some applications of the automata-theoretic approach have been wel...
Orna Kupferman
LICS
2006
IEEE
13 years 10 months ago
Coinductive Proof Principles for Stochastic Processes
We give an explicit coinduction principle for recursively-defined stochastic processes. The principle applies to any closed property, not just equality, and works even when soluti...
Dexter Kozen
LICS
2006
IEEE
13 years 10 months ago
On Tractability and Congruence Distributivity
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...
Emil W. Kiss, Matthew Valeriote
LICS
2006
IEEE
13 years 10 months ago
Independence and Concurrent Separation Logic
A compositional Petri net based semantics is given to a simple pointer-manipulating language. The model is then applied to give a notion of validity to the judgements made by conc...
Jonathan Hayman, Glynn Winskel