12981 search results - page 34 / 2597 » Model Checking (Abstract) |
131
Voted
QEST
2007
IEEE
15 years 9 months ago
2007
IEEE
— Probabilistic models are widely used to analyze embedded, networked, and more recently biological systems. Existing numerical analysis techniques are limited to finitestate mo...
135
Voted
CADE
2002
Springer
16 years 3 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 ...
124
Voted
ITA
2007
15 years 2 months ago
2007
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
115
click to vote
MEMOCODE
2007
IEEE
15 years 9 months ago
2007
IEEE
The always increasing complexity of digital system is overcome in design flows based on Transaction Level Modeling (TLM) by designing and verifying the system at difbstraction le...
117
Voted
KBSE
2003
IEEE
15 years 8 months ago
2003
IEEE
A key problem in model checking open systems is environment modeling (i.e., representing the behavior of the execution context of the system under analysis). Software systems are ...