94 search results - page 2 / 19 » Model-Checking over Multi-valued Logics |
FM
2001
Springer
13 years 12 months ago
2001
Springer
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
CSL
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
CADE
2002
Springer
14 years 7 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
HYBRID
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...