Sciweavers

428 search results - page 69 / 86
» FPGA-Based SAT Solver
Sort
View
AIPS
2000
13 years 9 months ago
DPPlan: An Algorithm for Fast Solutions Extraction from a Planning Graph
Themostefficient planning algorithms recently developed are mainly based on Graphplansystem or on satisfiability approach. In this paper wepresent a new approach to plan generatio...
Marco Baioletti, Stefano Marcugini, Alfredo Milani
ECOOP
2011
Springer
12 years 7 months ago
Tunable Static Inference for Generic Universe Types
Object ownership is useful for many applications, including program verification, thread synchronization, and memory management. However, the annotation overhead of ownership type...
Werner Dietl, Michael D. Ernst, Peter Müller
ICSE
2003
IEEE-ACM
14 years 7 months ago
Modular Verification of Software Components in C
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...
Sagar Chaki, Edmund M. Clarke, Alex Groce, Somesh ...
ATS
2009
IEEE
111views Hardware» more  ATS 2009»
14 years 2 months ago
Dynamic Compaction in SAT-Based ATPG
SAT-based automatic test pattern generation has several advantages compared to conventional structural procedures, yet often yields too large test sets. We present a dynamic compa...
Alejandro Czutro, Ilia Polian, Piet Engelke, Sudha...
ICTAI
2009
IEEE
14 years 2 months ago
Learning for Dynamic Subsumption
This paper presents an original dynamic subsumption technique for Boolean CNF formulae. It exploits simple and sufficient conditions to detect, during conflict analysis, clauses...
Youssef Hamadi, Saïd Jabbour, Lakhdar Sais