Nikolaj Bjørner, Arie Gurfinkel, Kenneth L. McMillan & Andrey Rybalchenko (2015):
Horn Clause Solvers for Program Verification.
In: Fields of Logic and Computation II - Essays Dedicated to Yuri Gurevich on the Occasion of His 75th Birthday,
LNCS 9300.
Springer,
pp. 24–51,
doi:10.1007/978-3-319-23534-9_2.
Martin Brain, Saurabh Joshi, Daniel Kroening & Peter Schrammel (2015):
Safety Verification and Refutation by k-Invariants and k-Induction.
In: Static Analysis Symposium,
LNCS 9291.
Springer,
pp. 145–161,
doi:10.1007/978-3-662-48288-9_9.
Hong-Yi Chen, Cristina David, Daniel Kroening, Peter Schrammel & Björn Wachter (2015):
Synthesising Interprocedural Bit-Precise Termination Proofs.
In: Automated Software Engineering.
ACM,
pp. 53–64,
doi:10.1109/ASE.2015.10.
Sergey Grebenshchikov, Nuno P. Lopes, Corneliu Popeea & Andrey Rybalchenko (2012):
Synthesizing software verifiers from proof rules.
In: Programming Language Design and Implementation.
ACM,
pp. 405–416,
doi:10.1145/2254064.2254112.
Youssef Hamadi & Christoph M. Wintersteiger (2013):
Seven Challenges in Parallel SAT Solving.
AI Magazine 34(2),
pp. 99–106.
Anvesh Komuravelli, Arie Gurfinkel & Sagar Chaki (2014):
SMT-Based Model Checking for Recursive Programs.
In: Computer-Aided Verification,
LNCS 8559.
Springer,
pp. 17–34,
doi:10.1007/978-3-319-08867-9_2.
Peter Schrammel & Daniel Kroening (2016):
2LS for Program Analysis - (Competition Contribution).
In: Tools and Algorithms for the Construction and Analysis of Systems,
LNCS 9636.
Springer,
pp. 905–907,
doi:10.1007/978-3-662-49674-9_56.
eptcs@eptcs.org