LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
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...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
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...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
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...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
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 ...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a succ...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
We show how to construct the category of games and innocent strategies from a more primitive category of games. On that category we define a comonad and monad with the former dis...
ACSC
2007
IEEE
14 years 1 months ago
2007
IEEE
A common approach in designing relational databases is to start with a universal relation schema, which is then decomposed into multiple subschemas. A good choice of subschemas ca...