solving bitvectors with mcsat explanations from bits and
play

Solving bitvectors with MCSAT: explanations from bits and pieces - PowerPoint PPT Presentation

Jan 09, 2023 •270 likes •1.27k views

Solving bitvectors with MCSAT: explanations from bits and pieces Stphane Graham-Lengrand, Dejan Jovanovi, Bruno Dutertre SRI International IJCAR, July 2020 1/32 tl;dl (Too Long; Didnt Listen) MCSAT (Model-Constructing

  1. Solving bitvectors with MCSAT: explanations from bits and pieces Stéphane Graham-Lengrand, Dejan Jovanović, Bruno Dutertre SRI International IJCAR, July 2020 1/32

  2. tl;dl (Too Long; Didn’t Listen) ◮ MCSAT (Model-Constructing Satisfiability) is a scheme for SMT-solving (Satisfiability-Modulo-Theories), alternative to DPLL( T ). ◮ To apply the scheme to a particular theory T , you need a form of interpolation mechanism for T . ◮ Designing an efficient mechanism for the full theory of bitvectors is difficult. So we do it for 2 fragments of the theory: ◮ Equality + concatenation and extraction of bitvectors ◮ A fragment of bitvector arithmetic Outside these fragments we use a less efficient, but generic, procedure. ◮ The approach is implemented in SRI’s SMT-solver Yices. ◮ We experimented it on the SMTLib benchmarks. 2/32

  3. Overview of MCSAT The bitvector theory in MCSAT Experimentation on the SMTLib benchmarks Conclusion 3/32

  4. 1. Overview of MCSAT 4/32

  5. The model-constructing approach to SMT-solving 1/2 MCSAT introduced in [dMJ13, JBdM13, Jov17], inspired by multiple contributions including Conflict Resolution [KTV09] and specific decision procedures for theories such as non-linear arithmetic [JdM12]. 5/32

  6. The model-constructing approach to SMT-solving 1/2 MCSAT introduced in [dMJ13, JBdM13, Jov17], inspired by multiple contributions including Conflict Resolution [KTV09] and specific decision procedures for theories such as non-linear arithmetic [JdM12]. MCSAT tailored to theories with a standard model used for evaluating constraints (example: arithmetic) Evaluation is a key aspect of MCSAT 5/32

  7. The model-constructing approach to SMT-solving 1/2 MCSAT introduced in [dMJ13, JBdM13, Jov17], inspired by multiple contributions including Conflict Resolution [KTV09] and specific decision procedures for theories such as non-linear arithmetic [JdM12]. MCSAT tailored to theories with a standard model used for evaluating constraints (example: arithmetic) Evaluation is a key aspect of MCSAT Solving satisfiability problem (set of constraints on variables x 1 , . . . , x n ) = finding values for variables x 1 , . . . , x n (so that constraints evaluate to true) 5/32

  8. The model-constructing approach to SMT-solving 1/2 MCSAT introduced in [dMJ13, JBdM13, Jov17], inspired by multiple contributions including Conflict Resolution [KTV09] and specific decision procedures for theories such as non-linear arithmetic [JdM12]. MCSAT tailored to theories with a standard model used for evaluating constraints (example: arithmetic) Evaluation is a key aspect of MCSAT Solving satisfiability problem (set of constraints on variables x 1 , . . . , x n ) = finding values for variables x 1 , . . . , x n (so that constraints evaluate to true) MCSAT offers: ◮ a template for decision procedures ◮ an integration of such procedures with Boolean reasoning ◮ new possibilities for combining theories [JBdM13, BGLS19] 5/32

  9. The model-constructing approach to SMT-solving 1/2 MCSAT introduced in [dMJ13, JBdM13, Jov17], inspired by multiple contributions including Conflict Resolution [KTV09] and specific decision procedures for theories such as non-linear arithmetic [JdM12]. MCSAT tailored to theories with a standard model used for evaluating constraints (example: arithmetic) Evaluation is a key aspect of MCSAT Solving satisfiability problem (set of constraints on variables x 1 , . . . , x n ) = finding values for variables x 1 , . . . , x n (so that constraints evaluate to true) MCSAT offers: ◮ a template for decision procedures ◮ an integration of such procedures with Boolean reasoning ◮ new possibilities for combining theories [JBdM13, BGLS19] The template is a generalisation of how CDCL works, the core calculus of SAT-solvers. Run = alternation of search phases and conflict analysis phases 5/32

  10. The model-constructing approach to SMT-solving 2/2 ◮ Like CDCL’s trail assigns Boolean values to Boolean variables, MCSAT’s trail assigns ◮ Boolean values to theory atoms; these constitute theory contraints ◮ model values to first-order variables (e.g., x ← 3 / 4) 6/32

  11. The model-constructing approach to SMT-solving 2/2 ◮ Like CDCL’s trail assigns Boolean values to Boolean variables, MCSAT’s trail assigns ◮ Boolean values to theory atoms; these constitute theory contraints ◮ model values to first-order variables (e.g., x ← 3 / 4) ◮ As in CDCL, MCSAT successively guesses assignments. . . . . . while maintaining the invariant that no constraint evaluates to false according to the assignments ; 6/32

  12. The model-constructing approach to SMT-solving 2/2 ◮ Like CDCL’s trail assigns Boolean values to Boolean variables, MCSAT’s trail assigns ◮ Boolean values to theory atoms; these constitute theory contraints ◮ model values to first-order variables (e.g., x ← 3 / 4) ◮ As in CDCL, MCSAT successively guesses assignments. . . . . . while maintaining the invariant that no constraint evaluates to false according to the assignments ; ◮ To pick a value for variable y after x 1 , . . . , x n were assigned values v 1 , . . . , v n , simply worry about constraints over variables x 1 , . . . , x n , y (i.e. constraints that have become unit in y ) 6/32

  13. The model-constructing approach to SMT-solving 2/2 ◮ Like CDCL’s trail assigns Boolean values to Boolean variables, MCSAT’s trail assigns ◮ Boolean values to theory atoms; these constitute theory contraints ◮ model values to first-order variables (e.g., x ← 3 / 4) ◮ As in CDCL, MCSAT successively guesses assignments. . . . . . while maintaining the invariant that no constraint evaluates to false according to the assignments ; ◮ To pick a value for variable y after x 1 , . . . , x n were assigned values v 1 , . . . , v n , simply worry about constraints over variables x 1 , . . . , x n , y (i.e. constraints that have become unit in y ) ◮ If all variables get values while maintaining invariant: SAT . illustration on the next slide. 6/32

  14. Search phase (satisfiable case) Free var within Constraints (unit ones in red) Feasible set Var C 1 1 , . . . , C 1 { x 1 } j , . . . x 1 C 2 1 , C 2 2 , . . . , C 2 { x 1 , x 2 } j , . . . x 2 C 3 1 , C 3 2 , . . . , C 3 { x 1 , x 2 , x 3 } j , . . . x 3 . . . C i 1 , C i 2 , . . . , C i 42 , . . . , C i { x 1 , . . . , x i } j , . . . x i 7/32

  15. Search phase (satisfiable case) Free var within Constraints (unit ones in red) Feasible set Var C 1 1 , . . . , C 1 { x 1 } j , . . . x 1 C 2 1 , C 2 2 , . . . , C 2 { x 1 , x 2 } j , . . . x 2 C 3 1 , C 3 2 , . . . , C 3 { x 1 , x 2 , x 3 } j , . . . x 3 . . . C i 1 , C i 2 , . . . , C i 42 , . . . , C i { x 1 , . . . , x i } j , . . . x i 7/32

  16. Search phase (satisfiable case) Free var within Constraints (unit ones in red) Feasible set Var C 1 1 , . . . , C 1 { x 1 } j , . . . x 1 C 2 1 , C 2 2 , . . . , C 2 { x 1 , x 2 } j , . . . x 2 C 3 1 , C 3 2 , . . . , C 3 { x 1 , x 2 , x 3 } j , . . . x 3 . . . C i 1 , C i 2 , . . . , C i 42 , . . . , C i { x 1 , . . . , x i } j , . . . x i 7/32

  17. Search phase (satisfiable case) Free var within Constraints (unit ones in red) Feasible set Var C 1 1 , . . . , C 1 { x 1 } j , . . . x 1 C 2 1 , C 2 2 , . . . , C 2 { x 1 , x 2 } j , . . . x 2 C 3 1 , C 3 2 , . . . , C 3 { x 1 , x 2 , x 3 } j , . . . x 3 . . . C i 1 , C i 2 , . . . , C i 42 , . . . , C i { x 1 , . . . , x i } j , . . . x i 7/32

  18. Search phase (satisfiable case) Free var within Constraints (unit ones in red) Feasible set Var C 1 1 , . . . , C 1 { x 1 } j , . . . x 1 C 2 1 , C 2 2 , . . . , C 2 { x 1 , x 2 } j , . . . x 2 C 3 1 , C 3 2 , . . . , C 3 { x 1 , x 2 , x 3 } j , . . . x 3 . . . C i 1 , C i 2 , . . . , C i 42 , . . . , C i { x 1 , . . . , x i } j , . . . x i 7/32

  19. Search phase (satisfiable case) Free var within Constraints (unit ones in red) Feasible set Var C 1 1 , . . . , C 1 { x 1 } j , . . . x 1 C 2 1 , C 2 2 , . . . , C 2 { x 1 , x 2 } j , . . . x 2 C 3 1 , C 3 2 , . . . , C 3 { x 1 , x 2 , x 3 } j , . . . x 3 . . . C i 1 , C i 2 , . . . , C i 42 , . . . , C i { x 1 , . . . , x i } j , . . . x i SAT 7/32

  20. Search phase (conflict case) Free var within Constraints (unit ones in red) Feasible set Var C 1 1 , . . . , C 1 { x 1 } j , . . . x 1 C 2 1 , C 2 2 , . . . , C 2 { x 1 , x 2 } j , . . . x 2 C 3 1 , C 3 2 , . . . , C 3 { x 1 , x 2 , x 3 } j , . . . x 3 . . . C i 1 , C i 2 , . . . , C i 42 , . . . , C i { x 1 , . . . , x i } j , . . . x i 7/32

  21. Search phase (conflict case) Free var within Constraints (unit ones in red) Feasible set Var C 1 1 , . . . , C 1 { x 1 } j , . . . x 1 C 2 1 , C 2 2 , . . . , C 2 { x 1 , x 2 } j , . . . x 2 C 3 1 , C 3 2 , . . . , C 3 { x 1 , x 2 , x 3 } j , . . . x 3 . . . C i 1 , C i 2 , . . . , C i 42 , . . . , C i { x 1 , . . . , x i } j , . . . x i 7/32

  22. Search phase (conflict case) Free var within Constraints (unit ones in red) Feasible set Var C 1 1 , . . . , C 1 { x 1 } j , . . . x 1 C 2 1 , C 2 2 , . . . , C 2 { x 1 , x 2 } j , . . . x 2 C 3 1 , C 3 2 , . . . , C 3 { x 1 , x 2 , x 3 } j , . . . x 3 . . . C i 1 , C i 2 , . . . , C i 42 , . . . , C i { x 1 , . . . , x i } j , . . . x i 7/32

  23. Search phase (conflict case) Free var within Constraints (unit ones in red) Feasible set Var C 1 1 , . . . , C 1 { x 1 } j , . . . x 1 C 2 1 , C 2 2 , . . . , C 2 { x 1 , x 2 } j , . . . x 2 C 3 1 , C 3 2 , . . . , C 3 { x 1 , x 2 , x 3 } j , . . . x 3 . . . C i 1 , C i 2 , . . . , C i 42 , . . . , C i { x 1 , . . . , x i } j , . . . x i 7/32

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

An MCSAT treatment of Bit-Vectors (work-in-progress) Stphane Graham-Lengrand and Dejan

An MCSAT treatment of Bit-Vectors (work-in-progress) Stphane Graham-Lengrand and Dejan

An MCSAT treatment of Bit-Vectors (work-in-progress) Stphane Graham-Lengrand and Dejan Jovanovi CNRS - SRI International SMT workshop, 23rd July 2017 1/19 The model-constructing approach to SMT-solving MCSAT introduced in [dMJ13, JBdM13,

996 views • 80 slides
MIPS Instruction Formats 6 bits 5 bits 5 bits 5 bits 5 bits 6 bits for instance,

MIPS Instruction Formats 6 bits 5 bits 5 bits 5 bits 5 bits 6 bits for instance,

MIPS Instruction Formats 6 bits 5 bits 5 bits 5 bits 5 bits 6 bits for instance, add r1, r2, r3 has - 000000 00010 00011 00001 00000 100000 opcode (OP) tells the machine which format 1 VAX Instruction Formats (x86

431 views • 20 slides
FINITE DOMAIN Constraint / Bits PROBLEM SOLVING relation lost Large CNF Problem

FINITE DOMAIN Constraint / Bits PROBLEM SOLVING relation lost Large CNF Problem

FINITE DOMAIN Constraint / Bits PROBLEM SOLVING relation lost Large CNF Problem Constraint Model Encoding CNF (hard) Model CSP solving SAT solving Direct Model Satisfied Solution Decoding Translate Solution assignment

218 views • 20 slides
1 Transducers Inherently Discrete values devices that convert from one representation to

1 Transducers Inherently Discrete values devices that convert from one representation to

Interpretation of bits depends on context meaning of a group of bits depends on how they are interpreted 1 byte could be Bits, Bytes, 1 bit in use, 7 wasted bits (e.g., M/F in a database) 8 bits storing a number between 0 and 255

543 views • 3 slides
Proofs Bits of Wisdom on Solving Problems, Writing Proofs, and Enjoying the Process: How to

Proofs Bits of Wisdom on Solving Problems, Writing Proofs, and Enjoying the Process: How to

15-251: Great Theoretical Ideas in Computer Science Fall 2016 Lecture 1.5 August 31, 2016 Proofs Bits of Wisdom on Solving Problems, Writing Proofs, and Enjoying the Process: How to Succeed in This Class No specific topic covered

857 views • 61 slides
Bits and Bytes Topics Topics Why bits? Representing information as bits

Bits and Bytes Topics Topics Why bits? Representing information as bits

Systems I Bits and Bytes Topics Topics Why bits? Representing information as bits Binary/Hexadecimal Byte representations numbers characters and strings Instructions Bit-level manipulations Boolean algebra

614 views • 33 slides
Bits and Bytes Aug. 29, 2002 Topics Topics n Why bits? n Representing information as bits l

Bits and Bytes Aug. 29, 2002 Topics Topics n Why bits? n Representing information as bits l

15-213 The Class That Gives CMU Its Zip! Bits and Bytes Aug. 29, 2002 Topics Topics n Why bits? n Representing information as bits l Binary/Hexadecimal l Byte representations numbers characters and strings Instructions n

690 views • 34 slides
Deciding Bit-Vector Formulas with mcSAT Aleksandar Zelji c Uppsala University Philipp R

Deciding Bit-Vector Formulas with mcSAT Aleksandar Zelji c Uppsala University Philipp R

Deciding Bit-Vector Formulas with mcSAT Aleksandar Zelji c Uppsala University Philipp R ummer Christoph Wintersteiger Uppsala University Microsoft Research SMT Workshop July 1 st , 2016 We present... A novel decision procedure for the

821 views • 39 slides
Motivation The big picture: CDCL, arithmetic, MCSAT The CDSAT approach Discussion Maria Paola

Motivation The big picture: CDCL, arithmetic, MCSAT The CDSAT approach Discussion Maria Paola

Outline Motivation The big picture: CDCL, arithmetic, MCSAT The CDSAT approach Discussion Conflict-driven reasoning 1 Maria Paola Bonacina Dipartimento di Informatica, Universit` a degli Studi di Verona, Verona, Italy, EU Invited talk 24th

876 views • 51 slides
C/C++ review bits & bytes Same bits, different interpretation What is the value of

C/C++ review bits & bytes Same bits, different interpretation What is the value of

CSC209 Fall 2001 C/C++ review bits & bytes Same bits, different interpretation What is the value of 11111111 ? it depends on the type (unsigned) char 1 byte = 8 bits, (unsigned) Unsigned: 255 short int 2 bytes =

255 views • 12 slides
2 4 0 = 2 x 10 2 + 4 x 10 1 + 0 x 10 0 100 10 1 weight Representing Data with Bits 10 2 10 1

2 4 0 = 2 x 10 2 + 4 x 10 1 + 0 x 10 0 100 10 1 weight Representing Data with Bits 10 2 10 1

Wellesley CS 240 - Data as Bits 8/31/16 positional number representation 2 4 0 = 2 x 10 2 + 4 x 10 1 + 0 x 10 0 100 10 1 weight Representing Data with Bits 10 2 10 1 10 0 position 2 1 0 Base determines: bits, bytes, numbers, and

556 views • 6 slides
1 2-bits, 4-bits, 6-bits, a dollar The ripple carry adder o We have a 1-bit ALU that performs

1 2-bits, 4-bits, 6-bits, a dollar The ripple carry adder o We have a 1-bit ALU that performs

Starting out slow The CPU s workhorse o Logical operations are easiest, because they map Constructing a basic ALU directly onto the hardware. o Of course we will need to CS240 Computer Organization array this to a full 32- Department of

161 views • 4 slides
PDC drill bits www.napescogroup.com www.mes-uae.com Repair of PDC drill bits EGYPTIAN PROJECT

PDC drill bits www.napescogroup.com www.mes-uae.com Repair of PDC drill bits EGYPTIAN PROJECT

We do - you succeed! Repair of PDC drill bits www.napescogroup.com www.mes-uae.com Repair of PDC drill bits EGYPTIAN PROJECT Who we are Napesco Egypt and Middle East Supplies Dubai started a cooperation to repair PDC bits. Both companies

154 views • 11 slides
Explanations in Constraint Programming Barry OSullivan Cork Constraint Computation Centre

Explanations in Constraint Programming Barry OSullivan Cork Constraint Computation Centre

Introduction Generating Minimal Conflicts Representative Explanations Automated Reformulation for Explanation Application: Telecoms Feature Subscription Explanations in Constraint Programming Barry OSullivan Cork Constraint Computation

849 views • 71 slides
Bytes, bits, etc., R. Inkulu http://www.iitg.ac.in/rinkulu/ (Bytes, bits, etc.,) 1 / 25

Bytes, bits, etc., R. Inkulu http://www.iitg.ac.in/rinkulu/ (Bytes, bits, etc.,) 1 / 25

Bytes, bits, etc., R. Inkulu http://www.iitg.ac.in/rinkulu/ (Bytes, bits, etc.,) 1 / 25 Outline 1 Self-alignment 2 Bitwise operators 3 Bit-fields 4 Endianness (Bytes, bits, etc.,) 2 / 25 Self-alignment of primitive types int i; short s;

594 views • 25 slides
A User Study on the Effect of Aggregating Explanations for Interpreting Machine Learning Models

A User Study on the Effect of Aggregating Explanations for Interpreting Machine Learning Models

A User Study on the Effect of Aggregating Explanations for Interpreting Machine Learning Models [work in progress] Josua Krause* , Adam Perer**, Enrico Bertini* Mon, August 20th 2018 * ** Instance Explanations "Why Should I Trust

525 views • 36 slides
Optimality Conditions Fabio Schoen 2008 http://gol.dsi.unifi.it/users/schoen Optimality

Optimality Conditions Fabio Schoen 2008 http://gol.dsi.unifi.it/users/schoen Optimality

Optimality Conditions Fabio Schoen 2008 http://gol.dsi.unifi.it/users/schoen Optimality Conditions p. Optimality Conditions: descent directions Let S R n be a convex set and consider the problem min x S f ( x ) where f : S R .

1.23k views • 80 slides
CSCI 1951-G Optimization Methods in Finance Part 09: Interior Point Methods March 23, 2018

CSCI 1951-G Optimization Methods in Finance Part 09: Interior Point Methods March 23, 2018

CSCI 1951-G Optimization Methods in Finance Part 09: Interior Point Methods March 23, 2018 1 / 35 This material is covered in S. Boyd, L. Vandenberges book Convex Optimization https://web.stanford.edu/~boyd/cvxbook/ . Some of the

498 views • 35 slides
Mixed-Integer Nonlinear Programming Ksenia Bestuzheva Zuse Institute Berlin CO@Work 2020

Mixed-Integer Nonlinear Programming Ksenia Bestuzheva Zuse Institute Berlin CO@Work 2020

Introduction Finding Feasible Solutions Proving Optimality Strategy MINLP in SCIP Practical Topics Mixed-Integer Nonlinear Programming Ksenia Bestuzheva Zuse Institute Berlin CO@Work 2020 September 17, 2020 Introduction Finding Feasible

951 views • 58 slides
Exploiting sparsity in model matrices Douglas Bates and Martin Maechler Department of Statistics

Exploiting sparsity in model matrices Douglas Bates and Martin Maechler Department of Statistics

Exploiting sparsity in model matrices Douglas Bates and Martin Maechler Department of Statistics University of Wisconsin Madison U.S.A. Seminar f ur Statistik ETH Zurich Switzerland (bates|maechler)@R-project.org (R-Core) DSC2009,

1.08k views • 51 slides
Constrained optimization Problem in standard form minimize f ( x ) subject to a i ( x ) = 0, for i

Constrained optimization Problem in standard form minimize f ( x ) subject to a i ( x ) = 0, for i

Constrained optimization Problem in standard form minimize f ( x ) subject to a i ( x ) = 0, for i = 1 , 2 , p c j ( x ) 0 for j = 1 , 2 , , q a i : R n R c j : R n R f : R n R f ( x ) = , if problem is

492 views • 24 slides
More Realistic Power Grid Verification Based on Hierarchical Current and Power constraints 2

More Realistic Power Grid Verification Based on Hierarchical Current and Power constraints 2

More Realistic Power Grid Verification Based on Hierarchical Current and Power constraints 2 Chung-Kuan Cheng, 2 Peng Du, 2 Andrew B. Kahng, 1 Grantham K. H. Pang, 1 Yuanzhe Wang, 1 Ngai Wong Grantham K. H. Pang, Yuanzhe Wang, Ngai Wong 1.

489 views • 30 slides
E ffi cient Bregman Projections Onto the Simplex Walid Krichene Syrine Krichene Alexandre Bayen

E ffi cient Bregman Projections Onto the Simplex Walid Krichene Syrine Krichene Alexandre Bayen

Introduction Projection Algorithms Numerical experiments E ffi cient Bregman Projections Onto the Simplex Walid Krichene Syrine Krichene Alexandre Bayen Electrical Engineering and Computer Sciences, UC Berkeley ENSIMAG and Criteo Labs, France

577 views • 38 slides
Network Flow IV - Given information about flights that an airline needs to Applications II

Network Flow IV - Given information about flights that an airline needs to Applications II

CS 573: Algorithms, Fall 2014 Airline Scheduling Problem Network Flow IV - Given information about flights that an airline needs to Applications II provide, generate a profitable schedule. 1. Input: detailed information about legs of

252 views • 13 slides

More recommend