


default search action
6. ITP 2015: Nanjing, China
- Christian Urban, Xingyuan Zhang:

Interactive Theorem Proving - 6th International Conference, ITP 2015, Nanjing, China, August 24-27, 2015, Proceedings. Lecture Notes in Computer Science 9236, Springer 2015, ISBN 978-3-319-22101-4 - Mohammad Abdulaziz, Charles Gretton, Michael Norrish

:
Verified Over-Approximation of the Diameter of Propositionally Factored Transition Systems. 1-16 - Reynald Affeldt

, Jacques Garrigue:
Formalization of Error-Correcting Codes: From Hamming to Modern Coding Theory. 17-33 - Abhishek Anand, Ross A. Knepper:

ROSCoq: Robots Powered by Constructive Reals. 34-50 - Bruno Barras, Carst Tankink, Enrico Tassi:

Asynchronous Processing of Coq Documents: From the Kernel up to the User Interface. 51-66 - Frédéric Besson, Sandrine Blazy, Pierre Wilke:

A Concrete Memory Model for CompCert. 67-83 - Sandrine Blazy, Delphine Demange

, David Pichardie:
Validating Dominator Trees for a Fast, Verified Dominance Test. 84-99 - Sylvain Boulmé, Alexandre Maréchal:

Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra. 100-116 - Hing-Lun Chan

, Michael Norrish
:
Mechanisation of AKS Algorithm: Part 1 - The Main Theorem. 117-136 - Arthur Charguéraud, François Pottier:

Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation. 137-153 - Luís Cruz-Filipe

, Peter Schneider-Kamp
:
Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker. 154-169 - Benja Fallenstein, Ramana Kumar:

Proof-Producing Reflection for HOL - With an Application to Model Polymorphism. 170-186 - Anthony C. J. Fox:

Improved Tool Support for Machine-Code Decompilation in HOL4. 187-202 - Johannes Hölzl, Andreas Lochbihler

, Dmitriy Traytel
:
A Formalized Hierarchy of Probabilistic System Types - Proof Pearl. 203-220 - Fabian Immler:

A Verified Enclosure for the Lorenz Attractor (Rough Diamond). 221-226 - Cezary Kaliszyk

, Josef Urban, Jirí Vyskocil:
Learning to Parse on Aligned Corpora (Rough Diamond). 227-233 - Ondrej Kuncar, Andrei Popescu

:
A Consistent Foundation for Isabelle/HOL. 234-252 - Peter Lammich:

Refinement to Imperative/HOL. 253-269 - Andreas Lochbihler

, Alexandra Maximova:
Stream Fusion for Isabelle's Code Generator - Rough Diamond. 270-277 - Petar Maksimovic

, Alan Schmitt:
HOCore in Coq. 278-293 - Mariano M. Moscato, César A. Muñoz, Andrew P. Smith:

Affine Arithmetic and Applications to Real-Number Proving. 294-309 - Tobias Nipkow

:
Amortized Complexity Verified. 310-324 - Zoe Paraskevopoulou, Catalin Hritcu, Maxime Dénès, Leonidas Lampropoulos, Benjamin C. Pierce:

Foundational Property-Based Testing. 325-343 - Sigurd Schneider, Gert Smolka, Sebastian Hack:

A Linear First-Order Functional Intermediate Language for Verified Compilers. 344-358 - Steven Schäfer, Tobias Tebbi, Gert Smolka:

Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions. 359-374 - Filip Sieczkowski

, Ales Bizjak, Lars Birkedal
:
ModuRes: A Coq Library for Modular Reasoning About Concurrent Higher-Order Imperative Programming Languages. 375-390 - Gert Smolka, Steven Schäfer, Christian Doczkal:

Transfinite Constructions in Classical Type Theory. 391-404 - Régis Spadotti:

A Mechanized Theory of Regular Trees in Dependent Type Theory. 405-420 - Christian Sternagel, René Thiemann

:
Deriving Comparators and Show Functions in Isabelle/HOL. 421-437 - T. V. H. Prathamesh:

Formalising Knot Theory in Isabelle/HOL. 438-452 - Thomas Tuerk, Magnus O. Myreen, Ramana Kumar:

Pattern Matches in HOL: - A New Representation and Improved Code Generation. 453-468

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














