Sciweavers

15 search results - page 3 / 3
» ifm 2010
Sort
View
87
Voted
IFM
2010
Springer
113views Formal Methods» more  IFM 2010»
14 years 10 months ago
Translating Pi-Calculus into LOTOS NT
Process calculi supporting mobile communication, such as the π-calculus, are often seen as an evolution of classical value-passing calculi, in which communication between processe...
Radu Mateescu, Gwen Salaün
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
14 years 9 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
IFM
2010
Springer
203views Formal Methods» more  IFM 2010»
14 years 10 months ago
A CSP Approach to Control in Event-B
Event-B has emerged as one of the dominant state-based formal techniques used for modelling control-intensive applications. Due to the blocking semantics of events, their ordering ...
Steve Schneider, Helen Treharne, Heike Wehrheim
IFM
2010
Springer
142views Formal Methods» more  IFM 2010»
14 years 10 months ago
An Event-B Approach to Data Sharing Agreements
A Data Sharing Agreement (DSA) is a contract among two or more principals regulating how they share data. Agreements are usually represented as a set of clauses expressed using the...
Alvaro E. Arenas, Benjamin Aziz, Juan Bicarregui, ...
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
14 years 10 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier