Sciweavers

25 search results - page 2 / 5
» fossacs 2005
Sort
View
101
Voted
FOSSACS
2005
Springer
15 years 6 months ago
Third-Order Idealized Algol with Iteration Is Decidable
The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (IA∗ 3). They are approached via a combination...
Andrzej S. Murawski, Igor Walukiewicz
97
Voted
FOSSACS
2005
Springer
15 years 6 months ago
Foundations of Web Transactions
A timed extension of π-calculus with a transaction construct – the calculus webπ – is studied. The underlying model of webπ relies on networks of processes; time proceeds as...
Cosimo Laneve, Gianluigi Zavattaro
106
Voted
FOSSACS
2005
Springer
15 years 6 months ago
Axiomatizations for Probabilistic Finite-State Behaviors
Abstract. We study a process calculus which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s probabilistic automata. We consider vario...
Yuxin Deng, Catuscia Palamidessi
104
Voted
FOSSACS
2005
Springer
15 years 6 months ago
A Simpler Proof Theory for Nominal Logic
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
James Cheney
109
Voted
FOSSACS
2005
Springer
15 years 6 months ago
From Separation Logic to First-Order Logic
Separation logic is a spatial logic for reasoning locally about heap structures. A decidable fragment of its assertion language was presented in [1], based on a bounded model prope...
Cristiano Calcagno, Philippa Gardner, Matthew Hagu...