314 search results - page 49 / 63 » Sanity Checks in Formal Verification |
62
Voted
ACSD
2004
IEEE
15 years 1 months ago
2004
IEEE
Abstract. A delay-insensitive module communicates with its environment through wires of unbounded delay. To avoid transmission interference, the absorption of a signal transition m...
ENTCS
2006
14 years 9 months ago
2006
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
SAC
2006
ACM
14 years 9 months ago
2006
ACM
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
103
click to vote
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The Windows Vista operating system implements an interesting model of multi-level integrity. We observe that in this model, trusted code must participate in any information-flow a...