Foto N. Afrati
Manolis Gergatsoulis
Francesca Toni
2003
Linearisability on Datalog programs
Theor. Comput. Sci.
308
1-3
199–226
10.1016/S0304-3975(02)00730-2
Roberto Bagnara
Patricia M. Hill
Enea Zaffanella
2008
The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems
Sci. Comput. Program.
72
1-2
3–21
10.1016/j.scico.2007.08.001
Christel Baier
Cesare Tinelli
2015
Tools and Algorithms for the Construction and Analysis of Systems - 21st International Conference, TACAS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings
Lecture Notes in Computer Science
9035
Springer
10.1007/978-3-662-46681-0
Dirk Beyer
2015
Software Verification and Verifiable Witnesses - (Report on SV-COMP 2015)
Baier
Tinelli
401–416
10.1007/978-3-662-46681-0_31
Nikolaj Bjørner
Kenneth L. McMillan
Andrey Rybalchenko
2013
On Solving Universally Quantified Horn Clauses
Francesco Logozzo
Manuel Fähndrich
SAS
LNCS
7935
Springer
105–125
http://dx.doi.org/10.1007/978-3-642-38856-9_8
Patrick Cousot
Radhia Cousot
1977
Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints
Robert M. Graham
Michael A. Harrison
Ravi Sethi
POPL
ACM
238–252
http://doi.acm.org/10.1145/512950.512973
Patrick Cousot
Nicolas Halbwachs
1978
POPL
ACM Press
84–96
10.1145/512760.512770
http://dl.acm.org/citation.cfm?id=512760
Emanuele De Angelis
Fabio Fioravanti
Alberto Pettorossi
Maurizio Proietti
2014
VeriMAP: A Tool for Verifying Programs through Transformations
Erika Ábrahám
Klaus Havelund
TACAS
LNCS
8413
Springer
568–574
http://dx.doi.org/10.1007/978-3-642-54862-8_47
Emanuele De Angelis
Fabio Fioravanti
Alberto Pettorossi
Maurizio Proietti
2015
Proving correctness of imperative programs by linearizing constrained Horn clauses
TPLP
15
4-5
635–650
10.1017/S1471068415000289
Bruno Dutertre
2014
Yices 2.2
Armin Biere
Roderick Bloem
Computer-Aided Verification (CAV'2014)
Lecture Notes in Computer Science
8559
Springer
737–744
10.1007/978-3-319-08867-9_49
Javier Esparza
Pierre Ganty
Stefan Kiefer
Michael Luttenberger
2011
Parikh's theorem: A simple and direct automaton construction
Inf. Process. Lett.
111
12
614–619
10.1016/j.ipl.2011.03.019
Javier Esparza
Stefan Kiefer
Michael Luttenberger
2007
On Fixed Point Equations over Commutative Semirings
STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
LNCS
4393
Springer
296–307
10.1007/978-3-540-70918-3_26
J. P. Gallagher
1986
Transforming Logic Programs by Specialising Interpreters
Proceedings of the 7th European Conference on Artificial Intelligence (ECAI-86), Brighton
109–122
John P. Gallagher
1993
Tutorial on Specialisation of Logic Programs
David A. Schmidt
Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM'93, Copenhagen, Denmark, June 14-16, 1993
ACM
88–98
10.1145/154630.154640
http://dl.acm.org/citation.cfm?id=154630
Pierre Ganty
Radu Iosif
Filip Konečný
2013
Underapproximation of Procedure Summaries for Integer Programs
Nir Piterman
Scott A. Smolka
TACAS 2013. Proceedings
Lecture Notes in Computer Science
7795
Springer
245–259
10.1007/978-3-642-36742-7_18
Sergey Grebenshchikov
Ashutosh Gupta
Nuno P. Lopes
Corneliu Popeea
Andrey Rybalchenko
2012
HSF(C): A Software Verifier Based on Horn Clauses - (Competition Contribution)
Cormac Flanagan
Barbara König
TACAS
LNCS
7214
Springer
549–551
http://dx.doi.org/10.1007/978-3-642-28756-5_46
Sergey Grebenshchikov
Nuno P. Lopes
Corneliu Popeea
Andrey Rybalchenko
2012
Synthesizing software verifiers from proof rules
Jan Vitek
Haibo Lin
Frank Tip
ACM SIGPLAN PLDI
ACM
405–416
10.1145/2254064.2254112
http://dl.acm.org/citation.cfm?id=2254064
Arie Gurfinkel
Temesghen Kahsai
Jorge A. Navas
2015
SeaHorn: A Framework for Verifying C Programs (Competition Contribution)
Baier
Tinelli
447–450
10.1007/978-3-662-46681-0_41
Manuel V. Hermenegildo
Francisco Bueno
Manuel Carro
Pedro López-García
Edison Mera
José F. Morales
Germán Puebla
2012
An overview of Ciao and its design philosophy
TPLP
12
1-2
219–252
10.1017/S1471068411000457
Hossein Hojjat
Filip Konecný
Florent Garnier
Radu Iosif
Viktor Kuncak
Philipp Rümmer
2012
A Verification Toolkit for Numerical Transition Systems - Tool Paper
Dimitra Giannakopoulou
Dominique Méry
FM. Proceedings
Lecture Notes in Computer Science
7436
Springer
247–251
10.1007/978-3-642-32759-9_21
N. Jones
C.K. Gomard
P. Sestoft
1993
Partial Evaluation and Automatic Software Generation
Prentice Hall
Neil D. Jones
2004
Transformation by interpreter specialisation
Sci. Comput. Program.
52
307–339
10.1016/j.scico.2004.03.010
Bishoksan Kafle
John P Gallagher
2015
Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
Computer Languages, Systems & Structures
10.1016/j.cl.2015.11.001
Bishoksan Kafle
John P. Gallagher
Pierre Ganty
2015
Decomposition by tree dimension in Horn clause verification
Alexei Lisitsa
Andrei P. Nemytykh
Alberto Pettorossi
VPT.
EPTCS
199
1–14
10.4204/EPTCS.199.1
Michael Leuschel
1994
Partial Evaluation of the ``Real Thing"
Laurent Fribourg
Franco Turini
LOPSTR, Proceedings
Lecture Notes in Computer Science
883
Springer
122–137
10.1007/3-540-58792-6_8
Michael Leuschel
Daniel Elphick
Mauricio Varea
Stephen-John Craig
Marc Fontaine
2006
The Ecce and Logen partial evaluators and their web interfaces
John Hatcliff
Frank Tip
PEPM 2006
ACM
88–94
10.1145/1111542.1111557
Michael Leuschel
Germán Vidal
2014
Fast offline partial evaluation of logic programs
Inf. Comput.
235
70–97
10.1016/j.ic.2014.01.005
Michael Luttenberger
Maximilian Schlund
2016
Convergence of Newton's Method over Commutative Semirings
Inf. Comput.
246
43–61
10.1016/j.ic.2015.11.008
Kenneth L. McMillan
Andrey Rybalchenko
2013
Solving Constrained Horn Clauses using Interpolation
Technical Report
Microsoft Research
Philipp Rümmer
Hossein Hojjat
Viktor Kuncak
2013
Disjunctive Interpolants for Horn-Clause Verification
Natasha Sharygina
Helmut Veith
CAV
Lecture Notes in Computer Science
8044
Springer
347–363
10.1007/978-3-642-39799-8
10.1007/978-3-642-39799-8_24