219 search results - page 13 / 44 » Context-aware counter abstraction |
CADE
2012
Springer
12 years 12 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
RP
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Lossy counter machines (LCM’s) are a variant of Minsky counter machines based on weak (or unreliable) counters in the sense that they can decrease nondeterministically ...
FMSD
2010
14 years 6 months ago
2010
aware counter abstraction G
CAV
2009
Springer
15 years 10 months ago
2009
Springer
Counter Abstraction for Concurrent Software G?erard Basler1 , Michele Mazzucchi1 , Thomas Wahl1,2 , Daniel Kroening1,2 1 Computer Systems Institute, ETH Zurich, Switzerland 2 Compu...
FM
2009
Springer
15 years 4 months ago
2009
Springer
