LICS
2005
IEEE
13 years 10 months ago
2005
IEEE
We provide a uniform solution to the problem of synthesizing a ļ¬nite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
LICS
2005
IEEE
13 years 10 months ago
2005
IEEE
We propose L-nets as a game model of concurrent interaction. L-nets, which correspond to strategies (in Games Semantics) or designs (in Ludics), are graphs rather than trees; the ...
LICS
2005
IEEE
13 years 10 months ago
2005
IEEE
LICS
2005
IEEE
13 years 10 months ago
2005
IEEE
A number of authors have exported domain-theoretic techniques from denotational semantics to the operational study of contextual equivalence and preorder. We further develop this,...
LICS
2005
IEEE
13 years 10 months ago
2005
IEEE
We construct a domain-theoretic calculus for Lipschitz and differentiable functions, which includes addition, subtraction and composition. We then develop a domaintheoretic versio...
LICS
2005
IEEE
13 years 10 months ago
2005
IEEE
We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthemā...
LICS
2005
IEEE
13 years 10 months ago
2005
IEEE
Games played on graphs may have qualitative objectives, such as the satisfaction of an Ļ-regular property, or quantitative objectives, such as the optimization of a realvalued re...
LICS
2005
IEEE
13 years 10 months ago
2005
IEEE
We show how to give a coherent semantics to programs that are well-speciļ¬ed in a version of separation logic for a language with higher types: idealized algol extended with heap...
LICS
2005
IEEE
13 years 10 months ago
2005
IEEE
We introduce the language QML, a functional language for quantum computations on ļ¬nite types. Its design is guided by its categorical semantics: QML programs are interpreted by ...
LICS
2005
IEEE
13 years 10 months ago
2005
IEEE
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of ļ¬rstorder (FO) and monadic ...