Sciweavers

3333 search results - page 285 / 667
» Abstract Proof Search
Sort
View
IFM
2009
Springer
158views Formal Methods» more  IFM 2009»
16 years 1 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...
LOPSTR
2009
Springer
16 years 1 months ago
Deciding Full Branching Time Logic by Program Transformation
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
MFCS
2009
Springer
16 years 1 months ago
The Prismoid of Resources
We define a framework called the prismoid of resources where each vertex refines the λ-calculus by using a different choice to make explicit or implicit (meta-level) the defin...
Delia Kesner, Fabien Renaud
COLCOM
2008
IEEE
16 years 1 months ago
An Undo Framework for P2P Collaborative Editing
Abstract. Existing Peer to Peer (P2P) collaborative editing systems do not allow any user to undo any modification. However, in such systems, users are not aware of others’ modi...
Stéphane Weiss, Pascal Urso, Pascal Molli
TPHOL
2008
IEEE
16 years 1 months ago
Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
Daniel Wasserrab, Andreas Lochbihler