8 search results - page 1 / 2 » Model-Checking First-Order Logic: Automata and Locality |
CSL
2007
Springer
15 years 3 months ago
2007
Springer
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
90
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
80
Voted
STACS
1998
Springer
15 years 1 months ago
1998
Springer
FM
2003
Springer
15 years 2 months ago
2003
Springer
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...