69 search results - page 2 / 14 » Logspace Reducibility via Abstract State Machines |
CADE
2010
Springer
13 years 6 months ago
2010
Springer
State of the art reasoners for expressive description logics, such as those that underpin the OWL ontology language, are typically based on highly optimized implementations of (hyp...
SPIN
2005
Springer
13 years 11 months ago
2005
Springer
Embedded software verification is an important verification problem that requires the ability to reason about the timed semantics of concurrent behaviors at a low level of atomic...
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Feature extraction based on evolutionary search offers new possibilities for improving classification accuracy and reducing measurement complexity in many data mining and...
FMCAD
2009
Springer
14 years 5 days ago
2009
Springer
Abstract—Several successful approaches to software verificabased on the construction and analysis of an abstract reachability tree (ART). The ART represents unwindings of the co...
FMCAD
2007
Springer
13 years 9 months ago
2007
Springer
We present a framework for formal verification of embedded custom memories. Memory verification is complicated ifficulty in abstracting design parameters induced by the inherently ...