4573 search results - page 807 / 915 » Automated Reasoning |
100
click to vote
LICS
2007
IEEE
15 years 9 months ago
2007
IEEE
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
149
click to vote
LICS
2007
IEEE
15 years 9 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
125
click to vote
TPHOL
2007
IEEE
15 years 9 months ago
2007
IEEE
We formalise the data race free (DRF) guarantee provided by Java, as captured by the semi-formal Java Memory Model (JMM) [1] and published in the Java Language Specification [2]. ...
CSL
2007
Springer
15 years 9 months ago
2007
Springer
Existing definitions of the relativizations of NC1 , L and NL do not preserve the inclusions NC1 ⊆ L, NL ⊆ AC1 . We start by giving the first definitions that preserve them....
CSL
2007
Springer
15 years 9 months ago
2007
Springer
Models of the untyped λ-calculus may be defined either as applicative structures satisfying a bunch of first order axioms, known as “λ-models”, or as (structures arising fr...