Sciweavers

ICFEM
2009
Springer
14 years 6 months ago
A Lazy Unbounded Model Checker for Event-B
Formal specification languages are traditionally supported by theorem provers, but recently model checkers have proven to be useful tools. In this paper we present Eboc, an explic...
Paulo J. Matos, Bernd Fischer, João P. Marq...
ICFEM
2009
Springer
14 years 6 months ago
RAFFS: Model Checking a Robust Abstract Flash File Store
Flash File Store Paul Taverne and C. (Kees) Pronk Report TUD-SERG-2009-033 SERG
Paul Taverne, Cornelis Pronk
ICFEM
2009
Springer
14 years 6 months ago
Implementing and Applying the Stocks-Carrington Framework for Model-Based Testing
In this paper we describe the functional features and the architecture of a tool implementing the Stocks-Carrington framework (TTF) for model based testing (MBT). The resulting pro...
Maximiliano Cristiá, Pablo Rodríguez...
ICFEM
2009
Springer
14 years 6 months ago
Combining Static Model Checking with Dynamic Enforcement Using the Statecall Policy Language
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...
Anil Madhavapeddy
ICFEM
2009
Springer
14 years 6 months ago
Qualitative Action Systems
An extension to action systems is presented facilitating the modeling of continuous behavior in the discrete domain. The original action system formalism has been developed by Back...
Bernhard K. Aichernig, Harald Brandl, Willibald Kr...
ICFEM
2009
Springer
14 years 6 months ago
Supporting Reuse of Event-B Developments through Generic Instantiation
It is believed that reusability in formal development should reduce the time and cost of formal modelling within a production environment. Along with the ability to reuse formal mo...
Renato Silva, Michael Butler
ICFEM
2009
Springer
14 years 6 months ago
Symbolic Query Exploration
Abstract. We study the problem of generating a database and parameters for a given parameterized SQL query satisfying a given test condition. We introduce a formal background theor...
Margus Veanes, Pavel Grigorenko, Peli de Halleux, ...
ICFEM
2009
Springer
14 years 6 months ago
Circular Coinduction with Special Contexts
Coinductive proofs of behavioral equivalence often require human ingenuity, in that one is expected to provide a “good” relation extending one’s goal with additional lemmas, ...
Dorel Lucanu, Grigore Rosu
ICFEM
2009
Springer
14 years 6 months ago
Role-Based Symmetry Reduction of Fault-Tolerant Distributed Protocols with Language Support
Fault-tolerant (FT) distributed protocols (such as group membership, consensus, etc.) represent fundamental building blocks for many practical systems, e.g., the Google File System...
Péter Bokor, Marco Serafini, Neeraj Suri, H...