Sciweavers

TSE
2002
94views more  TSE 2002»
14 years 7 months ago
Improving the Precision of INCA by Eliminating Solutions with Spurious Cycles
The Inequality Necessary Condition Analyzer (INCA) is a finite-state verification tool that has been able to check properties of some very large concurrent systems. INCA checks a p...
Stephen F. Siegel, George S. Avrunin
DEDS
2007
104views more  DEDS 2007»
14 years 7 months ago
Trellis Processes : A Compact Representation for Runs of Concurrent Systems
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
Eric Fabre
IANDC
2008
131views more  IANDC 2008»
14 years 7 months ago
Termination of just/fair computations in term rewriting
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
Salvador Lucas, José Meseguer
FORTE
1994
14 years 8 months ago
An improvement in formal verification
Critical safety and liveness properties of a concurrent system can often be proven with the help of a reachability analysis of a finite state model. This type of analysis is usual...
Gerard J. Holzmann, Doron Peled
FORTE
2007
14 years 8 months ago
Recovering Repetitive Sub-functions from Observations
This paper proposes an algorithm which, given a set of observations of an existing concurrent system that has repetitive subfunctions, constructs a Message Sequence Charts (MSC) gr...
Guy-Vincent Jourdan, Hasan Ural, Shen Wang, Hü...
ACSD
2008
IEEE
106views Hardware» more  ACSD 2008»
14 years 9 months ago
Time-bounded model checking of infinite-state continuous-time Markov chains
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
Lijun Zhang, Holger Hermanns, Ernst Moritz Hahn, B...
ISCIS
2005
Springer
15 years 28 days ago
Recovering the Lattice of Repetitive Sub-functions
Abstract. Given a set of observations of an existing concurrent system with repetitive sub-functions, we consider the construction of an MSC graph representing the functionality of...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...
TABLEAUX
2007
Springer
15 years 1 months ago
Bounded Model Checking with Description Logic Reasoning
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...