499 search results - page 37 / 100 » LTL satisfiability checking |
APSEC
2007
IEEE
14 years 5 months ago
2007
IEEE
The coordination-policy that components interactions satisfied often determines the properties of nowadays component-based information systems, e.g. Safety, Liveness and Fairness ...
FORMATS
2006
Springer
14 years 2 months ago
2006
Springer
In this paper, we consider a novel approach to the temporal logic verification problem of continuous dynamical systems. Our methodology has the distinctive feature that enables the...
PDPTA
2000
14 years 9 days ago
2000
In this paper we address the issue of dependable distributed high performance computing in the field of Symbolic Computation. We describe the extension of a middleware infrastructu...
VLSID
2004
IEEE
14 years 11 months ago
2004
IEEE
This paper presents a novel technique for abstracting designs in order to increase the efficiency of formal property checking. Bounded Model Checking (BMC), using Satisfiability (...
CADE
2002
Springer
14 years 11 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 ...