Search Results - "2022 Formal Methods in Computer-Aided Design (FMCAD)"

Proving Robustness of KNN Against Adversarial Data Poisoning by Li, Yannan, Wang, Jingbo, Wang, Chao

“…We propose a method for verifying data-poisoning robustness of the k-nearest neighbors (KNN) algorithm, which is a widely-used supervised learning technique…”
Get full text

Reactive Synthesis Modulo Theories using Abstraction Refinement by Maderbacher, Benedikt, Bloem, Roderick

“…Reactive synthesis builds a system from a specification given as a temporal logic formula. Traditionally, reactive synthesis is defined for systems with…”
Get full text

Neural Network Verification with Proof Production by Isac, Omri, Barrett, Clark, Zhang, Min, Katz, Guy

“…Deep neural networks (DNNs) are increasingly being employed in safety-critical systems, and there is an urgent need to guarantee their correctness…”
Get full text

Verification-Aided Deep Ensemble Selection by Amir, Guy, Zelazny, Tom, Katz, Guy, Schapira, Michael

“…Deep neural networks (DNNs) have become the technology of choice for realizing a variety of complex tasks. However, as highlighted by many recent studies, even…”
Get full text

Plain and Simple Inductive Invariant Inference for Distributed Protocols in TLA+ by Schultz, William, Dardik, Ian, Tripakis, Stavros

“…We present a new technique for automatically inferring inductive invariants of parameterized distributed protocols specified in TLA + . Ours is the first such…”
Get full text

Synthesis of Semantic Actions in Attribute Grammars by Kalita, Pankaj Kumar, Kumar, Miriyala Jeevan, Roy, Subhajit

“…Attribute grammars allow the association of semantic actions to the production rules in context-free grammars, providing a simple yet effective formalism to…”
Get full text

Small Proofs from Congruence Closure by Flatt, Oliver, Coward, Samuel, Willsey, Max, Tatlock, Zachary, Panchekha, Pavel

“…Satisfiability Modulo Theory (SMT) solvers and equality saturation engines must generate proof certificates from e-graph-based congruence closure procedures to…”
Get full text

Split Transition Power Abstraction for Unbounded Safety by Blicha, Martin, Fedyukovich, Grigory, Hyvarinen, Antti E. J., Sharygina, Natasha

“…Transition Power Abstraction (TPA) is a recent symbolic model checking approach that leverages Craig interpolation to create a sequence of symbolic…”
Get full text

Reconstructing Fine-Grained Proofs of Rewrites Using a Domain-Specific Language by Notzli, Andres, Barbosa, Haniel, Niemetz, Aina, Preiner, Mathias, Reynolds, Andrew, Barrett, Clark, Tinelli, Cesare

“…Satisfiability modulo theories (SMT) solvers are widely used to prove security and safety properties of computer systems. For these applications, it is crucial…”
Get full text

Automated Conversion of Axiomatic to Operational Models: Theory and Practice by Godbole, Adwait, Manerkar, Yatin A., Seshia, Sanjit A.

“…A system may be modelled as an operational model (which has explicit notions of state and transitions between states) or an axiomatic model (which is specified…”
Get full text

BaxMC: a CEGAR approach to Max#SAT by Vigouroux, Thomas, Ene, Cristian, Monniaux, David, Mounier, Laurent, Potet, Marie-Laure

“…Max#SATis an important problem with multiple applications in security and program synthesis that is proven hard to solve. It is defined as: given a…”
Get full text

Stratified Certification for k-Induction by Yu, Emily, Froleyks, Nils, Biere, Armin, Heljanko, Keijo

“…Our recently proposed certification framework for bit-level k : -induction-based model checking has been shown to be quite effective in increasing the trust of…”
Get full text

Tbuddy: A Proof-Generating BDD Package by Bryant, Randal E.

“…The TBUDDY library enables the construction and manipulation of reduced, ordered binary decision diagrams (BDDs). It extends the capabilities of the BUDDY BDD…”
Get full text

INC: A Scalable Incremental Weighted Sampler by Yang, Suwei, Liang, Victor, Meel, Kuldeep S.

“…The fundamental problem of weighted sampling involves sampling of satisfying assignments of Boolean formulas, which specify sampling sets, and according to…”
Get full text

Proof-Stitch: Proof Combination for Divide-and-Conquer SAT Solvers by Nair, Abhishek, Chattopadhyay, Saranyu, Wu, Haoze, Ozdemir, Alex, Barrett, Clark

“…With the increasing availability of parallel computing power, there is a growing focus on parallelizing algorithms for important automated reasoning problems…”
Get full text

Automating Geometric Proofs of Collision Avoidance with Active Corners by Kheterpal, Nishant, Tang, Elanor, Jeannin, Jean-Baptiste

“…Avoiding collisions between obstacles and vehicles such as cars, robots, or aircraft is essential to the development of autonomy. To simplify the problem, many…”
Get full text

Awaiting for Godot: Stateless Model Checking that Avoids Executions where Nothing Happens by Jonsson, Bengt, Lang, Magnus, Sagonas, Konstantinos

“…Stateless Model Checking (SMC) is a verification technique for concurrent programs that checks for safety violations by exploring all possible thread…”
Get full text

Bounded Model Checking for LLVM by Priya, Siddharth, Su, Yusen, Bao, Yuyan, Zhou, Xiang, Vizel, Yakir, Gurfinkel, Arie

“…Bounded Model Checking (BMC) is an effective and precise static analysis technique that reduces program verification to satisfiability (SAT) solving. In this…”
Get full text

Compact Symmetry Breaking for Tournaments by Lohn, Evan, Lambert, Chris, Heule, Marijn J.H.

“…Isolators are a useful tool for reducing the computation needed to solve graph existence problems via SAT. We extend techniques for creating isolators for…”
Get full text

On Optimizing Back-Substitution Methods for Neural Network Verification by Zelazny, Tom, Wu, Haoze, Barrett, Clark, Katz, Guy

“…With the increasing application of deep learning in mission-critical systems, there is a growing need to obtain formal guarantees about the behaviors of neural…”
Get full text