2878 search results - page 16 / 576 » Model Checking FTA |
ENTCS
2006
15 years 24 days ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
110
Voted
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
After informally reviewing the main concepts from game semantics and placing the development of the field in a historical context we examine its main applications. We focus in pa...
101
Voted
ICALP
2000
Springer
15 years 4 months ago
2000
Springer
Abstract A new unfolding approach to LTL model checking is presented, in which the model checking problem can be solved by direct inspection of a certain finite prefix. The techniq...
91
Voted
JAPLL
2006
15 years 23 days ago
2006
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context...
100
Voted
EUROGP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Model checking is a way of analysing programs and programlike structures to decide whether they satisfy a list of temporal logic statements describing desired behaviour. ...