557 search results - page 23 / 112 » Automatic Abstraction for Verification of Timed Circuits and... |
ICCAD
2002
IEEE
15 years 6 months ago
2002
IEEE
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
HYBRID
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. In this paper we propose a trajectory based reachability analysis by using local finite-time invariance property. Trajectory based analysis are based on the execution tra...
FORMATS
2009
Springer
15 years 1 months ago
2009
Springer
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
107
click to vote
ATVA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...
110
click to vote
DDECS
2006
IEEE
15 years 1 months ago
2006
IEEE
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...