Formal methods: Practice and experience

J Woodcock, PG Larsen, J Bicarregui… - ACM computing surveys …, 2009 - dl.acm.org
Formal methods use mathematical models for analysis and verification at any part of the
program life-cycle. We describe the state of the art in the industrial use of formal methods …

Software model checking

R Jhala, R Majumdar - ACM Computing Surveys (CSUR), 2009 - dl.acm.org
Software model checking Page 1 21 Software Model Checking RANJIT JHALA University of
California, San Diego and RUPAK MAJUMDAR University of California, Los Angeles We survey …

Formal security analysis of neural networks using symbolic intervals

S Wang, K Pei, J Whitehouse, J Yang… - 27th USENIX Security …, 2018 - usenix.org
Due to the increasing deployment of Deep Neural Networks (DNNs) in real-world security-
critical domains including autonomous vehicles and collision avoidance systems, formally …

Verx: Safety verification of smart contracts

A Permenev, D Dimitrov, P Tsankov… - … IEEE symposium on …, 2020 - ieeexplore.ieee.org
We present VerX, the first automated verifier able to prove functional properties of Ethereum
smart contracts. VerX addresses an important problem as all real-world contracts must …

SVF: interprocedural static value-flow analysis in LLVM

Y Sui, J Xue - Proceedings of the 25th international conference on …, 2016 - dl.acm.org
This paper presents SVF, a tool that enables scalable and precise interprocedural Static
Value-Flow analysis for C programs by leveraging recent advances in sparse analysis. SVF …

Improving robot controller transparency through autonomous policy explanation

B Hayes, JA Shah - Proceedings of the 2017 ACM/IEEE international …, 2017 - dl.acm.org
Shared expectations and mutual understanding are critical facets of teamwork. Achieving
these in human-robot collaborative contexts can be especially challenging, as humans and …

Satisfiability modulo theories: introduction and applications

L De Moura, N Bjørner - Communications of the ACM, 2011 - dl.acm.org
Satisfiability modulo theories: introduction and applications Page 1 SepTeMBeR 2011 | Vol. 54 |
no. 9 | CommUniCations of the aCm 69 Constraint-satisfaction problems arise in diverse …

Z3: An efficient SMT solver

L De Moura, N Bjørner - International conference on Tools and Algorithms …, 2008 - Springer
Abstract Satisfiability Modulo Theories (SMT) problem is a decision problem for logical first
order formulas with respect to combinations of background theories such as: arithmetic, bit …

CPAchecker: A Tool for Configurable Software Verification

D Beyer, ME Keremoglu - … Conference, CAV 2011, Snowbird, UT, USA …, 2011 - Springer
Configurable software verification is a recent concept for expressing different program
analysis and model checking approaches in one single formalism. This paper presents …

Finding bugs is easy

D Hovemeyer, W Pugh - Acm sigplan notices, 2004 - dl.acm.org
Many techniques have been developed over the years to automatically find bugs in
software. Often, these techniques rely on formal methods and sophisticated program …