4401 search results - page 140 / 881 » Computing with Default Logic |
130
Voted
FSTTCS
2000
Springer
15 years 6 months 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 ...
146
Voted
TCS
1998
15 years 2 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...
128
click to vote
FUIN
2010
14 years 12 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
15 years 13 days ago
2009
We aim to generalize B
139
Voted
FCCM
1997
IEEE
15 years 6 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...