LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus, called enf bisimilarity and enf bisimilarity up to η. They are based on eag...
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
Number Decision Diagrams (NDD) are the automatabased symbolic representation for manipulating sets of integer vectors encoded as strings of digit vectors (least or most significa...
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
This paper describes an assembly-language type system capable of ensuring memory safety in the presence of both heap and stack allocation. The type system uses linear logic and a ...
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
In the 1980s process algebras became widely accepted formalisms for describing and analysing concurrency. Extensions of the formalisms, incorporating some aspects of systems which...
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
The universal Horn theory of relational Kleene algebra with tests (RKAT) is of practical interest, particularly for program semantics. We develop an (infinitary) proof system, ba...
LICS
2005
IEEE
14 years 5 months ago
2005
IEEE
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...