Using MaxBMC for Pareto-optimal circuit initialization

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Design, Automation and Test in Europe

• Publication date

  2014-03-24

• Fields of study

  Computer Science

• Identifiers
  DOI 10.7873/DATE.2014.161
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Handbook of Satisfiability

  2021cited by this paper
• Efficient SAT-Based Circuit Initialization for Larger Designs

  2014cited by this paper
• A Modular Approach to MaxSAT Modulo Theories

  2013cited by this paper
• Preference-Based Planning via MaxSAT

  2012cited by this paper
• Incremental preprocessing methods for use in BMC

  2011cited by this paper
• A machine program for theorem-proving

  2011cited by this paper
• CryptoMiniSat 2.5.1

  2010cited by this paper
• Initialization for synchronous sequential circuits based on chaotic particle swarm optimization

  2010cited by this paper
• Partial Weighted MaxSAT for Optimal Planning

  2010cited by this paper
• P{re,i}cosat@sc'09 Picosat 193

  2009cited by this paper
• Algorithms for Maximum Satisfiability using Unsatisfiable Cores

  2008cited by this paper
• Analyzing Functional Coverage in Bounded Model Checking

  2008cited by this paper
• Effective IR-drop reduction in at-speed scan testing using distribution-controlling X-Identification

  2008cited by this paper
• Translating Pseudo-Boolean Constraints into SAT

  2006cited by this paper
• Accelerating Bounded Model Checking of Safety Properties

  2004cited by this paper
• Temporal induction by incremental SAT solving

  2003influential reference
• Interpolation and SAT-Based Model Checking

  2003cited by this paper
• Behavioral consistency of C and Verilog programs using bounded model checking

  2003cited by this paper
• Exact Algorithms for MAX-SAT

  2003cited by this paper
• Formal verification using bounded model checking: SAT versus sequential ATPG engines

  2003cited by this paper
• Initializability analysis of synchronous sequential circuits

  2002cited by this paper
• SATIRE: A new incremental satisfiability engine

  2001cited by this paper
• On Synchronizable Circuits and Their Synchronizing Sequences

  2000cited by this paper
• Checking Safety Properties Using Induction and a SAT-Solver

  2000cited by this paper
• Symbolic model checking using SAT procedures instead of BDDs

  1999cited by this paper
• Planning as Satisfiability

  1992cited by this paper
• On determining scan flip-flops in partial-scan designs

  1990cited by this paper
• Algorithms for the maximum satisfiability problem

  1987cited by this paper
• Sorting networks and their applications

  1968cited by this paper
• Linear reasoning. A new form of the Herbrand-Gentzen theorem

  1957cited by this paper

• New Techniques for the Automatic Identification of Uncontrollable Lines in a CPU Core

  2021cites this paper
• Automatic Construction of Fault Attacks on Cryptographic Hardware Implementations

  2019cites this paper
• A comprehensive study and analysis on SAT-solvers: advances, usages and achievements

  2018cites this paper
• SAT-Based Combinational and Sequential Dependency Computation

  2016cites this paper
• Formal Modeling and Verification of Cyber-Physical Systems

  2015cites this paper
• Modeling Unknown Values in Test and Verification

  2015cites this paper
• Towards Pareto-optimal parameter synthesis for monotonie cost functions

  2014cites this paper
• Incremental Encoding and Solving of Cardinality Constraints

  2014cites this paper
• Recent advances in SAT-based ATPG: Non-standard fault models, multi constraints and optimization

  2014cites this paper