26 search results - page 1 / 6 » Computation of minimal counterexamples by using black box te... |
ICCAD
2007
IEEE
14 years 1 months ago
2007
IEEE
— Computing counterexamples is a crucial task for error diagnosis and debugging of sequential systems. If an implementation does not fulfill its specification, counterexamples ...
ICAC
2005
IEEE
13 years 10 months ago
2005
IEEE
Methods for automatically managing the performance of computing services must estimate a performance model of that service. This paper explores properties that are necessary for p...
CAV
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
DAC
2004
ACM
14 years 5 months ago
2004
ACM
ion of Assembler Programs for Symbolic Worst Case Execution Time Analysis Tobias Schuele Tobias.Schuele@informatik.uni-kl.de Klaus Schneider Klaus.Schneider@informatik.uni-kl.de Re...
ICRA
1993
IEEE
13 years 8 months ago
1993
IEEE
An issue central to the navigation problem is memory. Traditional systems build symbolic maps of the world for navigational reference. Reactive methods, in contrast, eliminate or m...