메뉴 건너뛰기




Volumn , Issue , 2000, Pages 675-679

Boolean satisfiability in electronic design automation

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMBINATORIAL CIRCUITS; LOGIC GATES; MATHEMATICAL MODELS;

EID: 0033684697     PISSN: 0738100X     EISSN: None     Source Type: Journal    
DOI: 10.1109/DAC.2000.855400     Document Type: Article
Times cited : (82)

References (43)
  • 1
    • 0003694163 scopus 로고
    • Digital Systems Testing and Testable Design
    • Computer Science Press
    • M. Abramovici M. A. Breuer A. D. Friedman Digital Systems Testing and Testable Design 1990 Computer Science Press
    • (1990)
    • Abramovici, M.1    Breuer, M.A.2    Friedman, A.D.3
  • 2
    • 85177107325 scopus 로고    scopus 로고
    • A Massively-Parallel Easily-Scalable Satisfiability Solver Using Reconfigurable Hardware
    • M. Abramovici J. De Sousa D. Saab A Massively-Parallel Easily-Scalable Satisfiability Solver Using Reconfigurable Hardware Proceedings of the Design Automation Conference Proceedings of the Design Automation Conference 1999-June
    • (1999)
    • Abramovici, M.1    De Sousa, J.2    Saab, D.3
  • 3
    • 0003989065 scopus 로고
    • A Davis-Putnam Based Enumeration Algorithm for Linear pseudo-Boolean Optimization
    • P. Barth A Davis-Putnam Based Enumeration Algorithm for Linear pseudo-Boolean Optimization 1995 MPI-I-95-2-003 Max-Planck-Institut für Informatik
    • (1995)
    • Barth, P.1
  • 4
    • 34247110550 scopus 로고    scopus 로고
    • Using CSP Look-Back Techniques to Solve Real-World SAT Instances
    • R. Bayardo R. Schrag Using CSP Look-Back Techniques to Solve Real-World SAT Instances Proceedings of the National Conference on Artificial Intelligence (AAAI-97) Proceedings of the National Conference on Artificial Intelligence (AAAI-97) 1997
    • (1997)
    • Bayardo, R.1    Schrag, R.2
  • 5
    • 84944319371 scopus 로고    scopus 로고
    • Symbolic Model Checking without BDDs
    • A. Biere A. Cimatti E. Clarke Y. Zhu Symbolic Model Checking without BDDs Proceedings of TACAS 1579 Proceedings of TACAS 1999-March
    • (1999) , vol.1579
    • Biere, A.1    Cimatti, A.2    Clarke, E.3    Zhu, Y.4
  • 6
    • 84861449103 scopus 로고    scopus 로고
    • Superscalar Processor Verification Using Reductions of the Logic of Equality with Uninterpreted Functions to Propositional Logic
    • M. N. Velev R. E. Bryant Superscalar Processor Verification Using Reductions of the Logic of Equality with Uninterpreted Functions to Propositional Logic Proceedings of CHARME 1703 Proceedings of CHARME 1999-September
    • (1999) , vol.1703
    • Velev, M.N.1    Bryant, R.E.2
  • 7
    • 85177136175 scopus 로고    scopus 로고
    • A Satisfiability-Based Test Generator for Path Delay Faults in Combinational Circuits
    • C.-A. Chen S. K. Gupta A Satisfiability-Based Test Generator for Path Delay Faults in Combinational Circuits Proceedings of the Design Automation Conference Proceedings of the Design Automation Conference 1996-June
    • (1996)
    • Chen, C.-A.1    Gupta, S.K.2
  • 8
    • 85177105350 scopus 로고    scopus 로고
    • Towards True Crosstalk Noise Analysis
    • P. Chen K. Keutzer Towards True Crosstalk Noise Analysis Proceedings of the International Conference on Computer-Aided Design Proceedings of the International Conference on Computer-Aided Design 1999-November
    • (1999)
    • Chen, P.1    Keutzer, K.2
  • 9
    • 85177123063 scopus 로고    scopus 로고
    • On Solving Covering Problems
    • O. Coudert On Solving Covering Problems Proceedings of the Design Automation Conference Proceedings of the Design Automation Conference 1996-June
    • (1996)
    • Coudert, O.1
  • 12
    • 85177131564 scopus 로고
    • Sequential Logic Optimization by Redundancy Addition and Removal
    • L. Entrena K.-T. Cheng Sequential Logic Optimization by Redundancy Addition and Removal Proceedings of the International Conference on Computer-Aided Design Proceedings of the International Conference on Computer-Aided Design 1993-November
    • (1993)
    • Entrena, L.1    Cheng, K.-T.2
  • 13
    • 85177105267 scopus 로고    scopus 로고
    • Functional Vector Generation For HDL Models Using Linear Programming and 3-Satisfiability
    • F. Fallah S. Devadas K. Keutzer Functional Vector Generation For HDL Models Using Linear Programming and 3-Satisfiability Proceedings of the Design Automation Conference Proceedings of the Design Automation Conference 1998-June
    • (1998)
    • Fallah, F.1    Devadas, S.2    Keutzer, K.3
  • 14
    • 38149013393 scopus 로고    scopus 로고
    • Boosting Combinatorial Search Through Randomization
    • C. P. Gomes B. Selman H. Kautz Boosting Combinatorial Search Through Randomization Proceedings of the National Conference on Artificial Intelligence Proceedings of the National Conference on Artificial Intelligence 1998-July
    • (1998)
    • Gomes, C.P.1    Selman, B.2    Kautz, H.3
  • 15
    • 0003461410 scopus 로고    scopus 로고
    • The Propositional Formula Checker HeerHugo
    • J. F. Groote J P. Warners The Propositional Formula Checker HeerHugo January 1999 SEN-R9905 (CWI)
    • (1999)
    • Groote, J.F.1    Warners, .P.2
  • 16
    • 85177106641 scopus 로고    scopus 로고
    • Integrating a Boolean Satisfiability Checker and BDDs for Combinational Equivalence Checking
    • A. Gupta P. Ashar Integrating a Boolean Satisfiability Checker and BDDs for Combinational Equivalence Checking Proceedings of the International Conference in VLSI Design Proceedings of the International Conference in VLSI Design 1998-January
    • (1998)
    • Gupta, A.1    Ashar, P.2
  • 17
    • 85177116887 scopus 로고    scopus 로고
    • RID-GRASP: Redundancy Identification and Removal Using GRASP
    • J. Kim J. Marques-Silva H. Savoj K. A. Sakallah RID-GRASP: Redundancy Identification and Removal Using GRASP International Workshop on Logic Synthesis International Workshop on Logic Synthesis 1997-May
    • (1997)
    • Kim, J.1    Marques-Silva, J.2    Savoj, H.3    Sakallah, K.A.4
  • 18
    • 0003934656 scopus 로고    scopus 로고
    • On Applying Incremental Satisfiability to Delay Fault Testing
    • J. Kim J. Whittemore J. Marques-Silva K. A. Sakallah On Applying Incremental Satisfiability to Delay Fault Testing Proceedings of the Design, Automation and Test in Europe Conference Proceedings of the Design, Automation and Test in Europe Conference 2000-March
    • (2000)
    • Kim, J.1    Whittemore, J.2    Marques-Silva, J.3    Sakallah, K.A.4
  • 19
    • 0004175258 scopus 로고    scopus 로고
    • Reasoning in Boolean Networks
    • Kluwer Academic Publishers
    • W. Kunz D. Stoffel Reasoning in Boolean Networks 1997 Kluwer Academic Publishers
    • (1997)
    • Kunz, W.1    Stoffel, D.2
  • 20
    • 0026623575 scopus 로고
    • Test Pattern Generation Using Boolean Satisfiability
    • T. Larrabee Test Pattern Generation Using Boolean Satisfiability IEEE Transactions on Computer-Aided Design 11 1 4 15 January 1992
    • (1992) IEEE Transactions on Computer-Aided Design , vol.11 , Issue.1 , pp. 4-15
    • Larrabee, T.1
  • 21
    • 85177128876 scopus 로고    scopus 로고
    • C.-M. Li Equivalency Reasoning to Solve a Class of Hard SAT Problems http://www.research.att.com/~kautz/challenge/cli.ps
    • Li, C.-M.1
  • 22
    • 85177105456 scopus 로고    scopus 로고
    • Models and Algorithms for Computing Minimum-Size Prime Implicants
    • V. Manquinho A. Oliveira J. Marques-Silva Models and Algorithms for Computing Minimum-Size Prime Implicants Proceedings of the International Workshop on Boolean Problems Proceedings of the International Workshop on Boolean Problems 1998-September
    • (1998)
    • Manquinho, V.1    Oliveira, A.2    Marques-Silva, J.3
  • 23
    • 85177138671 scopus 로고    scopus 로고
    • On Using Satisfiability-Based Pruning Techniques in Covering Algorithms
    • V. Manquinho J. Marques-Silva On Using Satisfiability-Based Pruning Techniques in Covering Algorithms Proceedings of the Design, Automation and Test in Europe Conference Proceedings of the Design, Automation and Test in Europe Conference 2000-March
    • (2000)
    • Manquinho, V.1    Marques-Silva, J.2
  • 24
    • 0003659655 scopus 로고    scopus 로고
    • GRASP—A New Search Algorithm for Satisfiability
    • J. Marques-Silva K. A. Sakallah GRASP—A New Search Algorithm for Satisfiability Proceedings of the International Conference on Computer-Aided Design Proceedings of the International Conference on Computer-Aided Design 1996-November
    • (1996)
    • Marques-Silva, J.1    Sakallah, K.A.2
  • 25
    • 0005511569 scopus 로고    scopus 로고
    • Robust Search Algorithms for Test Pattern Generation
    • J. Marques-Silva K. A. Sakallah Robust Search Algorithms for Test Pattern Generation Proceedings of the Fault-Tolerant Computing Symposium Proceedings of the Fault-Tolerant Computing Symposium 1997-June
    • (1997)
    • Marques-Silva, J.1    Sakallah, K.A.2
  • 26
    • 85177110322 scopus 로고    scopus 로고
    • Combinational Equivalence Checking Using Satisfiability and Recursive Learning
    • J. Marques-Silva T. Glass Combinational Equivalence Checking Using Satisfiability and Recursive Learning Proceedings of the Design and Test in Europe Conference Proceedings of the Design and Test in Europe Conference 1999-March
    • (1999)
    • Marques-Silva, J.1    Glass, T.2
  • 27
    • 0032680865 scopus 로고    scopus 로고
    • GRASP: A Search Algorithm for Propositional Satisfiability
    • J. Marques-Silva K. A. Sakallah GRASP: A Search Algorithm for Propositional Satisfiability IEEE Transactions on Computers 48 5 506 521 May 1999
    • (1999) IEEE Transactions on Computers , vol.48 , Issue.5 , pp. 506-521
    • Marques-Silva, J.1    Sakallah, K.A.2
  • 28
    • 85177138424 scopus 로고
    • Timing Analysis and Delay-Test Generation Using Path Recursive Functions
    • P. McGeer A. Saldanha P. R. Stephan R. K. Brayton A. L. Sangiovanni-Vincentelli Timing Analysis and Delay-Test Generation Using Path Recursive Functions Proceedings of the International Conference on Computer-Aided Design Proceedings of the International Conference on Computer-Aided Design 1991-November
    • (1991)
    • McGeer, P.1    Saldanha, A.2    Stephan, P.R.3    Brayton, R.K.4    Sangiovanni-Vincentelli, A.L.5
  • 29
    • 85177132873 scopus 로고    scopus 로고
    • Satisfiability Based FPGA Routing
    • G.-J. Nam K. A. Sakallah R. Rutenbar Satisfiability Based FPGA Routing Proceedings of the International Conference on VLSI Design Proceedings of the International Conference on VLSI Design 1999-January
    • (1999)
    • Nam, G.-J.1    Sakallah, K.A.2    Rutenbar, R.3
  • 30
    • 85177114038 scopus 로고    scopus 로고
    • Satisfiability-Based Layout Revisited: Detailed Routing of Complex FPGAs Via Search-Based Boolean SAT
    • G.-J. Nam K. A. Sakallah R. A. Rutenbar Satisfiability-Based Layout Revisited: Detailed Routing of Complex FPGAs Via Search-Based Boolean SAT International Symposium on Field-Programmable Gate Arrays International Symposium on Field-Programmable Gate Arrays 1999-February
    • (1999)
    • Nam, G.-J.1    Sakallah, K.A.2    Rutenbar, R.A.3
  • 31
    • 85177140489 scopus 로고    scopus 로고
    • Solving Satisfiability in CAD Problems
    • A. Saldanha V. Singhal Solving Satisfiability in CAD Problems Proceedings of the Cadence Technical Conference Proceedings of the Cadence Technical Conference 1997-May
    • (1997)
    • Saldanha, A.1    Singhal, V.2
  • 32
    • 0027001335 scopus 로고
    • A New Method for Solving Hard Satisfiability Problems
    • B. Selman H. Levesque D. Mitchell A New Method for Solving Hard Satisfiability Problems Proceedings of the National Conference on Artificial Intelligence (AAAI-92) 440 446 Proceedings of the National Conference on Artificial Intelligence (AAAI-92) 1992
    • (1992) , pp. 440-446
    • Selman, B.1    Levesque, H.2    Mitchell, D.3
  • 33
    • 0003031564 scopus 로고    scopus 로고
    • A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems
    • Y. Shang B. W. Wah A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems Journal of Global Optimization Jan. 1998
    • (1998) Journal of Global Optimization
    • Shang, Y.1    Wah, B.W.2
  • 34
    • 35048858033 scopus 로고    scopus 로고
    • A Tutorial on Stalmarck's Proof Procedure for Propositional Logic
    • M. Sheeran G. Stalmarck A Tutorial on Stalmarck's Proof Procedure for Propositional Logic Proceedings of the International Conference on Formal Methods in Computer-Aided Design Proceedings of the International Conference on Formal Methods in Computer-Aided Design 1998-November
    • (1998)
    • Sheeran, M.1    Stalmarck, G.2
  • 35
    • 0003945440 scopus 로고
    • Algorithms for VLSI Physical Design Automation
    • Kluwer Academic Publishers
    • N. Sherwani Algorithms for VLSI Physical Design Automation 1995 Kluwer Academic Publishers
    • (1995)
    • Sherwani, N.1
  • 36
    • 85177131293 scopus 로고    scopus 로고
    • Satisfiability Models and Algorithms for Circuit Delay Computation
    • L. G. Silva J. P. Marques-Silva L. M. Silveira K. A. Sakallah Satisfiability Models and Algorithms for Circuit Delay Computation Workshop on Timing Issues in the Specification and Synthesis of Digital Systems Workshop on Timing Issues in the Specification and Synthesis of Digital Systems 1997-December
    • (1997)
    • Silva, L.G.1    Marques-Silva, J.P.2    Silveira, L.M.3    Sakallah, K.A.4
  • 37
    • 85177123294 scopus 로고    scopus 로고
    • Algorithms for Solving Boolean Satisfiability in Combinational Circuits
    • L. G. Silva L. Silveira J. Marques-Silva Algorithms for Solving Boolean Satisfiability in Combinational Circuits Proceedings of the Design and Test in Europe Conference Proceedings of the Design and Test in Europe Conference 1999-March
    • (1999)
    • Silva, L.G.1    Silveira, L.2    Marques-Silva, J.3
  • 39
    • 0031341194 scopus 로고    scopus 로고
    • A SAT-Based Implication Engine for Efficient ATPG, Equivalence Checking, and Optimization of Netlists
    • P. Tafertshofer A. Ganz M. Henftling A SAT-Based Implication Engine for Efficient ATPG, Equivalence Checking, and Optimization of Netlists Proc. of the Int'l Conf. on Computer-Aided Design 648 657 Proc. of the Int'l Conf. on Computer-Aided Design 1997-November
    • (1997) , pp. 648-657
    • Tafertshofer, P.1    Ganz, A.2    Henftling, M.3
  • 40
    • 85177114024 scopus 로고    scopus 로고
    • SAT Based ATPG Using Fast Justification and Propagation in the Implication Graph
    • P. Tafertshofer e A. Ganz SAT Based ATPG Using Fast Justification and Propagation in the Implication Graph Proceedings of the ACM/IEEE International Conference on Computer-Aided Design (ICCAD) Proceedings of the ACM/IEEE International Conference on Computer-Aided Design (ICCAD) 1999-November
    • (1999)
    • Tafertshofer e, P.1    Ganz, A.2
  • 41
    • 84893675417 scopus 로고
    • A Rearrangement Search Strategy for Determining Propositional Satisfiability
    • R. Zabih D. A. McAllester A Rearrangement Search Strategy for Determining Propositional Satisfiability Proceedings of the National Conference on Artificial Intelligence 155 160 Proceedings of the National Conference on Artificial Intelligence 1988
    • (1988) , pp. 155-160
    • Zabih, R.1    McAllester, D.A.2
  • 42
    • 85177111281 scopus 로고    scopus 로고
    • SATO: An Efficient Propositional Prover
    • H. Zhang SATO: An Efficient Propositional Prover Proceedings of International Conference on Automated Deduction Proceedings of International Conference on Automated Deduction 1997-July
    • (1997)
    • Zhang, H.1
  • 43
    • 0031624029 scopus 로고    scopus 로고
    • Using Reconfigurable Computing Techniques to Accelerate Problems in the CAD Domain: A Case Study with Boolean Satisfiability
    • P. Zhong P. Ashar S. Malik M. Martonosi Using Reconfigurable Computing Techniques to Accelerate Problems in the CAD Domain: A Case Study with Boolean Satisfiability Proceedings of the Design Automation Conference Proceedings of the Design Automation Conference 1998-June
    • (1998)
    • Zhong, P.1    Ashar, P.2    Malik, S.3    Martonosi, M.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.