19 search results - page 3 / 4 » charme 2005 |
CHARME
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Unbounded model checking of invariant properties is typically solved using symbolic reachability. However, BDD based reachability methods suffer from lack of robustness ...
CHARME
2005
Springer
13 years 10 months ago
2005
Springer
Today, verification is becoming the dominating factor for successful circuit designs. In this context formal verification techniques allow to prove the correctness of a circuit ...
CHARME
2005
Springer
13 years 10 months ago
2005
Springer
Timing diagrams are useful for capturing temporal specifications in which all mentioned events are required to occur. We first show that translating timing diagrams with both par...
CHARME
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We propose a new saturation-based symbolic state-space generation algorithm for finite discrete-state systems. Based on the structure of the high-level model specificat...
CHARME
2005
Springer
13 years 7 months ago
2005
Springer
Abstract. Automatic formal verification techniques generally require exponential resources with respect to the number of primary inputs of a netlist. In this paper, we present sev...