Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. (Q1426130): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Solvable cases of the decision problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4553262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean satisfiability with transitivity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded model checking using satisfiability solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental results on the crossover point in random 3-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: BerkMin: A fast and robust SAT-solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The propositional formula checker HeerHugo / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of experiments and evaluation of BDD ordering heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4276004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP: a search algorithm for propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-suppressed BDDs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A satisfiability procedure for quantified Boolean formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete Lagrangian-based global-search method for solving satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient manipulation of decision diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4553255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal verification based on Boolean expression diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SATO: An efficient propositional prover / rank
 
Normal rank

Latest revision as of 14:48, 6 June 2024

scientific article
Language Label Description Also known as
English
Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
scientific article

    Statements

    Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. (English)
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    SAT-checkers
    0 references
    decision diagrams
    0 references
    equality with uninterpreted functions and memories
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers