Distributing the Workload in a Lazy Theorem-Prover

Authors:
David Deharbe;Silvio Ranise;Jorgiano Vidal
Affiliations:
Departamento de Informática e Matemática Aplicada, Universidade Federal do Rio Grande do Norte, Natal, RN, Brazil;Laboratoire Lorrain de Recherche en Informatique et ses Applications, Institut National de Recherche en Informatique et en Automatique, Nancy, France;Núcleo de Desenvolvimento de Software, Centro Federal de Educação Tecnológica do Rio Grande do Norte, Natal, RN, Brazil
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 11
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
The discrete time TOOLBUS—a software coordination architecture

Science of Computer Programming
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
A machine program for theorem-proving

Communications of the ACM
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic

ACM Transactions on Computational Logic (TOCL)
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Relative Completeness of Abstraction Refinement for Software Model Checking

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Counterexample-guided abstraction refinement for symbolic model checking

Journal of the ACM (JACM)
GridSAT: A Chaff-based Distributed SAT Solver for the Grid

Proceedings of the 2003 ACM/IEEE conference on Supercomputing
E - a brainiac theorem prover

AI Communications - CASC
Nelson-Oppen, shostak and the extended canonizer: a family picture with a newborn

ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Automated theorem proving consists in automatically (i.e. without any user interaction) discharging proof obligations which arise when applying rigorous methodologies for designing critical software systems. Recent developements in the so-called lazy approach in the integration of Boolean satisfiability with decision procedures for decidable theories of first-order logic have provided new means to efficiently prove or refute such proof obligations. In this paper, we present the first (known) attempt to design a distributed version of lazy theorem proving on a network of computers so that the available processing power can be used more effectively and avoid that automated reasoning be the bottleneck of the application of formal methods. Experiments clearly show the viability and the benefits of the proposed approach.