Sciweavers

798 search results - page 88 / 160
» Proving More Properties with Bounded Model Checking
Sort
View
ENTCS
2010
165views more  ENTCS 2010»
13 years 7 months ago
Correct Execution of Reconfiguration for Stateful Components
In component-based software engineering, reconfiguration describes structural changes to the architecture of a component system. For stateful components, not only structural but a...
Moritz Hammer, Alexander Knapp
STTT
2010
120views more  STTT 2010»
13 years 2 months ago
Solving the ignoring problem for partial order reduction
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
Sami Evangelista, Christophe Pajault
CORR
2008
Springer
105views Education» more  CORR 2008»
13 years 7 months ago
Certifying floating-point implementations using Gappa
High confidence in floating-point programs requires proving numerical properties of final and intermediate values. One may need to guarantee that a value stays within some range, ...
Florent de Dinechin, Christoph Quirin Lauter, Guil...
FMOODS
2008
13 years 9 months ago
Symbolic Step Encodings for Object Based Communicating State Machines
In this work, novel symbolic step encodings of the transition relation for object based communicating state machines are presented. This class of systems is tailored to capture the...
Jori Dubrovin, Tommi A. Junttila, Keijo Heljanko
ISSTA
2004
ACM
14 years 1 months ago
An optimizing compiler for batches of temporal logic formulas
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
James Ezick