Result 1 to 15 of 15 total
Reconstruction of Z3’s bit-vector proofs in HOL4 and Isabelle/HOL. (English)
Jouannaud, Jean-Pierre (ed.) et al., Certified programs and proofs. First international conference, CPP 2011, Kenting, Taiwan, December 7‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25378-2/pbk). Lecture Notes in Computer Science 7086, 183-198 (2011).
1
Verification of certifying computations. (English)
Gopalakrishnan, Ganesh (ed.) et al., Computer aided verification. 23rd international conference, CAV 2011, Snowbird, UT, USA, July 14‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22109-5/pbk). Lecture Notes in Computer Science 6806, 67-82 (2011).
2
Heaps and data structures: a challenge for automated provers. (English)
Bjørner, Nikolaj (ed.) et al., Automated deduction ‒ CADE-23. 23rd international conference on automated deduction, Wrocław, Poland, July 31 ‒ August 5, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22437-9/pbk). Lecture Notes in Computer Science 6803. Lecture Notes in Artificial Intelligence, 177-191 (2011).
3
Extending Sledgehammer with SMT solvers. (English)
Bjørner, Nikolaj (ed.) et al., Automated deduction ‒ CADE-23. 23rd international conference on automated deduction, Wrocław, Poland, July 31 ‒ August 5, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22437-9/pbk). Lecture Notes in Computer Science 6803. Lecture Notes in Artificial Intelligence, 116-130 (2011).
4
Extending sledgehammer with SMT solvers (English)
CADE, 116-130 (2011).
5
Heaps and data structures: A challenge for automated provers (English)
CADE, 177-191 (2011).
6
Reconstruction of z3’s bit-vector proofs in HOL4 and isabelle/HOL (English)
CPP, 183-198 (2011).
7
Verification of certifying computations (English)
CAV, 67-82 (2011).
8
Sledgehammer: Judgement day. (English)
Giesl, Jürgen (ed.) et al., Automated reasoning. 5th international joint conference, IJCAR 2010, Edinburgh, UK, July 16‒19, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14202-4/pbk). Lecture Notes in Computer Science 6173. Lecture Notes in Artificial Intelligence, 107-121 (2010).
9
Fast LCF-style proof reconstruction for Z3. (English)
Kaufmann, Matt (ed.) et al., Interactive theorem proving. First international conference, ITP 2010, Edinburgh, UK, July 11‒14, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14051-8/pbk). Lecture Notes in Computer Science 6172, 179-194 (2010).
10
HOL-Boogie ‒ an interactive prover-backend for the verifying C compiler. (English)
J. Autom. Reasoning 44, No. 1-2, 111-144 (2010).
11
Sledgehammer: judgement day (English)
IJCAR, 107-121 (2010).
12
Fast LCF-style proof reconstruction for Z3 (English)
ITP, 179-194 (2010).
13
HOL-Boogie ‒ an interactive prover for the Boogie program-verifier. (English)
Mohamed, Otmane Ait (ed.) et al., Theorem proving in higher order logics. 21st international conference, TPHOLs 2008, Montreal, Canada, August 18‒21, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-71065-3/pbk). Lecture Notes in Computer Science 5170, 150-166 (2008).
14
HOL-boogie - an interactive prover for the boogie program-verifier (English)
TPHOLs, 150-166 (2008).
15
Result 1 to 15 of 15 total