Towards evaluating the robustness of neural networks

N Carlini, D Wagner - 2017 ieee symposium on security and …, 2017 - ieeexplore.ieee.org
Neural networks provide state-of-the-art results for most machine learning tasks.
Unfortunately, neural networks are vulnerable to adversarial examples: given an input x and …

Synchronous programming of reactive systems: A tutorial and commented bibliography

N Halbwachs - International Conference on Computer Aided …, 1998 - Springer
The term" reactive system" was introduced by David Harel and Amir Pnueli [HP85], and is
now commonly accepted to designate permanently operating systems, and to distinguish …

ABC: An academic industrial-strength verification tool

R Brayton, A Mishchenko - … Conference, CAV 2010, Edinburgh, UK, July …, 2010 - Springer
ABC is a public-domain system for logic synthesis and formal verification of binary logic
circuits appearing in synchronous hardware designs. ABC combines scalable logic …

Model checking

EM Clarke - Foundations of Software Technology and Theoretical …, 1997 - Springer
Abstract Model checking is an automatic technique for verifying finite-state reactive systems,
such as sequential circuit designs and communication protocols. Specifications are …

[图书][B] Principles of model checking

C Baier, JP Katoen - 2008 - books.google.com
A comprehensive introduction to the foundations of model checking, a fully automated
technique for finding flaws in hardware and software; with extensive examples and both …

[图书][B] Handbook of satisfiability

A Biere, M Heule, H van Maaren - 2009 - books.google.com
“Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic,
applied areas such as planning, scheduling, operations research and combinatorial …

[图书][B] Symbolic model checking

KL McMillan, KL McMillan - 1993 - Springer
In the previous chapter, we equated a CTL formula with the set of states in which the formula
is true. We showed how the CTL operators can thus be characterized as fixed points of …

Symbolic model checking: 1020 states and beyond

JR Burch, EM Clarke, KL McMillan, DL Dill… - Information and …, 1992 - Elsevier
Many different methods have been devised for automatically verifying finite state systems by
examining state-graph models of system behavior. These methods all depend on decision …

Verification techniques for cache coherence protocols

F Pong, M Dubois - ACM Computing Surveys (CSUR), 1997 - dl.acm.org
In this article we present a comprehensive survey of various approaches for the verification
of cache coherence protocols based on state enumeration,(symbolic model checking, and …

Counterexample-guided abstraction refinement for symbolic model checking

E Clarke, O Grumberg, S Jha, Y Lu, H Veith - Journal of the ACM (JACM), 2003 - dl.acm.org
The state explosion problem remains a major hurdle in applying symbolic model checking to
large hardware designs. State space abstraction, having been essential for verifying designs …