Name
Abstract | ||
|---|---|---|
Many simulation based Bounded Model Checking approaches to System Level Formal Verification (SLFV) have been devised. Typically such approaches exploit the capability of simulators to save computation time by saving and restoring the state of the system under simulation. However, even though such approaches aim to (bounded) formal verification, as a matter of fact, the simulator behaviour is not formally modelled and the proof of correctness of the proposed approaches basically relies on the intuitive notion of simulator behaviour. This gap makes it hard to check if the optimisations introduced to speed up the simulation do not actually omit checking relevant behaviours of the system under verification.The aim of this paper is to fill the above gap by presenting a formal semantics for simulators. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.4204/EPTCS.193.7 | ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE |
Field | DocType | Issue |
Model checking,Simulation,Computer science,Correctness,Theoretical computer science,Exploit,Semantics,Computation,Bounded function,Speedup,Formal verification | Journal | 193 |
ISSN | Citations | PageRank |
2075-2180 | 0 | 0.34 |
References | Authors | |
13 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Toni Mancini | 1 | 240 | 25.98 |
| Federico Mari | 2 | 140 | 12.26 |
| Annalisa Massini | 3 | 137 | 15.53 |
| Igor Melatti | 4 | 217 | 19.48 |
| Enrico Tronci | 5 | 336 | 35.83 |