


default search action
5. ITP 2014: Vienna, Austria
- Gerwin Klein, Ruben Gamboa:

Interactive Theorem Proving - 5th International Conference, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings. Lecture Notes in Computer Science 8558, Springer 2014, ISBN 978-3-319-08969-0
Invited Papers
- Jared Davis, Anna Slobodová, Sol Swords

:
Microcode Verification - Another Piece of the Microprocessor Verification Puzzle. 1-16 - Roderick Chapman

, Florian Schanda:
Are We There Yet? 20 Years of Industrial Theorem Proving with SPARK. 17-26
Regular Papers
- Abhishek Anand, Vincent Rahli:

Towards a Formally Verified Proof Assistant. 27-44 - Vincent Aravantinos, Sofiène Tahar:

Implicational Rewriting Tactics in HOL. 45-60 - Jeremy Avigad

, Robert Y. Lewis, Cody Roux:
A Heuristic Prover for Real Inequalities. 61-76 - Evmorfia-Iro Bartzia, Pierre-Yves Strub:

A Formal Library for Elliptic Curves in the Coq Proof Assistant. 77-92 - Jasmin Christian Blanchette, Johannes Hölzl

, Andreas Lochbihler, Lorenz Panny, Andrei Popescu
, Dmitriy Traytel
:
Truly Modular (Co)datatypes for Isabelle/HOL. 93-110 - Jasmin Christian Blanchette, Andrei Popescu

, Dmitriy Traytel
:
Cardinals in Isabelle/HOL. 111-127 - Sandrine Blazy

, Vincent Laporte, David Pichardie:
Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code. 128-143 - Timothy Bourke, Rob J. van Glabbeek, Peter Höfner:

Showing Invariance Compositionally for a Process Algebra for Network Protocols. 144-159 - Frédéric Chyzak, Assia Mahboubi, Thomas Sibut-Pinote, Enrico Tassi:

A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3). 160-176 - David A. Cock

:
From Operational Models to Information Theory; Side Channels in pGCL with Isabelle. 177-192 - Cyril Cohen, Anders Mörtberg:

A Coq Formalization of Finitely Presented Modules. 193-208 - Robert Dockins:

Formalized, Effective Domain Theory in Coq. 209-225 - Christian Doczkal, Gert Smolka:

Completeness and Decidability Results for CTL in Coq. 226-241 - Jean-François Dufourd:

Hypermap Specification and Certified Linked Implementation Using Orbits. 242-257 - Kento Emoto, Frédéric Loulergue

, Julien Tesson:
A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction. 258-274 - Jason Gross, Adam Chlipala, David I. Spivak:

Experience Implementing a Performant Category-Theory Library in Coq. 275-291 - Nao Hirokawa

, Aart Middeldorp
, Christian Sternagel:
A New and Formalized Proof of Abstract Completion. 292-307 - Ramana Kumar, Rob Arthan, Magnus O. Myreen, Scott Owens

:
HOL with Definitions: Semantics, Soundness, and a Verified Implementation. 308-324 - Peter Lammich

:
Verified Efficient Implementation of Gabow's Strongly Connected Component Algorithm. 325-340 - Andreas Lochbihler, Johannes Hölzl

:
Recursive Functions on Lazy Lists via Domains and Topologies. 341-357 - Mohamed Yousri Mahmoud

, Vincent Aravantinos, Sofiène Tahar:
Formal Verification of Optical Quantum Flip Gate. 358-373 - Gregory Malecha

, Adam Chlipala, Thomas Braibant:
Compositional Computational Reflection. 374-389 - Daniel Matichuk, Makarius Wenzel, Toby C. Murray:

An Isabelle Proof Method Language. 390-405 - J Strother Moore:

Proof Pearl: Proving a Simple Von Neumann Machine Turing Complete. 406-420 - Magnus O. Myreen, Jared Davis:

The Reflective Milawa Theorem Prover Is Sound - (Down to the Machine Code That Runs It). 421-436 - Tobias Nipkow

, Dmitriy Traytel
:
Unified Decision Procedures for Regular Expression Equivalence. 450-466 - Martin Ring, Christoph Lüth:

Collaborative Interactive Theorem Proving with Clide. 467-482 - Umair Siddique

, Mohamed Yousri Mahmoud
, Sofiène Tahar:
On the Formalization of Z-Transform in HOL. 483-498 - Matthieu Sozeau, Nicolas Tabareau:

Universe Polymorphism in Coq. 499-514 - Makarius Wenzel:

Asynchronous User Interaction and Tool Integration in Isabelle/PIDE. 515-530
Rough Diamonds
- Rob Arthan:

HOL Constant Definition Done Right. 531-536 - Matt Kaufmann, J Strother Moore:

Rough Diamond: An Extension of Equivalence-Based Rewriting. 537-542 - Robbert Krebbers, Xavier Leroy, Freek Wiedijk:

Formal C Semantics: CompCert and the C Standard. 543-548 - Disha Puri, Sandip Ray, Kecheng Hao, Fei Xie:

Mechanical Certification of Loop Pipelining Transformations: A Preview. 549-554

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














