Sciweavers

LICS
2007
IEEE
13 years 11 months ago
A computable approach to measure and integration theory
We introduce a computable framework for Lebesgue’s measure and integration theory in the spirit of domain theory. For an effectively given second countable locally compact Hausd...
Abbas Edalat
LICS
2007
IEEE
13 years 11 months ago
Characterising Testing Preorders for Finite Probabilistic Processes
Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy,...
LICS
2007
IEEE
13 years 11 months ago
Locally Excluding a Minor
We introduce the concept of locally excluded minors. Graph classes locally excluding a minor are a common generalisation of the concept of excluded minor classes and of graph clas...
Anuj Dawar, Martin Grohe, Stephan Kreutzer
LICS
2007
IEEE
13 years 11 months ago
A Complete Axiomatization of Knowledge and Cryptography
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...
Mika Cohen, Mads Dam
LICS
2007
IEEE
13 years 11 months ago
Local Action and Abstract Separation Logic
tion and Abstract Separation Logic Cristiano Calcagno Imperial College, London Peter W. O’Hearn Queen Mary, University of London Hongseok Yang Queen Mary, University of London S...
Cristiano Calcagno, Peter W. O'Hearn, Hongseok Yan...
LICS
2007
IEEE
13 years 11 months ago
Principles of Superdeduction
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...
Paul Brauner, Clément Houtmann, Claude Kirc...
LICS
2007
IEEE
13 years 11 months ago
The Cost of Punctuality
In an influential paper titled “The Benefits of Relaxing Punctuality” [2], Alur, Feder, and Henzinger introduced Metric Interval Temporal Logic (MITL) as a fragment of the r...
Patricia Bouyer, Nicolas Markey, Joël Ouaknin...
LICS
2007
IEEE
13 years 11 months ago
Light Logics and Optimal Reduction: Completeness and Complexity
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...
Patrick Baillot, Paolo Coppola, Ugo Dal Lago