2872 search results - page 99 / 575 » On (Omega-)Regular Model Checking |
120
Voted
ICCD
2005
IEEE
16 years 18 days ago
2005
IEEE
In recent years, Boolean Satisfiability (SAT) has been shown to hold potential for Unbounded Model Checking (UMC). The success of SAT-based UMC largely relies on (i) the SAT solv...
133
Voted
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
131
click to vote
SAFECOMP
2007
Springer
15 years 9 months ago
2007
Springer
In existing security model-checkers the intruder’s behavior is defined as a message deducibility rule base governing use of eavesdropped information, with the aim to find out a m...
132
Voted
CSL
2004
Springer
15 years 9 months ago
2004
Springer
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, ¢¡ , comprised of finite, but arbitrarily many,...
132
Voted
ISLPED
2010
ACM
15 years 3 months ago
2010
ACM
The ongoing scaling of semiconductor technology is causing severe increase of on-chip power density and temperature in microprocessors. This has raised urgent requirement for both...