BryantFLoC22/program.html at master · BerkeleyLearnVerify/BryantFLoC22 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
<!DOCTYPE html>
<html>

<head>
  <meta http-equiv="Content-Type" content="text/html; charset=UTF-8">

  <script src="lib/jquery-3.js" integrity="sha256-FgpCb/KJQlLNfOu91ta32o/NMZxltwRo8QtmkMRdAu8="
    crossorigin="anonymous"></script>
  <script type="text/javascript" src="lib/jquery-ui.js"></script>

  <title>BDD@FLoC'22</title>
  <link href="lib/custom.css" rel="stylesheet">
  <link href="lib/jquery-ui.css" rel="stylesheet">
  <meta name="description" content="BDD@FLoC'22: Bryant Discoveries Day at FLoC 2022">

  <style>
    table {
      /* font-family: arial, sans-serif; */
      border-collapse: collapse;
      width: 100%;
    }

    td, th {
      /* border: 1px solid #dddddd; */
      text-align: left;
      padding: 8px;
    }

    tr:nth-child(even) {
      background-color: #dddddd;
    }
    </style>

</head>

<body>

  <div class="header padded bottom-border" style="clear:right">

    <div class="clearfix">


      <div class="pull-left">
        <a href="./index.html" class="nounderline">
          <div class="padding-top">BDD@FLoC'22: Bryant Discoveries Day at FLoC 2022</div>
        </a>
      </div>


      <div class="pull-right">


        <div class="navbar-wrapper">

          <div class="padding-top">
            <div>

              <a href="./index.html"><span class="navbarlink">Home</span></a>

              <a href="./registration.html"><span class="navbarlink">Registration</span></a>

              <a href="./program.html"><span class="navbarlink">Program</span></a>

              <a href="./speakers.html"><span class="navbarlink">Speakers</span></a>

            </div>
          </div>
        </div>
      </div>


    </div>

  </div>

  <div id="main">
    <div class="content">


      <p class="centered padded">

      </p>
      <div class="centered">
        <div class="big"><span class="extra-big">BDD</span>@FLoC'22</div>
        <div style="margin-top: -0.05em"><span style="width: 65%; display: inline-block; font-size: larger;">Bryant Discoveries Day@FLoC'22: Celebrating the Career and Professional Achievements of Prof. Randal E. Bryant</span></div>
        <div style="margin-top: 0.5em;">
          <span><a href="http://satisfiability.org/SAT22/">SAT '22</a> Part of <a href="https://www.floc2022.org/">FLoC '22</a></span>
          <span class="left-padding">Haifa, Israel</span>
          <span class="left-padding">August 5, 2022</span>
          <div class="centered">
            <table class="centered inlineblock">

            </table>
          </div>
        </div>
      </div>
      <br>
      <div class="centered">
        <iframe width="560" height="315" src="https://www.youtube.com/embed/AACIY50Ack8" title="YouTube video player" frameborder="0" allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share" allowfullscreen></iframe>
      </div>
      <br><br>
      <table>
        <colgroup>
          <col span="1">
          <col span="1">
          <col span="1" style="width: 60%;">
       </colgroup>
        <tr>
          <th>Time</th>
          <th>Speaker</th>
          <th>Talk Title (Expand for Abstract)</th>
        </tr>
        <tr>
          <td>9:05-9:10</td>
          <td>Robert Brayton</td>
          <td></td>
        </tr>
        <tr>
          <td>9:10-9:15</td>
          <td>Fabio Somenzi</td>
          <td></td>
        </tr>
        <tr>
          <td>9:15-9:25</td>
          <td>Ken McMillan</td>
          <td>
            <details>
              <summary>The Magic of BDD's</summary>
              <p>I'll talk about when BDD's are better than SAT, and discuss several attempts to improve on BDD's for symbolic model checking that met with limited success.</p>
            </details>
          </td>
        </tr>
        <tr>
          <td>9:25-9:35</td>
          <td>Shin-Ichi Minato</td>
          <td>
            <details>
              <summary>BDDs and ZDDs: My Memories on the Shoulders of Giants</summary>
              <p>I will talk about my memories related to BDDs and ZDDs, starting from my first meeting with Randy.</p>
            </details>
          </td>
        </tr>
        <tr>
          <td>9:35-9:40</td>
          <td>Sharad Malik</td>
          <td>
            <details>
              <summary>Practice-driven Foundational Research in Verification: The Randy Bryant Legacy</summary>
              <p>Randy's style of practice-driven foundational research has inspired me through my career---I will share several cases of this starting with when I was a graduate student to later work on SAT solvers.</p>
            </details>
          </td>
        </tr>
        <tr>
          <td>9:40-9:45</td>
          <td>Carl Seger</td>
          <td>
            <details>
              <summary>Working with Randy as a postdoc 1988-1990 -- or -- The Birth of STE</summary>
              <p>A brief retrospective of my experiences working with Randy with a particular focus on the birth of Symbolic Trajectory Evaluation.</p>
            </details>
          </td>
        </tr>
        <tr>
          <td>9:45-9:55</td>
          <td>Moshe Vardi</td>
          <td>
            <details>
              <summary>The Knowledge-Compilation Revolution</summary>
              <p>In this short presentation I will describe how Bryant's classical 1986 paper has launched the knowledge-compilation revolution.</p>
            </details>
          </td>
        </tr>
        <tr>
          <td>9:55-10:05</td>
          <td>Willem-Jan van Hoeve</td>
          <td>
            <details>
              <summary>Decision Diagrams for Discrete Optimization</summary>
              <p>I will describe how decision diagrams can form the basis of a generic branch-and-bound method for discrete optimization.  Using a state-based input model (e.g., a dynamic program), the method employs relaxed and restricted BDDs to provide optimization bounds.  I will compare this approach to classical optimization methods such as integer programming and constraint programming.</p>
            </details>
          </td>
        </tr>
        <tr>
          <td>10:05-10:15</td>
          <td>Aarti Gupta</td>
          <td>
            <details>
              <summary>BDD (R)evolution: Extending Across Generations</summary>
              <p>Bryant's BDDs have had a tremendous impact in formal verification. In this talk, I will briefly describe how they have influenced my research across three decades in different domains of application, including our latest effort in verification of distributed systems.</p>
            </details>
          </td>
        </tr>
        <tr>
          <td>10:15-10:25</td>
          <td>Nikolaj Bjorner</td>
          <td>
            <details>
              <summary>BDDs in Z3 and Network Verification</summary>
              <p>The talk describes how z3 has used BDDs and ZDDs for solving EPR formulas, quantifier elimination, and manipulating polynomials. It also describes a journey in network verification tools using BDDs and related trie data-structures.</p>
            </details>
          </td>
        </tr>
        <tr>
          <td>10:25-10:30</td>
          <td>Shuvendu Lahiri</td>
          <td></td>
        </tr>
        <tr>
          <td>11:00-11:10</td>
          <td>David Dill</td>
          <td>
            <details>
              <summary>Some reminiscences about Randy at Carnegie Mellon 1983-1987</summary>
              <p>I was a graduate student at Carnegie Mellon when Randy arrive circa 1983. Both he and his work had a profound effect on my graduate experience and later career.</p>
            </details>
          </td>
        </tr>
        <tr>
          <td>11:10-11:15</td>
          <td>Sanjit Seshia</td>
          <td>
            <details>
              <summary>Machine Learning and BDDs</summary>
              <p>I will relate a few anecdotes about explorations at the intersection of machine learning, BDDs, and satisfiability solvers over the last 25 years.</p>
            </details>
          </td>
        </tr>
        <tr>
          <td>11:15-11:30</td>
          <td>Randy Bryant</td>
          <td>
            <details>
              <summary>Our Tools Should Generate Checkable Proofs</summary>
              <p>For over four decades, I have helped develop tools that enable designers to create correct hardware and software systems. Some of these tools even claimed to provide formal guarantees of correctness. But they had a fundamental flaw—an error in an underlying algorithm or its implementation could cause the tool to produce an incorrect result. The prospects for developing efficient and scalable tools that are themselves formally verified seem unlikely. On the other hand, having tools produce checkable proofs of correctness yields nearly the same benefit. Even if the tool is buggy, each of its run can be formally verified. The SAT community instituted a requirement that solvers (at least those in the main track of the SAT competition) generate checkable proofs of unsatisfiability. This requirement has had a transformative effect on the quality of the solvers, the productivity of the developers, and the certainty of the competition results. We can learn from their experience in instituting this practice for other areas of automated reasoning.</p>
            </details>
          </td>
        </tr>
      </table>


      <div style="clear:both"></div>


      <div class="footer">
        Thank you to <a href="https://schasins.com/">Sarah Chasins</a> for the website template.
        Webmaster: <a href="https://federico.morarocha.ca/">Federico Mora</a>.
      </div>
    </div>


  </div>
</body>

</html>