13752 search results - page 2530 / 2751 » Parallel and Distributed Haskells |
122
Voted
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We propose a new model for timed games, based on concurrent game structures (CGSs). Compared to the classical timed game automata of Asarin et al. [8], our timed CGSs are...
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
Games via Three-Valued Abstraction Refinement Luca de Alfaro, Pritam Roy PII: S0890-5401(10)00018-0 DOI: 10.1016/j.ic.2009.05.007 Reference: YINCO 3711 To appear in: Information an...
125
click to vote
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
We present a fixpoint-based algorithm for context-sensitive interprocedural kill/gen-analysis of programs with thread creation. Our algorithm is precise up to abstraction of sync...
114
Voted
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
108
Voted
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
It is well known that bisimulation on µ-expressions cannot be finitely axiomatised in equational logic. Complete axiomatisations such as those of Milner and Bloom/´Esik necessar...