Formal Methods in Computer-Aided Design

DOI10.1007/B102264zbMATH Open1117.68429OpenAlexW4229585471MaRDI QIDQ5492986FDOQ5492986

Orna Grumberg, Avi Yadgar, Assaf Schuster

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b102264

Recommendations

• Implementing efficient All solutions SAT solvers
• Trade-offs between time and memory in a tighter model of CDCL SAT solvers
• Efficient SAT solving under assumptions
• scientific article; zbMATH DE number 1629965
• scientific article; zbMATH DE number 1958491
• Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination
• Theory and Applications of Satisfiability Testing
• Efficient data structures for backtrack search SAT solvers
• Theory and Applications of Satisfiability Testing
• Formal Methods for Hardware Verification

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (5)

• Disjunctive closures for knowledge compilation
• Tools and Algorithms for the Construction and Analysis of Systems
• A microscopic-view infection model based on linear systems
• Improved SAT-based reachability analysis with observability don't cares
• On enumerating short projected models

Uses Software

• SATO
• Chaff
• BerkMin

This page was built for publication: Formal Methods in Computer-Aided Design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492986)