150 search results - page 26 / 30 » Symbolic Model Checking for Simply-Timed Systems |
SBMF
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. This paper presents a case study on retrospective veri cation of the Linux Virtual File System (VFS), which is aimed at checking for violations of API usage rules and mem...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
ENTCS
2007
13 years 7 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
TACAS
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
Attribute staleness arises due to the physical distribution of authorization information, decision and enforcement points. This is a fundamental problem in virtually any secure di...