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 条
  • [21] Solving quantified verification conditions using satisfiability modulo theories
    Ge, Yeting
    Barrett, Clark
    Tinelli, Cesare
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2009, 55 (1-2) : 101 - 122
  • [22] Solving quantified verification conditions using satisfiability modulo theories
    Yeting Ge
    Clark Barrett
    Cesare Tinelli
    Annals of Mathematics and Artificial Intelligence, 2009, 55 : 101 - 122
  • [23] Using Satisfiability Modulo Theories for Inductive Verification of Lustre Programs
    Franzen, Anders
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2006, 144 (01) : 19 - 33
  • [24] Using Incomplete Satisfiability Modulo Theories to Determine Robotic Tasks
    Witsch, Andreas
    Skubch, Hendrik
    Niemczyk, Stefan
    Geihs, Kurt
    2013 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2013, : 4784 - 4789
  • [25] Solving quantified verification conditions using satisfiability modulo theories
    Ge, Yeting
    Barrett, Clark
    Tinelli, Cesare
    AUTOMATED DEDUCTION - CADE-21, PROCEEDINGS, 2007, 4603 : 167 - +
  • [26] Automated Verification of Query Equivalence Using Satisfiability Modulo Theories
    Zhou, Qi
    Arulraj, Joy
    Navathe, Shamkant
    Harris, William
    Xu, Dong
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2019, 12 (11): : 1276 - 1288
  • [27] Using Satisfiability Modulo Theories to Analyze Abstract State Machines
    Veanes, Margus
    Saabas, Ando
    ABSTRACT STATE MACHINES, B AND Z, PROCEEDINGS, 2008, 5238 : 355 - 355
  • [28] Routability-Aware Placement for Advanced FinFET Mixed-Signal Circuits using Satisfiability Modulo Theories
    Chen, Hao
    Turner, Walker J.
    Pan, David Z.
    Ren, Haoxing
    PROCEEDINGS OF THE 2022 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE 2022), 2022, : 160 - 165
  • [29] A tutorial on satisfiability modulo theories - (Invited tutorial)
    de Moura, Leonardo
    Dutertre, Bruno
    Shankar, Natarajan
    COMPUTER AIDED VERIFICATION, PROCEEDINGS, 2007, 4590 : 20 - +
  • [30] Preface to special issue on satisfiability modulo theories
    Griggio, Alberto
    Rummer, Philipp
    FORMAL METHODS IN SYSTEM DESIGN, 2017, 51 (03) : 431 - 432