Sciweavers

2878 search results - page 16 / 576
» Model Checking FTA
Sort
View
ENTCS
2006
125views more  ENTCS 2006»
13 years 7 months ago
Liveness Checking as Safety Checking for Infinite State Spaces
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...
Viktor Schuppan, Armin Biere
LICS
2009
IEEE
14 years 2 months ago
Applications of Game Semantics: From Program Analysis to Hardware Synthesis
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...
Dan R. Ghica
ICALP
2000
Springer
13 years 11 months ago
A New Unfolding Approach to LTL Model Checking
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...
Javier Esparza, Keijo Heljanko
JAPLL
2006
97views more  JAPLL 2006»
13 years 7 months ago
Model checking propositional dynamic logic with all extras
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context...
Martin Lange
EUROGP
2007
Springer
116views Optimization» more  EUROGP 2007»
14 years 1 months ago
Genetic Programming with Fitness Based on Model Checking
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. ...
Colin G. Johnson