Sciweavers

1722 search results - page 17 / 345
» Generating Tests from Counterexamples
Sort
View
ATVA
2008
Springer
143views Hardware» more  ATVA 2008»
13 years 12 months ago
Automating Algebraic Specifications of Non-freely Generated Data Types
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
ICFEM
2009
Springer
13 years 7 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
QSIC
2009
IEEE
14 years 4 months ago
From UML Statecharts to LOTOS: A Semantics Preserving Model Transformation
—A well-founded testing theory encourages the practical application of test case generation techniques. This aims at overcoming the ever increasing complexity of softwareenabled ...
Valentin Chimisliu, Christian Schwarzl, Bernhard P...
PTS
1998
131views Hardware» more  PTS 1998»
13 years 11 months ago
Factorized Test Generation for Multi-Input/Output Transition Systems
In this paper we present factorized test generation techniques that can be used to generate test cases from a specification that is modelled as a labelled transition system. The t...
Ed Brinksma, Lex Heerink, Jan Tretmans
DATE
2007
IEEE
97views Hardware» more  DATE 2007»
14 years 4 months ago
Estimating functional coverage in bounded model checking
Formal verification is an important issue in circuit and system design. In this context, Bounded Model Checking (BMC) is one of the most successful techniques. But even if all sp...
Daniel Große, Ulrich Kühne, Rolf Drechs...