TACAS
2007
Springer
13 years 11 months ago
2007
Springer
Symbolic execution can be problematic when applied to real applications. This paper addresses two of these problems: (1) the constraints generated during symbolic execution may be ...
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
This paper studies the effect of bisimulation minimisation in model checking of monolithic discrete-time and continuous-time Markov chains as well as variants thereof with rewards...
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
Analysis of biological data often requires an understanding of components of pathways and/or networks and their mutual dependency relationships. Such systems are often analyzed and...
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
We present JPF–SE, an extension to the Java PathFinder Model Checking framework (JPF) that enables the symbolic execution of Java programs. JPF–SE uses JPF to generate and expl...
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analysis of timed systems. A recently-developed approach for the analysis of...
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
We introduce a novel approach to the smart execution of scenario-based models of reactive systems, such as those resulting from the multi-modal inter-object language of live sequen...
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
This paper is concerned with bridging the gap between requirements, provided as a set of scenarios, and conforming design models. The novel aspect of our approach is to exploit lea...
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
