152
Voted
LICS
2008
IEEE
16 years 22 days ago
2008
IEEE
We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for BCCSP modulo impossible...
137
Voted
LICS
2008
IEEE
16 years 22 days ago
2008
IEEE
190
Voted
LICS
2008
IEEE
16 years 22 days ago
2008
IEEE
The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems ...
166
Voted
LICS
2008
IEEE
16 years 22 days ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
176
Voted
LICS
2008
IEEE
16 years 22 days ago
2008
IEEE
Separation logic involves two dual forms of modularity: local reasoning makes part of the store invisible within a static scope, whereas hiding local state makes part of the store...
139
Voted
LICS
2008
IEEE
16 years 22 days ago
2008
IEEE
182
Voted
LICS
2008
IEEE
16 years 22 days ago
2008
IEEE
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...
189
Voted
LICS
2008
IEEE
16 years 22 days ago
2008
IEEE
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
158
Voted
LICS
2008
IEEE
16 years 22 days ago
2008
IEEE
LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as p...
154
Voted
LICS
2008
IEEE
16 years 22 days ago
2008
IEEE
We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NLcomple...