3 search results - page 1 / 1 » Compact Labelings For Efficient First-Order Model-Checking |
CORR
2008
Springer
13 years 4 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...
FAW
2008
Springer
13 years 6 months ago
2008
Springer
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
FMCAD
1998
Springer
13 years 8 months ago
1998
Springer
We present a new approach to the verification of hardware systems with data dependencies using temporal logic symbolic model checking. As a benchmark we take Tomasulo's algori...