SATIRE

swMATH4648MaRDI QIDQ16818FDOQ16818

Author name not available (Why is that?)

Official website: http://www.cecs.uci.edu/~papers/compendium94-03/papers/2001/dac01/pdffiles/33_3.pdf

Cited In (62)

• Hardware and Software, Verification and Testing
• Combining Abstraction Refinement and SAT-Based Model Checking
• Linear Encodings of Bounded LTL Model Checking
• Correct Hardware Design and Verification Methods
• Computer Aided Verification
• Automatic evaluation of context-free grammars (system description)
• On dedicated CDCL strategies for PB solvers
• The incremental satisfiability problem for a two conjunctive normal form
• Ultimately incremental SAT
• SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
• On weakening strategies for PB solvers
• Computer Aided Verification
• A SAT-based method for solving the two-dimensional strip packing problem
• Formal Methods for Hardware Verification
• Test Pattern Generation using Boolean Proof Engines
• A framework for satisfiability modulo theories
• On SAT instance classes and a method for reliable performance experiments with SAT solvers
• Incomplete dynamic backtracking for linear pseudo-Boolean problems
• Range and set abstraction using SAT
• Preprocessing in incremental SAT
• HaifaSat
• Pueblo
• SATO
• PBS
• BerkMin
• Chaff
• SystemC
• Coala
• QUBOS
• SATORI
• HANNIBAL
• HITEC
• Pinapa
• PASSAT
• SOCRATES
• AMUSE
• MUP
• Velev SAT Benchmarks
• An approach for extracting a small unsatisfiable core
• Theory and Applications of Satisfiability Testing
• ICS
• C32SAT
• QAGen
• Z34Bio
• semprop
• SatELite
• Efficient SAT engines for concise logics: accelerating proof search for zero-one linear constraint systems
• A rigorous methodology for specification and verification of business processes
• Towards a design flow for reversible logic
• Formal Methods in Computer-Aided Design
• VIS
• Incremental bounded model checking for embedded software
• HySAT: An efficient proof engine for bounded model checking of hybrid systems
• High Quality Test Pattern Generation and Boolean Satisfiability
• Mining backbone literals in incremental SAT. A new kind of incremental data
• FRAT
• Search techniques for SAT-based Boolean optimization
• Gearing up for effective ASP planning
• SDSAT: Tight integration of small domain encoding and lazy approaches in solving difference logic.
• Robustness and usability in modern design flows
• Decision procedures. An algorithmic point of view
• Transfer function synthesis without quantifier elimination

This page was built for software: SATIRE