default search action
Journal on Satisfiability, Boolean Modeling and Computation, Volume 5
Volume 5, Number 1-4, June 2008
Articles
- Miroslav N. Velev:
Editor's Introduction to the Special Volume on Application of Constraints to Formal Verification. - Sean Safarpour, Andreas G. Veneris, Rolf Drechsler:
Improved SAT-based Reachability Analysis with Observability Don't Cares. 1-25 - Javier Esparza, Stefan Kiefer, Stefan Schwoon:
Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems. 27-56 - Masahiro Fujita, Kenshu Seto, Thanyapat Sakunkonchak:
Dependence Graph Based Verification and Synthesis of Hardware/Software Co-Designs with SAT Related Formulation. 57-82 - Viviana Bruno, Luz Amanda Garcia, Sergio Nocco, Stefano Quer:
Stressing Symbolic Scheduling Techniques within Aircraft Maintenance Optimization. 83-110 - Sergio Nocco, Stefano Quer:
A Probabilistic and Approximated Approach to Circuit-Based Formal Verification. 111-132 - Marco Benedetti, Hratch Mangassarian:
QBF-Based Formal Verification: Experience and Perspectives. 133-191 - Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Solving Partial Order Constraints for LPO Termination. 193-215
- Eugene Goldberg:
A Resolution Based SAT-solver Operating on Complete Assignments. 217-242 - Lei Fang, Michael S. Hsiao:
Boosting SAT Solver Performance via a New Hybrid Approach. 243-261
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-15 00:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: