590 search results - page 74 / 118 » Non-Failure Analysis for Logic Programs |
EUC
2004
Springer
14 years 2 months ago
2004
Springer
The Distributed Object Group Framework(DOGF) we constructed supports the grouping of distributed objects that are required for distributed application. From the DOGF, we manage dis...
CADE
2002
Springer
14 years 9 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 ...
SPE
2002
13 years 8 months ago
2002
This study presents a practical solution for data collection and restoration to migrate a process written in high level stack-based languages such as C and Fortran over a network ...
ISSTA
2004
ACM
14 years 2 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
SIGSOFT
2003
ACM
14 years 2 months ago
2003
ACM
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...