4447 search results - page 95 / 890 » Model Checking Games |
127
click to vote
ENTCS
2007
15 years 3 months ago
2007
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
156
Voted
FOSSACS
2011
Springer
14 years 7 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
121
Voted
CSL
2007
Springer
15 years 9 months ago
2007
Springer
A game semantics of the (−−∗, →)-fragment of the logic of bunched implications, BI, is presented. To date, categorical models of BI have been restricted to two kinds: funct...
134
Voted
ICALP
1997
Springer
15 years 7 months ago
1997
Springer
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...
118
Voted
ENTCS
2008
15 years 3 months ago
2008
This paper presents an efficient solution for modeling checking graph transformation systems. The approach transforms AGG specifications into Bogor models and supports both attribu...