Sciweavers

FMSD
2006
77views more  FMSD 2006»
14 years 19 days ago
Data structures for symbolic multi-valued model-checking
Multi-valued logics can be effectively used to reason about incomplete and/or inconsistent systems, e.g. during early software requirements or as the systems evolve. In our earlie...
Marsha Chechik, Arie Gurfinkel, Benet Devereux, Al...
FMSD
2006
104views more  FMSD 2006»
14 years 19 days ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord
FMSD
2006
131views more  FMSD 2006»
14 years 19 days ago
Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude
This paper describes the application of the Real-Time Maude tool and the Maude formal methodology to the specification and analysis of the AER/NCA suite of active network multicast...
Peter Csaba Ölveczky, José Meseguer, C...
FMSD
2006
140views more  FMSD 2006»
14 years 19 days ago
Dealing with practical limitations of distributed timed model checking for timed automata
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
Víctor A. Braberman, Alfredo Olivero, Ferna...
FMSD
2006
103views more  FMSD 2006»
14 years 19 days ago
Cones and foci: A mechanical framework for protocol verification
We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between ...
Wan Fokkink, Jun Pang, Jaco van de Pol
FMSD
2006
85views more  FMSD 2006»
14 years 19 days ago
Distributed disk-based algorithms for model checking very large Markov chains
In this paper we present data structures and distributed algorithms for CSL model checking-based performance and dependability evaluation. We show that all the necessary computatio...
Alexander Bell, Boudewijn R. Haverkort
FMSD
2006
103views more  FMSD 2006»
14 years 19 days ago
Compositional SCC Analysis for Language Emptiness
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
Chao Wang, Roderick Bloem, Gary D. Hachtel, Kavita...
FMSD
2006
183views more  FMSD 2006»
14 years 19 days ago
An algebraic theory for behavioral modeling and protocol synthesis in system design
The design productivity gap has been recognized by the semiconductor industry as one of the major threats to the continued growth of system-on-chips and embedded systems. Ad-hoc sy...
Jean-Pierre Talpin, Paul Le Guernic
FMSD
2006
83views more  FMSD 2006»
14 years 19 days ago
A Framework for Modeling the Distributed Deployment of Synchronous Designs
Synchronous specifications are appealing in the design of large scale hardware and software systems because of their properties that facilitate verification and synthesis. When the...
Luca P. Carloni, Alberto L. Sangiovanni-Vincentell...
FMSD
2006
59views more  FMSD 2006»
14 years 19 days ago
Optimistic synchronization-based state-space reduction
Reductions that aggregate fine-grained transitions into coarser transitions can significantly reduce the cost of automated verification, by reducing the size of the state space. W...
Scott D. Stoller, Ernie Cohen