Sciweavers

819 search results - page 16 / 164
» Using Assumptions to Distribute CTL Model Checking
Sort
View
106
Voted
LICS
1994
IEEE
15 years 4 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
EUROCAST
2007
Springer
161views Hardware» more  EUROCAST 2007»
15 years 4 months ago
Using Verification Technology to Specify and Detect Malware
Abstract. Computer viruses and worms are major threats for our computer infrastructure, and thus, for economy and society at large. Recent work has demonstrated that a model checki...
Andreas Holzer, Johannes Kinder, Helmut Veith
POPL
2011
ACM
14 years 3 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
100
Voted
ISOLA
2004
Springer
15 years 5 months ago
Embedding Finite Automata within regular Expressions
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah
90
Voted
ENTCS
2007
97views more  ENTCS 2007»
15 years 13 days ago
Can a Model Checker Generate Tests for Non-Deterministic Systems?
Modern software is increasingly concurrent, timed, distributed, and therefore, non-deterministic. While it is well known that tests can be generated as LTL or CTL model checker co...
Sergiy Boroday, Alexandre Petrenko, Roland Groz