Sciweavers

15 search results - page 3 / 3
» ifm 2009
Sort
View
IFM
2009
Springer
158views Formal Methods» more  IFM 2009»
13 years 11 months ago
Developing Topology Discovery in Event-B
Abstract. We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core of several routing algorithms and ...
Thai Son Hoang, Hironobu Kuruma, David A. Basin, J...
IFM
2009
Springer
155views Formal Methods» more  IFM 2009»
13 years 2 months ago
Application of Graph Transformation in Verification of Dynamic Systems
Abstract. A communication system evolves dynamically with the addition and deletion of services. In our previous work [12], a graph transformation system (GTS) was used to model th...
Zarrin Langari, Richard J. Trefler
IFM
2009
Springer
107views Formal Methods» more  IFM 2009»
13 years 11 months ago
Realizability of Choreographies Using Process Algebra Encodings
Abstract. Service-oriented computing has emerged as a new programming paradigm that aims at implementing software applications which can be used through a network via the exchange ...
Gwen Salaün, Tevfik Bultan
IFM
2009
Springer
107views Formal Methods» more  IFM 2009»
13 years 11 months ago
Incremental Reasoning for Multiple Inheritance
Object-orientation supports code reuse and incremental programming. Multiple inheritance increases the power of code reuse, but complicates the binding of method calls and thereby ...
Johan Dovland, Einar Broch Johnsen, Olaf Owe, Mart...
IFM
2009
Springer
124views Formal Methods» more  IFM 2009»
13 years 11 months ago
Dynamic Path Reduction for Software Model Checking
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
Zijiang Yang, Bashar Al-Rawi, Karem Sakallah, Xiao...