4401 search results - page 140 / 881 » Computing with Default Logic |
FSTTCS
2000
Springer
14 years 16 days ago
2000
Springer
: A pushdown system is a graph G(P) of configurations of a pushdown automaton P. The model checking problem for a logic L is: given a pushdown automaton P and a formula L decide ...
TCS
1998
13 years 8 months ago
1998
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA...
FUIN
2010
13 years 6 months ago
2010
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
DLT
2009
13 years 6 months ago
2009
We aim to generalize B
FCCM
1997
IEEE
14 years 1 months ago
1997
IEEE
The RAW benchmark suite consists of twelve programs designed to facilitate comparing, validating, and improving reconfigurable computing systems. These benchmarks run the gamut o...