Pareto Front Analog Layout Placement using Satisfiability Modulo Theories

被引:0
|
作者
Saif, Sherif M. [1 ]
Dessouky, Mohamed [2 ]
El-Kharashi, M. Watheq [3 ]
Abbas, Hazem [3 ]
Nassar, Salwa [1 ]
机构
[1] Elect Res Inst, Comp & Syst Dept, Giza, Egypt
[2] Mentor Graph Egypt, Cairo 11361, Egypt
[3] Ain Shams Univ, Comp & Syst Engn Dept, Cairo 11517, Egypt
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents an analog layout placement tool with emphasis on Pareto front generation. In order to handle the exploding number of analog physical constraints, a new approach based on the use of a Satisfiability Modulo Theories (SMT) solver is suggested. SMT is an area concerned with checking the satisfiability of logical formulas over one or more theories. SMT is usually well-tuned to solve specific problems. To our knowledge, this is the first effort to use SMT to tackle analog placement. The proposed tool implicitly generates multiple layouts that fulfill the given constraints. Therefore, it gives the user the option to choose from the feasible solutions through specifying an aspect ratio or by selecting the optimum solution from the Pareto front of the generated shape function. In contrast to most of the existing techniques, as the number of physical constraints increases the SMT solver processing time decreases. The proposed system yielded layouts with a competitive area and run time compared to other techniques.
引用
收藏
页码:1411 / 1416
页数:6
相关论文
共 50 条
  • [31] Satisfiability modulo theories for process systems engineering
    Mistry, Miten
    D'Iddio, Andrea Callia
    Huth, Michael
    Misener, Ruth
    COMPUTERS & CHEMICAL ENGINEERING, 2018, 113 : 98 - 114
  • [32] Model Learning as a Satisfiability Modulo Theories Problem
    Smetsers, Rick
    Fiterau-Brostean, Paul
    Vaandrager, Frits
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2018), 2018, 10792 : 182 - 194
  • [33] Efficient interpolant generation in Satisfiability Modulo Theories
    Cimatti, Alessandro
    Griggio, Alberto
    Sebastiani, Roberto
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, 2008, 4963 : 397 - +
  • [34] Beyond boolean SAT: Satisfiability Modulo Theories
    Cimatti, Alessandro
    WODES' 08: PROCEEDINGS OF THE 9TH INTERNATIONAL WORKSHOP ON DISCRETE EVENT SYSTEMS, 2008, : 68 - 73
  • [35] Grounding Neural Inference with Satisfiability Modulo Theories
    Wang, Zifan
    Vijayakumar, Saranya
    Lu, Kaiji
    Ganesh, Vijay
    Jha, Somesh
    Fredriskon, Matt
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [36] Tender System Verification with Satisfiability Modulo Theories
    Davila, Rene
    Aldeco-Perez, Rocio
    Barcenas, Everardo
    2021 9TH INTERNATIONAL CONFERENCE IN SOFTWARE ENGINEERING RESEARCH AND INNOVATION (CONISOFT 2021), 2021, : 69 - 78
  • [37] Stochastic Local Search for Satisfiability Modulo Theories
    Froehlich, Andreas
    Biere, Armin
    Wintersteiger, Christoph M.
    Hamadi, Youssef
    PROCEEDINGS OF THE TWENTY-NINTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2015, : 1136 - 1143
  • [38] Sets with Cardinality Constraints in Satisfiability Modulo Theories
    Suter, Philippe
    Steiger, Robin
    Kuncak, Viktor
    VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, 2011, 6538 : 403 - 418
  • [39] Proof Checking Technology for Satisfiability Modulo Theories
    Stump, Aaron
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 228 : 121 - 133
  • [40] Automating Elevator Design with Satisfiability Modulo Theories
    Demarchi, Stefano
    Menapace, Marco
    Tacchella, Armando
    2019 IEEE 31ST INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2019), 2019, : 26 - 33