FOSSACS
2000
Springer
14 years 3 months ago
2000
Springer
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
FOSSACS
2000
Springer
14 years 3 months ago
2000
Springer
FOSSACS
2000
Springer
14 years 3 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
FOSSACS
2000
Springer
14 years 3 months ago
2000
Springer
A new treatment of data refinement in typed lambda calculus is proposed, phrased in terms of pre-logical relations [HS99] rather than logical relations, and incorporating a constru...