To SAT or Not to SAT: Scalable Exploration of Functional Dependency

Jiang, Jie-Hong R.; Lee, Chih-Chun; Mishchenko, Alan; Huang, Chung-Yang

doi:10.1109/tc.2010.12

Cited by 26 publications

(30 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A more detailed exposition can be found, e.g., in [11]. Assumptions-based incremental SAT searches for an assignment that satisfies the current set of clauses under the unit assumptions assumps = n i=0 ai.…”

Section: Sat Solving and Incremental Satmentioning

confidence: 99%

Scalable sequence-constrained retention register minimization in power gating design

Chiang

Chang

Liu

et al. 2015

Proceedings of the 52nd Annual Design Automation Conference

View full text Add to dashboard Cite

Retention registers are utilized in power gating design to hold design state during power down and to allow safe and fast system reactivation. Since a retention register consumes more power and costs more area than a non-retention register, it is desirable to minimize the use of retention registers. However, relaxing retention requirement to a minimal subset of registers can be computationally challenging. In this paper, we adopt satisfiability solving for scalable selection of registers whose retention is unnecessary and exploit input sequence constraints to increase the number of non-retention registers. Empirical results on industrial benchmarks show that our proposed methods are efficient and effective in identifying non-retention registers.

show abstract

Section: Sat Solving and Incremental Satmentioning

confidence: 99%

Scalable sequence-constrained retention register minimization in power gating design

Chiang

Chang

Liu

et al. 2015

Proceedings of the 52nd Annual Design Automation Conference

View full text Add to dashboard Cite

show abstract

“…To the best of our knowledge, there is no general method how to solve the problem for an arbitrary predicate but for most protocols such predicates are described using Boolean functions or systems of linear comparisons over integers or rational numbers. If all the predicates are Boolean functions then the satisfiability problem is reduced to the well known SAT problem and there are efficient algorithms for its solving, see, for example [23], [24]. If predicates are represented as linear expressions then there are methods how to solve a corresponding system of linear comparisons [25].…”

Section: B Context-free Efsm Slicementioning

confidence: 99%

Extended Finite State Machine based Test Derivation Strategies for Telecommunication Protocols

Kushik¹,

Kolomeez²,

Cavalli³

et al. 2014

Proceedings of the Spring/Summer Young Researchers' Colloquium on Software Engineering

View full text Add to dashboard Cite

Abstract-In this paper, we consider the problem of test derivation based on an Extended Finite State Machine (EFSM) that is widely used for describing the behavior of telecommunication protocols and software. An EFSM augments a classical Finite State Machine (FSM) with context variables, input/output parameters and predicates. Tests based on various coverage criteria for EFSMs do not capture many functional faults and thus, there is a strong need for tests checking functional properties. Moreover, since there are no constructive necessary and sufficient conditions for checking whether two arbitrary EFSMs are equivalent, most methods are based on some kind of a transition tour, despite of the fact that such methods do not provide test suites with the guaranteed fault coverage. Given possibly nondeterministic and partial EFSM, we consider a transition tour of an FSM obtained by the simulation of the initial EFSM and provide some experimental results that such a test suite detects a number of inconsistencies in available protocol implementations with respect to protocol specifications. Since a transition tour augmented with state identifiers is known to have the higher fault coverage, we also discuss how state identifiers can be generated without facing the state explosion problem. Correspondingly, we consider FSM slices that are obtained by deleting from the initial EFSM all the context variables and possibly, input and output parameters. As the obtained FSM can be nondeterministic, a state identifier should contain separating sequences for pairs of states and we adapt the known techniques for deriving separating sequences for nonobservable partial FSMs.

show abstract

“…MUSes find a wide range of practical applications, including Boolean function decomposition [11,13,18], high-level MUSes [19] for the refinement of datapath abstractions [22] and formal equivalence checking [20,21]. (See [26] for a recent overview of MUSes.…”

Section: Definition 3 (Mus)mentioning

confidence: 99%

“…Earlier work on SAT-based function bi-decomposition proposed computing MUSes with SAT solvers [11,13,18], where partitions are partially enumerated. This section extends this earlier work, and develops two techniques that improve performance significantly and achieve better quality partitions.…”

Section: Improved Mus-based Bi-decompositionmentioning

confidence: 99%

“…Hence, it is generally accepted that BDDs do not scale for large Boolean functions. As a result, recent work [11,13,18] proposed the use of Boolean Satisfiability (SAT) to manipulate large Boolean functions. For example, [11] has a number of key features, including: (1) good performance on some large circuits; and (2) capability to automatically identify variable partitions.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Improvements to Satisfiability-Based Boolean Function Bi-Decomposition

Chen

Marques-Silva

2012

VLSI-SoC: Advanced Research for Systems on Chip

View full text Add to dashboard Cite

Abstract. Boolean function bi-decomposition is pervasive in logic synthesis. Bi-decomposition entails the decomposition of a Boolean function into two other functions connected by a simple two-input gate. Existing solutions are based on Binary Decision Diagrams (BDDs) and, more recently, on Boolean Satisfiability (SAT). Recent work exploited the identification of Minimally Unsatisfiable Subformulas (MUSes) for computing the sets of variables to use in Boolean function bi-decomposition. This paper develops new techniques for improving the use of MUSes in function bi-decomposition. The first technique exploits structural properties of the function being decomposed, whereas the second technique exploits group-oriented MUSes. Experimental results obtained on representative benchmarks from logic synthesis demonstrate significant improvements both in performance and in the quality of decompositions.

show abstract

To SAT or Not to SAT: Scalable Exploration of Functional Dependency

Cited by 26 publications

References 19 publications

Scalable sequence-constrained retention register minimization in power gating design

Scalable sequence-constrained retention register minimization in power gating design

Extended Finite State Machine based Test Derivation Strategies for Telecommunication Protocols

Improvements to Satisfiability-Based Boolean Function Bi-Decomposition

Contact Info

Product

Resources

About