default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. ITP 2013: Rennes, France
- Sandrine Blazy
, Christine Paulin-Mohring, David Pichardie:
Interactive Theorem Proving - 4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013. Proceedings. Lecture Notes in Computer Science 7998, Springer 2013, ISBN 978-3-642-39633-5
Invited Talks
- Dominique Bolignano:
Applying Formal Methods in the Large. 1 - K. Rustan M. Leino:
Automating Theorem Proving with SMT. 2-16 - Carsten Schürmann:
Certifying Voting Protocols. 17
Invited Tutorials
- Panagiotis Manolios:
Counterexample Generation Meets Interactive Theorem Proving: Current Results and Future Opportunities. 18 - Assia Mahboubi, Enrico Tassi:
Canonical Structures for the Working Coq User. 19-34
Regular Papers
- Daniel Kühlwein, Jasmin Christian Blanchette, Cezary Kaliszyk, Josef Urban:
MaSh: Machine Learning for Sledgehammer. 35-50 - Cezary Kaliszyk, Alexander Krauss:
Scalable LCF-Style Proof Translation. 51-66 - Guillaume Claret, Lourdes Del Carmen González-Huesca, Yann Régis-Gianas, Beta Ziliani:
Lightweight Proof by Reflection Using a Posteriori Simulation of Effectful Computation. 67-83 - Peter Lammich:
Automatic Data Refinement. 84-99 - Florian Haftmann, Alexander Krauss, Ondrej Kuncar, Tobias Nipkow:
Data Refinement in Isabelle/HOL. 100-115 - Andreas Lochbihler:
Light-Weight Containers for Isabelle: Efficient, Extensible, Nestable. 116-132 - Michael Norrish, Brian Huffman:
Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω 1. 133-146 - Jian Xu, Xingyuan Zhang, Christian Urban:
Mechanising Turing Machines and Computability Theory in Isabelle/HOL. 147-162 - Georges Gonthier, Andrea Asperti, Jeremy Avigad, Yves Bertot, Cyril Cohen, François Garillot, Stéphane Le Roux, Assia Mahboubi, Russell O'Connor, Sidi Ould Biha, Ioana Pasca, Laurence Rideau, Alexey Solovyev, Enrico Tassi, Laurent Théry:
A Machine-Checked Proof of the Odd Order Theorem. 163-179 - Damien Pous:
Kleene Algebra with Tests and Coq Tools for while Programs. 180-196 - Alasdair Armstrong, Georg Struth, Tjark Weber:
Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL. 197-212 - Cyril Cohen:
Pragmatic Quotient Types in Coq. 213-228 - Nathan Wetzler, Marijn Heule, Warren A. Hunt Jr.:
Mechanical Verification of SAT Refutations with Extended Resolution. 229-244 - René Thiemann:
Formalizing Bounded Increase. 245-260 - Vincent Rahli, Mark Bickford, Abhishek Anand:
Formal Program Optimization in Nuprl Using Computational Equivalence and Partial Types. 261-278 - Johannes Hölzl, Fabian Immler, Brian Huffman:
Type Classes and Filters for Mathematical Analysis in Isabelle/HOL. 279-294 - Liya Liu, Osman Hasan, Vincent Aravantinos, Sofiène Tahar:
Formal Reasoning about Classified Markov Chains in HOL. 295-310 - David A. Cock:
Practical Probability: Applying pGCL to Lattice Scheduling. 311-327 - Viktor Vafeiadis:
Adjustable References. 328-337 - Jean-François Monin, Xiaomu Shi:
Handcrafted Inversions Made Operational on Operational Semantics. 338-353 - Jörg Endrullis, Dimitri Hendriks, Martin Bodin:
Circular Coinduction in Coq Using Bisimulation-Up-To Techniques. 354-369 - Kenji Miyamoto, Fredrik Nordvall Forsberg, Helmut Schwichtenberg:
Program Extraction from Nested Definitions. 370-385 - Kaustuv Chaudhuri:
Subformula Linking as an Interaction Method. 386-401 - Emmanuel Polonowski:
Automatically Generated Infrastructure for De Bruijn Syntaxes. 402-417 - Makarius Wenzel:
Shared-Memory Multiprocessing for Interactive Theorem Proving. 418-434 - David L. Rager, Warren A. Hunt Jr., Matt Kaufmann:
A Parallelized Theorem Prover for a Logic with Parallel Execution. 435-450
Rough Diamonds
- Carst Tankink, Cezary Kaliszyk, Josef Urban, Herman Geuvers:
Communicating Formal Proofs: The Case of Flyspeck. 451-456 - Pierre Neron:
Square Root and Division Elimination in PVS. 457-462 - Evgeny Makarov, Bas Spitters:
The Picard Algorithm for Ordinary Differential Equations in Coq. 463-468 - Evan Austin, Perry Alexander:
Stateless Higher-Order Logic with Quantified Types. 469-476 - Thomas Braibant, Jacques-Henri Jourdan, David Monniaux:
Implementing Hash-Consed Structures in Coq. 477-483 - Etienne Mabille, Marc Boyer, Loïc Fejoz, Stephan Merz:
Towards Certifying Network Calculus. 484-489 - Magnus O. Myreen, Scott Owens, Ramana Kumar:
Steps towards Verified Implementations of HOL Light. 490-495
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-22 20:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
