Search Results - "Liffiton, Mark H."
-
1
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Published in Journal of automated reasoning (01-01-2008)“…Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable “cores” from unsatisfiable constraint systems…”
Get full text
Journal Article -
2
Exploiting structure in symmetry detection for CNF
Published in Annual ACM IEEE Design Automation Conference: Proceedings of the 41st annual conference on Design automation; 07-11 June 2004 (07-06-2004)“…Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from…”
Get full text
Conference Proceeding
-
3
Fast, flexible MUS enumeration
Published in Constraints : an international journal (01-04-2016)“…The problem of enumerating minimal unsatisfiable subsets (MUSes) of an infeasible constraint system is challenging due first to the complexity of computing…”
Get full text
Journal Article -
4
Refinement strategies for verification methods based on datapath abstraction
Published in Proceedings of the 2006 Asia and South Pacific Design Automation Conference (24-01-2006)“…In this paper we explore the application of Counter example-Guided Abstraction Refinement (CEGAR) in the context of microprocessor correspondence checking. The…”
Get full text
Conference Proceeding -
5
Parallelizing Partial MUS Enumeration
Published in 2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI) (01-11-2016)“…The problem of enumerating minimal unsatisfiable subsets of a constraint system (MUSes) is a natural candidate for parallelization: as an enumeration problem,…”
Get full text
Conference Proceeding -
6
Analyzing infeasible constraint systems
Published 01-01-2009“…Constraint systems, problems defined by sets of variables and constraints affecting the allowed assignments to those variables, arise in a wide range of…”
Get full text
Dissertation -
7
Improved Design Debugging Using Maximum Satisfiability
Published in Formal Methods in Computer Aided Design (FMCAD'07) (01-11-2007)“…In today's SoC design cycles, debugging is one of the most time consuming manual tasks. CAD solutions strive to reduce the inefficiency of debugging by…”
Get full text
Conference Proceeding -
8
Finding Graph Decompositions via SAT
Published in 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI) (01-11-2017)“…We begin a systematic study of how Graph Decomposition problems may be represented using propositional formulas, and hence solved using SAT-solver technology…”
Get full text
Conference Proceeding -
9
Analyzing infeasible constraint systems
“…Constraint systems, problems defined by sets of variables and constraints affecting the allowed assignments to those variables, arise in a wide range of…”
Get full text
Dissertation -
10
Refinement strategies for verification methods based on datapath abstraction
Published in Asia and South Pacific Conference on Design Automation, 2006 (2006)“…In this paper, we explore the application of counter-example-guided abstraction refinement (CEGAR) in the context of microprocessor correspondence checking…”
Get full text
Conference Proceeding