No abstract available.
Cited By
- Appel A and Kellison A VCFloat2: Floating-Point Error Analysis in Coq Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs, (14-29)
- Léchenet J, Kosmatov N and Le Gall P (2023). Efficient computation of arbitrary control dependencies, Theoretical Computer Science, 969:C, Online publication date: 21-Aug-2023.
- Haines T, Goré R and Tiwari M Machine-checking multi-round proofs of shuffle Proceedings of the 32nd USENIX Conference on Security Symposium, (6471-6488)
- Lefèvre V, Louvet N, Muller J, Picot J and Rideau L (2023). Accurate Calculation of Euclidean Norms Using Double-word Arithmetic, ACM Transactions on Mathematical Software, 49:1, (1-34), Online publication date: 31-Mar-2023.
- Danvy O (2022). The Tortoise and the Hare Algorithm for Finite Lists, Compositionally, ACM Transactions on Programming Languages and Systems, 45:1, (1-35), Online publication date: 31-Mar-2023.
- Guidi F (2021). A Formal System for the Universal Quantification of Schematic Variables, ACM Transactions on Computational Logic, 23:1, (1-37), Online publication date: 31-Jan-2022.
- Braun D, Magaud N and Schreck P Two New Ways to Formally Prove Dandelin-Gallucci's Theorem Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation, (59-66)
- Nipkow T Teaching algorithms and data structures with a proof assistant (invited talk) Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, (1-3)
- Wang M and Deng J Learning to prove theorems by learning to generate theorems Proceedings of the 34th International Conference on Neural Information Processing Systems, (18146-18157)
- Pit-Claudel C Untangling mechanized proofs Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering, (155-174)
- Sasdelli F, Amaro M, Cardoso E, Feitosa S and Ribeiro R Syntax vs Semantics Proceedings of the 24th Brazilian Symposium on Context-Oriented Programming and Advanced Modularity, (9-16)
- Jamroga W, Kim Y, Kurpiewski D and Ryan P Towards Model Checking of Voting Protocols in Uppaal Electronic Voting, (129-146)
- Bana G, Chadha R, Eeralla A and Okada M (2019). Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability, ACM Transactions on Computational Logic, 21:1, (1-44), Online publication date: 10-Jan-2020.
- Miller D A Distributed and Trusted Web of Formal Proofs Distributed Computing and Internet Technology, (21-40)
- Celik A, Palmskog K, Parovic M, Arias E and Gligoric M Mutation analysis for Coq Proceedings of the 34th IEEE/ACM International Conference on Automated Software Engineering, (539-551)
- Shen X and Zheng K Characterizing Strongly Normalizing λGtz-terms via Non-Idempotent Intersection Types Proceedings of the 3rd International Conference on Computer Science and Application Engineering, (1-7)
- Vukotic I, Rahli V and Esteves-Veríssimo P (2019). Asphalion: trustworthy shielding against Byzantine faults, Proceedings of the ACM on Programming Languages, 3:OOPSLA, (1-32), Online publication date: 10-Oct-2019.
- Konnov I, Kukovec J and Tran T (2019). TLA+ model checking made symbolic, Proceedings of the ACM on Programming Languages, 3:OOPSLA, (1-30), Online publication date: 10-Oct-2019.
- Yang Z, Bodeveix J and Filali M (2019). Towards a simple and safe Objective Caml compiling framework for the synchronous language SIGNAL, Frontiers of Computer Science: Selected Publications from Chinese Universities, 13:4, (715-734), Online publication date: 1-Aug-2019.
- Sheng F, Zhu H, He J, Yang Z and Bowen J (2019). Theoretical and Practical Aspects of Linking Operational and Algebraic Semantics for MDESL, ACM Transactions on Software Engineering and Methodology, 28:3, (1-46), Online publication date: 31-Jul-2019.
- Pédrot P, Tabareau N, Fehrmann H and Tanter É (2019). A reasonably exceptional type theory, Proceedings of the ACM on Programming Languages, 3:ICFP, (1-29), Online publication date: 26-Jul-2019.
- Pientka B, Thibodeau D, Abel A, Ferreira F and Zucchini R A type theory for defining logics and proofs Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-13)
- Wang M, Tian C, Zhang N, Duan Z and Du H (2019). Verifying a scheduling protocol of safety-critical systems, Journal of Combinatorial Optimization, 37:4, (1191-1215), Online publication date: 1-May-2019.
- Rahli V, Bickford M, Cohen L and Constable R (2019). Bar Induction is Compatible with Constructive Type Theory, Journal of the ACM, 66:2, (1-35), Online publication date: 26-Apr-2019.
- Bjørner D (2019). Domain Analysis and Description Principles, Techniques, and Modelling Languages, ACM Transactions on Software Engineering and Methodology, 28:2, (1-67), Online publication date: 9-Apr-2019.
- Blanchard A, Kosmatov N and Loulergue F Logic against ghosts Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, (2186-2195)
- Kună?Ar O and Popescu A (2019). A Consistent Foundation for Isabelle/HOL, Journal of Automated Reasoning, 62:4, (531-555), Online publication date: 1-Apr-2019.
- Braun D, Magaud N and Schreck P (2019). Two cryptomorphic formalizations of projective incidence geometry, Annals of Mathematics and Artificial Intelligence, 85:2-4, (193-212), Online publication date: 1-Apr-2019.
- Charguéraud A and Pottier F (2019). Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits, Journal of Automated Reasoning, 62:3, (331-365), Online publication date: 1-Mar-2019.
- Kună?Ar O and Popescu A (2019). From Types to Sets by Local Type Definition in Higher-Order Logic, Journal of Automated Reasoning, 62:2, (237-260), Online publication date: 1-Feb-2019.
- Winterhalter T, Sozeau M and Tabareau N Eliminating reflection from type theory Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, (91-103)
- Bahrami A, De Maria E and Felty A Modelling and Verifying Dynamic Properties of Biological Neural Networks in Coq Proceedings of the 9th International Conference on Computational Systems-Biology and Bioinformatics, (1-11)
- Vazou N, Breitner J, Kunkel R, Van Horn D and Hutton G (2018). Theorem proving for all: equational reasoning in liquid Haskell (functional pearl), ACM SIGPLAN Notices, 53:7, (132-144), Online publication date: 7-Dec-2018.
- Taube M, Losa G, McMillan K, Padon O, Sagiv M, Shoham S, Wilcox J and Woos D (2018). Modularity for decidability of deductive verification with applications to distributed systems, ACM SIGPLAN Notices, 53:4, (662-677), Online publication date: 2-Dec-2018.
- Liu H, Wang X, Li G, Lu S, Ye F and Tian C (2018). FCatch, ACM SIGPLAN Notices, 53:2, (419-431), Online publication date: 30-Nov-2018.
- Vazou N, Breitner J, Kunkel R, Van Horn D and Hutton G Theorem proving for all: equational reasoning in liquid Haskell (functional pearl) Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell, (132-144)
- Hanus M Verifying Fail-Free Declarative Programs Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, (1-13)
- Padmos A Against Mindset Proceedings of the New Security Paradigms Workshop, (12-27)
- Taube M, Losa G, McMillan K, Padon O, Sagiv M, Shoham S, Wilcox J and Woos D Modularity for decidability of deductive verification with applications to distributed systems Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, (662-677)
- Czajka ź and Kaliszyk C (2018). Hammer for Coq, Journal of Automated Reasoning, 61:1-4, (423-453), Online publication date: 1-Jun-2018.
- Mateescu R (2018). Recent advances in interactive and automated analysis, International Journal on Software Tools for Technology Transfer (STTT), 20:2, (119-123), Online publication date: 1-Apr-2018.
- Liu H, Wang X, Li G, Lu S, Ye F and Tian C FCatch Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems, (419-431)
- Clochard M, Gondelman L and Pereira M (2018). The Matrix Reproved (Verification Pearl), Journal of Automated Reasoning, 60:3, (365-383), Online publication date: 1-Mar-2018.
- Wieczorek P and Biernacki D A Coq formalization of normalization by evaluation for Martin-Löf type theory Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, (266-279)
- Léchenet J, Kosmatov N and Le Gall P (2018). Cut branches before looking for bugs: certifiably sound verification on relaxed slices, Formal Aspects of Computing, 30:1, (107-131), Online publication date: 1-Jan-2018.
- Miné A (2017). Tutorial on Static Inference of Numeric Invariants by Abstract Interpretation, Foundations and Trends in Programming Languages, 4:3-4, (120-372), Online publication date: 5-Dec-2017.
- Chihani Z, Miller D and Renaud F (2017). A Semantic Framework for Proof Evidence, Journal of Automated Reasoning, 59:3, (287-330), Online publication date: 1-Oct-2017.
- Gordon C, Ernst M, Grossman D and Parkinson M (2017). Verifying Invariants of Lock-Free Data Structures with Rely-Guarantee and Refinement Types, ACM Transactions on Programming Languages and Systems, 39:3, (1-54), Online publication date: 30-Sep-2017.
- Roe K and Smith S Using the coq theorem prover to verify complex data structure invariants Proceedings of the 15th ACM-IEEE International Conference on Formal Methods and Models for System Design, (118-121)
- Shingarov B Programming a Smalltalk VM in Coq Proceedings of the 12th edition of the International Workshop on Smalltalk Technologies, (1-8)
- Capretta V and Fowler J The continuity of monadic stream functions Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)
- Rahli V, Bickford M and Constable R Bar induction Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)
- Cataño N An empirical study on teaching formal methods to millennials Proceedings of the 1st International Workshop on Software Engineering Curricula for Millennials, (3-8)
- Shi G, Gan Y, Shang S, Wang S, Dong Y and Yew P A formally verified sequentializer for lustre-like concurrent synchronous data-flow programs Proceedings of the 39th International Conference on Software Engineering Companion, (109-111)
- Liu H, Li G, Lukman J, Li J, Lu S, Gunawi H and Tian C (2017). DCatch, ACM SIGPLAN Notices, 52:4, (677-691), Online publication date: 12-May-2017.
- Liu H, Li G, Lukman J, Li J, Lu S, Gunawi H and Tian C (2017). DCatch, ACM SIGARCH Computer Architecture News, 45:1, (677-691), Online publication date: 11-May-2017.
- Madhavan R, Kulal S and Kuncak V (2017). Contract-based resource verification for higher-order functions with memoization, ACM SIGPLAN Notices, 52:1, (330-343), Online publication date: 11-May-2017.
- Cruz-Filipe L, Marques-Silva J and Schneider-Kamp P Efficient Certified Resolution Proof Checking Proceedings, Part I, of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 10205, (118-135)
- Liu H, Li G, Lukman J, Li J, Lu S, Gunawi H and Tian C DCatch Proceedings of the Twenty-Second International Conference on Architectural Support for Programming Languages and Operating Systems, (677-691)
- Verity F and Pattinson D Formally verified invariants of vote counting schemes Proceedings of the Australasian Computer Science Week Multiconference, (1-10)
- Yamamoto M, Sekine S and Matsumoto S Formalization of Karp-Miller tree construction on petri nets Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, (66-78)
- Bohrer R, Rahli V, Vukotic I, Völp M and Platzer A Formally verified differential dynamic logic Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, (208-221)
- Ahmed W, Hasan O, Pervez U and Qadir J (2017). Reliability modeling and analysis of communication networks, Journal of Network and Computer Applications, 78:C, (191-215), Online publication date: 15-Jan-2017.
- Madhavan R, Kulal S and Kuncak V Contract-based resource verification for higher-order functions with memoization Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, (330-343)
- Hubbard S and Walkingshaw E Formula choice calculus Proceedings of the 7th International Workshop on Feature-Oriented Software Development, (49-57)
- Mokni A, Urtado C, Vauttier S, Huchard M and Zhang H (2016). A formal approach for managing component-based architecture evolution, Science of Computer Programming, 127:C, (24-49), Online publication date: 1-Oct-2016.
- Ramos M, Queiroz R, Moreira N and Almeida J On the Formalization of Some Results of Context-Free Language Theory Proceedings of the 23rd International Workshop on Logic, Language, Information, and Computation - Volume 9803, (338-357)
- Lopes N and Monteiro J (2016). Automatic equivalence checking of programs with uninterpreted functions and integer arithmetic, International Journal on Software Tools for Technology Transfer (STTT), 18:4, (359-374), Online publication date: 1-Aug-2016.
- Basold H and Geuvers H Type Theory based on Dependent Inductive and Coinductive Types Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (327-336)
- Battell C and Felty A The Logic of Hereditary Harrop Formulas as a Specification Logic for Hybrid Proceedings of the Eleventh Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, (1-10)
- Jacob-Rao R, Cave A and Pientka B Mechanizing Proofs about Mendler-style Recursion Proceedings of the Eleventh Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, (1-9)
- Haberland R, Krinkin K and Ivanovskiy S Abstract predicate entailment over points-to heaplets is syntax recognition Proceedings of the 18th Conference of Open Innovations Association FRUCT, (66-74)
- Wang Y and Nadathur G A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs Proceedings of the 25th European Symposium on Programming Languages and Systems - Volume 9632, (752-779)
- Léchenet J, Kosmatov N and Gall P Cut Branches Before Looking for Bugs Proceedings of the 19th International Conference on Fundamental Approaches to Software Engineering - Volume 9633, (179-196)
- Zhang N, Yang M, Gu B, Duan Z and Tian C (2016). Verifying safety critical task scheduling systems in PPTL axiom system, Journal of Combinatorial Optimization, 31:2, (577-603), Online publication date: 1-Feb-2016.
- St-Martin M and Felty A A verified algorithm for detecting conflicts in XACML access control rules Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, (166-175)
- Rahli V and Bickford M A nominal exploration of intuitionism Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, (130-141)
- Ramananandro T, Mountcastle P, Meister B and Lethin R A unified Coq framework for verifying C programs with floating-point computations Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, (15-26)
- Krebbers R, Parlant L and Silva A Moessner's Theorem Essays Dedicated to Frank de Boer on Theory and Practice of Formal Methods - Volume 9660, (309-324)
- Vazou N, Bakst A and Jhala R (2015). Bounded refinement types, ACM SIGPLAN Notices, 50:9, (48-61), Online publication date: 18-Dec-2015.
- Blanchette J, Popescu A and Traytel D (2015). Foundational extensible corecursion: a proof assistant perspective, ACM SIGPLAN Notices, 50:9, (192-204), Online publication date: 18-Dec-2015.
- Leino K and Lucio P (2015). An Assertional Proof of the Stability and Correctness of Natural Mergesort, ACM Transactions on Computational Logic, 17:1, (1-22), Online publication date: 10-Dec-2015.
- Joloboff V, Monin J and Shi X Towards Verified Faithful Simulation Proceedings of the First International Symposium on Dependable Software Engineering: Theories, Tools, and Applications - Volume 9409, (105-119)
- Betarte G, Campo J, Luna C and Romano A Verifying Android's Permission Model Proceedings of the 12th International Colloquium on Theoretical Aspects of Computing - ICTAC 2015 - Volume 9399, (485-504)
- Malecha G and Wisnesky R Using dependent types and tactics to enable semantic optimization of language-integrated queries Proceedings of the 15th Symposium on Database Programming Languages, (49-58)
- Bessai J, Düdder B, Heineman G and Rehof J Combinatory Synthesis of Classes Using Feature Grammars Revised Selected Papers of the 12th International Conference on Formal Aspects of Component Software - Volume 9539, (123-140)
- Benzmüller C Invited Talk Proceedings of the 24th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods - Volume 9323, (213-220)
- Adams M Refactoring Proofs with Tactician Revised Selected Papers of the SEFM 2015 Collocated Workshops on Software Engineering and Formal Methods - Volume 9509, (53-67)
- Vazou N, Bakst A and Jhala R Bounded refinement types Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, (48-61)
- Blanchette J, Popescu A and Traytel D Foundational extensible corecursion: a proof assistant perspective Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, (192-204)
- Sergey I, Nanevski A and Banerjee A (2015). Mechanized verification of fine-grained concurrent programs, ACM SIGPLAN Notices, 50:6, (77-87), Online publication date: 7-Aug-2015.
- Cruz-Filipe L and Schneider-Kamp P Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof Proceedings of the International Conference on Intelligent Computer Mathematics - Volume 9150, (55-70)
- Voirol N, Kneuss E and Kuncak V Counter-example complete verification for higher-order functions Proceedings of the 6th ACM SIGPLAN Symposium on Scala, (18-29)
- Sergey I, Nanevski A and Banerjee A Mechanized verification of fine-grained concurrent programs Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, (77-87)
- Sjöberg V and Weirich S (2015). Programming up to Congruence, ACM SIGPLAN Notices, 50:1, (369-382), Online publication date: 11-May-2015.
- Sjöberg V and Weirich S Programming up to Congruence Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (369-382)
- Bertot Y Fixed Precision Patterns for the Formal Verification of Mathematical Constant Approximations Proceedings of the 2015 Conference on Certified Programs and Proofs, (147-155)
- Vazou N, Seidel E, Jhala R, Vytiniotis D and Peyton-Jones S (2014). Refinement types for Haskell, ACM SIGPLAN Notices, 49:9, (269-282), Online publication date: 26-Nov-2014.
- Chen Y, Hsu C, Lin H, Schwabe P, Tsai M, Wang B, Yang B and Yang S Verifying Curve25519 Software Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, (299-309)
- Sun M and Li Y Formal modeling and verification of complex interactions in e-government applications Proceedings of the 8th International Conference on Theory and Practice of Electronic Governance, (506-507)
- Zhang N, Duan Z, Tian C and Du D (2014). A formal proof of the deadline driven scheduler in PPTL axiomatic system, Theoretical Computer Science, 554:C, (229-253), Online publication date: 16-Oct-2014.
- Bahr P Composing and decomposing data types Proceedings of the 10th ACM SIGPLAN workshop on Generic programming, (71-82)
- Zsidó J (2014). Theorem of Three Circles in Coq, Journal of Automated Reasoning, 53:2, (105-127), Online publication date: 1-Aug-2014.
- Crafa S, Cunningham D, Saraswat V, Shinnar A and Tardieu O Semantics of Resilient X10 Proceedings of the 28th European Conference on ECOOP 2014 --- Object-Oriented Programming - Volume 8586, (670-696)
- Filaretti D and Maffeis S An Executable Formal Semantics of PHP Proceedings of the 28th European Conference on ECOOP 2014 --- Object-Oriented Programming - Volume 8586, (567-592)
- Paulson L Automated theorem proving for special functions Proceedings of the 2014 Symposium on Symbolic-Numeric Computation, (3-8)
- Poza M, Domínguez C, Heras J and Rubio J (2014). A Certified Reduction Strategy for Homological Image Processing, ACM Transactions on Computational Logic, 15:3, (1-23), Online publication date: 8-Jul-2014.
- Alglave J, Maranget L and Tautschnig M (2014). Herding Cats, ACM Transactions on Programming Languages and Systems, 36:2, (1-74), Online publication date: 1-Jul-2014.
- Thüm T, Apel S, Kästner C, Schaefer I and Saake G (2014). A Classification and Survey of Analysis Strategies for Software Product Lines, ACM Computing Surveys, 47:1, (1-45), Online publication date: 1-Jul-2014.
- Boer F and Gouw S Combining Monitoring with Run-Time Assertion Checking Advanced Lectures of the 14th International School on Formal Methods for Executable Software Models - Volume 8483, (217-262)
- Yang Z, Bodeveix J, Filali M, Hu K and Ma D A verified transformation Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems, (128-137)
- Visser W, Bjørner N and Shankar N Software engineering and automated deduction Future of Software Engineering Proceedings, (155-166)
- Christakis M, Leino K and Schulte W Formalizing and Verifying a Modern Build Language Proceedings of the 19th International Symposium on FM 2014: Formal Methods - Volume 8442, (643-657)
- BjØrner D and Havelund K 40 Years of Formal Methods Proceedings of the 19th International Symposium on FM 2014: Formal Methods - Volume 8442, (42-61)
- Leino K and Moskal M Co-induction Simply Proceedings of the 19th International Symposium on FM 2014: Formal Methods - Volume 8442, (382-398)
- Noschinski L, Rizkallah C and Mehlhorn K Verification of Certifying Computations through AutoCorres and Simpl Proceedings of the 6th International Symposium on NASA Formal Methods - Volume 8430, (46-61)
- Nanevski A, Ley-Wild R, Sergey I and Delbianco G Communicating State Transition Systems for Fine-Grained Concurrent Resources Proceedings of the 23rd European Symposium on Programming Languages and Systems - Volume 8410, (290-310)
- Dabrowski F, Loulergue F and Pinsard T Nested atomic sections with thread escape Proceedings of the 29th Annual ACM Symposium on Applied Computing, (1585-1592)
- Moscato M, Pombo C and Frias M (2014). Dynamite, ACM Transactions on Software Engineering and Methodology, 23:2, (1-37), Online publication date: 1-Mar-2014.
- Delbianco G and Nanevski A (2013). Hoare-style reasoning with (algebraic) continuations, ACM SIGPLAN Notices, 48:9, (363-376), Online publication date: 12-Nov-2013.
- Ziliani B, Dreyer D, Krishnaswami N, Nanevski A and Vafeiadis V (2013). Mtac, ACM SIGPLAN Notices, 48:9, (87-100), Online publication date: 12-Nov-2013.
- Dapoigny R and Barlatier P A Typed Approach for Contextualizing the Part-Whole Relation Proceedings of the 8th International and Interdisciplinary Conference on Modeling and Using Context - Volume 8175, (1-14)
- Batory D, Höfner P, Möller B and Zelend A Features, modularity, and variation points Proceedings of the 5th International Workshop on Feature-Oriented Software Development, (9-16)
- Yang Z, Bodeveix J and Filali M (2013). A comparative study of two formal semantics of the SIGNAL language, Frontiers of Computer Science: Selected Publications from Chinese Universities, 7:5, (673-693), Online publication date: 1-Oct-2013.
- Delbianco G and Nanevski A Hoare-style reasoning with (algebraic) continuations Proceedings of the 18th ACM SIGPLAN international conference on Functional programming, (363-376)
- Ziliani B, Dreyer D, Krishnaswami N, Nanevski A and Vafeiadis V Mtac Proceedings of the 18th ACM SIGPLAN international conference on Functional programming, (87-100)
- Cave A and Pientka B First-class substitutions in contextual type theory Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice, (15-24)
- Jedynak W, Biernacka M and Biernacki D An operational foundation for the tactic language of Coq Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, (25-36)
- Garnacho M, Bodeveix J and Filali-Amine M A mechanized semantic framework for real-time systems Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems, (106-120)
- Rager D, Hunt W and Kaufmann M A parallelized theorem prover for a logic with parallel execution Proceedings of the 4th international conference on Interactive Theorem Proving, (435-450)
- Monin J and Shi X Handcrafted inversions made operational on operational semantics Proceedings of the 4th international conference on Interactive Theorem Proving, (338-353)
- Rahli V, Bickford M and Anand A Formal program optimization in nuprl using computational equivalence and partial types Proceedings of the 4th international conference on Interactive Theorem Proving, (261-278)
- Leino K Automating theorem proving with SMT Proceedings of the 4th international conference on Interactive Theorem Proving, (2-16)
- Wetzler N, Heule M and Hunt W Mechanical verification of SAT refutations with extended resolution Proceedings of the 4th international conference on Interactive Theorem Proving, (229-244)
- Gonthier G, Asperti A, Avigad J, Bertot Y, Cohen C, Garillot F, Le Roux S, Mahboubi A, O'Connor R, Biha S, Pasca I, Rideau L, Solovyev A, Tassi E and Théry L A machine-checked proof of the odd order theorem Proceedings of the 4th international conference on Interactive Theorem Proving, (163-179)
- Haftmann F, Krauss A, Kunčar O and Nipkow T Data refinement in Isabelle/HOL Proceedings of the 4th international conference on Interactive Theorem Proving, (100-115)
- Tankink C, Kaliszyk C, Urban J and Geuvers H Formal mathematics on display Proceedings of the 2013 international conference on Intelligent Computer Mathematics, (152-167)
- Mahboubi A The rooster and the butterflies Proceedings of the 2013 international conference on Intelligent Computer Mathematics, (1-18)
- Blanc R, Kuncak V, Kneuss E and Suter P An overview of the Leon verification system Proceedings of the 4th Workshop on Scala, (1-10)
- Ancona D and Zucca E Safe corecursion in coFJ Proceedings of the 15th Workshop on Formal Techniques for Java-like Programs, (1-7)
- Thomsen J, Clausen C, Andersen K, Danaher J and Ernst E Reducing lookups for invariant checking Proceedings of the 27th European conference on Object-Oriented Programming, (426-450)
- Gordon C, Ernst M and Grossman D (2013). Rely-guarantee references for refinement types over aliased mutable data, ACM SIGPLAN Notices, 48:6, (73-84), Online publication date: 23-Jun-2013.
- Gordon C, Ernst M and Grossman D Rely-guarantee references for refinement types over aliased mutable data Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, (73-84)
- Shankar N Automated reasoning, fast and slow Proceedings of the 24th international conference on Automated Deduction, (145-161)
- Boyer F, Gruber O and Pous D Robust reconfigurations of component assemblies Proceedings of the 2013 International Conference on Software Engineering, (13-22)
- Leino K and Polikarpova N Verified Calculations Revised Selected Papers of the 5th International Conference on Verified Software: Theories, Tools, Experiments - Volume 8164, (170-190)
- Vazou N, Rondon P and Jhala R Abstract refinement types Proceedings of the 22nd European conference on Programming Languages and Systems, (209-228)
- Farmer A, Gill A, Komp E and Sculthorpe N (2012). The HERMIT in the machine, ACM SIGPLAN Notices, 47:12, (1-12), Online publication date: 17-Jan-2013.
- Urban J and Vyskočil J Theorem proving in large formal mathematics as an emerging AI field Automated Reasoning and Mathematics, (240-257)
- de Moura L and Passmore G The strategy challenge in SMT solving Automated Reasoning and Mathematics, (15-44)
- Boichut Y, Boyer B, Genet T and Legay A Equational abstraction refinement for certified tree regular model checking Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering, (299-315)
- Harrison W, Procter A and Allwein G The confinement problem in the presence of faults Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering, (182-197)
- Barbier F and Cariou E Inductive UML Proceedings of the 2nd international conference on Model and Data Engineering, (153-161)
- De Fraine B, Ernst E and Südholt M (2012). Essential AOP, ACM Transactions on Programming Languages and Systems, 34:3, (1-43), Online publication date: 1-Oct-2012.
- Reitblatt M, Foster N, Rexford J, Schlesinger C and Walker D (2012). Abstractions for network update, ACM SIGCOMM Computer Communication Review, 42:4, (323-334), Online publication date: 24-Sep-2012.
- Foster S, Rypáček O and Struth G Correctness of object oriented models by extended type inference Proceedings of the 9th international conference on Theoretical Aspects of Computing, (46-60)
- Moreira N, Pereira D and Melo de Sousa S Deciding regular expressions (in-)equivalence in coq Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science, (98-113)
- Farmer A, Gill A, Komp E and Sculthorpe N The HERMIT in the machine Proceedings of the 2012 Haskell Symposium, (1-12)
- Lawrence A, Berger U and Seisenberger M (2012). Extracting a DPLL Algorithm, Electronic Notes in Theoretical Computer Science (ENTCS), 286, (243-256), Online publication date: 1-Sep-2012.
- Reitblatt M, Foster N, Rexford J, Schlesinger C and Walker D Abstractions for network update Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication, (323-334)
- Bourke T, Daum M, Klein G and Kolanski R Challenges and experiences in managing large-scale proofs Proceedings of the 11th international conference on Intelligent Computer Mathematics, (32-48)
- Constable R On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science, (2-8)
- Awodey S, Gambino N and Sojakova K Inductive Types in Homotopy Type Theory Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science, (95-104)
- Armstrong A, Foster S and Struth G Dependently typed programming based on automated theorem proving Proceedings of the 11th international conference on Mathematics of Program Construction, (220-240)
- Dietl W, Dietzel S, Ernst M, Mote N, Walker B, Cooper S, Pavlik T and Popović Z Verification games Proceedings of the 14th Workshop on Formal Techniques for Java-like Programs, (42-49)
- Ancona D and Zucca E Corecursive Featherweight Java Proceedings of the 14th Workshop on Formal Techniques for Java-like Programs, (3-10)
- Cook C, Harton H, Smith H and Sitaraman M Specification engineering and modular verification using a web-integrated verifying compiler Proceedings of the 34th International Conference on Software Engineering, (1379-1382)
- Toronto N and McCarthy J Computing in cantor's paradise with λZFC Proceedings of the 11th international conference on Functional and Logic Programming, (290-306)
- Asperti A and Guidi F Type systems for dummies Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation, (79-90)
- Yorgey B, Weirich S, Cretin J, Peyton Jones S, Vytiniotis D and Magalhães J Giving Haskell a promotion Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation, (53-66)
- Filliâtre J Verifying two lines of c with why3 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments, (83-97)
- Herms P, Marché C and Monate B A certified multi-prover verification condition generator Proceedings of the 4th international conference on Verified Software: theories, tools, experiments, (2-17)
- Cave A and Pientka B Programming with binders and indexed data-types Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (413-424)
- Chugh R, Rondon P and Jhala R Nested refinements Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (231-244)
- Katayama S An analytical inductive functional programming system that avoids unintended programs Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation, (43-52)
- Cave A and Pientka B (2012). Programming with binders and indexed data-types, ACM SIGPLAN Notices, 47:1, (413-424), Online publication date: 18-Jan-2012.
- Chugh R, Rondon P and Jhala R (2012). Nested refinements, ACM SIGPLAN Notices, 47:1, (231-244), Online publication date: 18-Jan-2012.
- Hallerstede S and Leuschel M (2011). Experiments in program verification using Event-B, Formal Aspects of Computing, 24:1, (97-125), Online publication date: 1-Jan-2012.
- Shi X, Monin J, Tuong F and Blanqui F First steps towards the certification of an ARM simulator using compcert Proceedings of the First international conference on Certified Programs and Proofs, (346-361)
- Nguyen T and Marché C Hardware-dependent proofs of numerical programs Proceedings of the First international conference on Certified Programs and Proofs, (314-329)
- Nakata K, Uustalu T and Bezem M A proof pearl with the fan theorem and bar induction Proceedings of the 9th Asian conference on Programming Languages and Systems, (353-368)
- Ono K, Hirai Y, Tanabe Y, Noda N and Hagiya M Using Coq in specification and program extraction of hadoop mapreduce applications Proceedings of the 9th international conference on Software engineering and formal methods, (350-365)
- Delaware B, Cook W and Batory D Product lines of theorems Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications, (595-608)
- Delaware B, Cook W and Batory D (2011). Product lines of theorems, ACM SIGPLAN Notices, 46:10, (595-608), Online publication date: 18-Oct-2011.
- Leucker M Teaching runtime verification Proceedings of the Second international conference on Runtime verification, (34-48)
- Swamy N, Chen J, Fournet C, Strub P, Bhargavan K and Yang J Secure distributed programming with value-dependent types Proceedings of the 16th ACM SIGPLAN international conference on Functional programming, (266-278)
- Gava F, Gesbert L and Loulergue F Type system for a safe execution of parallel programs in BSML Proceedings of the fifth international workshop on High-level parallel programming and applications, (27-34)
- Swamy N, Chen J, Fournet C, Strub P, Bhargavan K and Yang J (2011). Secure distributed programming with value-dependent types, ACM SIGPLAN Notices, 46:9, (266-278), Online publication date: 18-Sep-2011.
- Suter P, Köksal A and Kuncak V Satisfiability modulo recursive programs Proceedings of the 18th international conference on Static analysis, (298-315)
- Javed N and Loulergue F Verification of a heat diffusion simulation written with orléans skeleton library Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II, (91-100)
- Bettini L A DSL for writing type systems for Xtext languages Proceedings of the 9th International Conference on Principles and Practice of Programming in Java, (31-40)
- Frade M and Pinto J (2011). Verification conditions for source-level imperative programs, Computer Science Review, 5:3, (252-277), Online publication date: 1-Aug-2011.
- Krebbers R and Spitters B Computer certified efficient exact reals in Coq Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics, (90-106)
- Heras J, Poza M, Dénès M and Rideau L Incidence simplicial matrices formalized in Coq/SSReflect Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics, (30-44)
- Ingesman M and Ernst E Lifted Java Proceedings of the 49th international conference on Objects, models, components, patterns, (179-193)
- De Dios J and Peña R Certification of safe polynomial memory bounds Proceedings of the 17th international conference on Formal methods, (184-199)
- Foster S, Struth G and Weber T Automated engineering of relational and algebraic methods in isabelle/hol Proceedings of the 12th international conference on Relational and algebraic methods in computer science, (52-67)
- Dragoni N, Lostal E, Papini D and Fabra J SC2 Proceedings of the 4th Canada-France MITACS conference on Foundations and Practice of Security, (32-48)
- Mehnert H Kopitiam Proceedings of the Third international conference on NASA Formal methods, (518-524)
- Matthes R (2011). Map fusion for nested datatypes in intensional type theory, Science of Computer Programming, 76:3, (204-224), Online publication date: 1-Mar-2011.
- van Gastel B, Lensink L, Smetsers S and van Eekelen M (2011). Deadlock and starvation free reentrant readers-writers, Science of Computer Programming, 76:2, (82-99), Online publication date: 1-Feb-2011.
- Winwood S and Chakravarty M Singleton Proceedings of the 7th ACM SIGPLAN workshop on Types in language design and implementation, (3-14)
- Kong S, Jung Y, David C, Wang B and Yi K Automatically inferring quantified loop invariants by algorithmic learning from simple templates Proceedings of the 8th Asian conference on Programming languages and systems, (328-343)
- Miller D Reasoning about computations using two-levels of logic Proceedings of the 8th Asian conference on Programming languages and systems, (34-46)
- Futatsugi K Fostering proof scores in CafeOBJ Proceedings of the 12th international conference on Formal engineering methods and software engineering, (1-20)
- Butterfield A Saoithín Proceedings of the Third international conference on Unifying theories of programming, (137-156)
- Calegari D, Luna C, Szasz N and Tasistro Á A type-theoretic framework for certified model transformations Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications, (112-127)
- Roberson M and Boyapati C (2010). Efficient modular glass box software model checking, ACM SIGPLAN Notices, 45:10, (4-21), Online publication date: 17-Oct-2010.
- Roberson M and Boyapati C Efficient modular glass box software model checking Proceedings of the ACM international conference on Object oriented programming systems languages and applications, (4-21)
- Tobin-Hochstadt S and Felleisen M (2010). Logical types for untyped languages, ACM SIGPLAN Notices, 45:9, (117-128), Online publication date: 27-Sep-2010.
- Vytiniotis D and Kennedy A (2010). Functional pearl, ACM SIGPLAN Notices, 45:9, (15-26), Online publication date: 27-Sep-2010.
- Tobin-Hochstadt S and Felleisen M Logical types for untyped languages Proceedings of the 15th ACM SIGPLAN international conference on Functional programming, (117-128)
- Vytiniotis D and Kennedy A Functional pearl Proceedings of the 15th ACM SIGPLAN international conference on Functional programming, (15-26)
- Felty A Hybrid Proceedings of the third ACM SIGPLAN workshop on Mathematically structured functional programming, (1-2)
- Altenhofen M and Brucker A Practical issues with formal specifications Proceedings of the 15th international conference on Formal methods for industrial critical systems, (17-32)
- Darbari A, Fischer B and Marques-Silva J Industrial-strength certified SAT solving through verified SAT proof checking Proceedings of the 7th International colloquium conference on Theoretical aspects of computing, (260-274)
- Kufleitner M and Lauser A Partially ordered two-way büchi automata Proceedings of the 15th international conference on Implementation and application of automata, (181-190)
- Almeida J, Moreira N, Pereira D and de Sousa S Partial derivative automata formalized in Coq Proceedings of the 15th international conference on Implementation and application of automata, (59-68)
- OConnor R and Spitters B (2010). A computer-verified monadic functional implementation of the integral, Theoretical Computer Science, 411:37, (3386-3402), Online publication date: 1-Aug-2010.
- Sakurai K and Asai K Mikibeta Proceedings of the 20th international conference on Logic-based program synthesis and transformation, (84-98)
- Fuchs L and Théry L A formalization of grassmann-cayley algebra in COQ and its application to theorem proving in projective geometry Proceedings of the 8th international conference on Automated Deduction in Geometry, (51-67)
- Cristiá M and Plüss B Generating natural language descriptions of Z test cases Proceedings of the 6th International Natural Language Generation Conference, (173-177)
- Paşca I Formally verified conditions for regularity of interval matrices Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics, (219-233)
- Domínguez C and Rubio J Computing in coq with infinite algebraic data structures Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics, (204-218)
- Cohen C and Mahboubi A A formal quantifier elimination for algebraically closed fields Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics, (189-203)
- Butelle F, Hivert F, Mayero M and Toumazet F Formal proof of SCHUR conjugate function Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics, (158-171)
- De Fraine B, Ernst E and Südholt M Essential AOP Proceedings of the 24th European conference on Object-oriented programming, (101-125)
- Chen J, Chugh R and Swamy N (2010). Type-preserving compilation of end-to-end verification of security enforcement, ACM SIGPLAN Notices, 45:6, (412-423), Online publication date: 12-Jun-2010.
- Chlipala A (2010). Ur, ACM SIGPLAN Notices, 45:6, (122-133), Online publication date: 12-Jun-2010.
- Chen J, Chugh R and Swamy N Type-preserving compilation of end-to-end verification of security enforcement Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation, (412-423)
- Chlipala A Ur Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation, (122-133)
- Pientka B Beluga Proceedings of the 10th international conference on Functional and Logic Programming, (1-12)
- Hamid N and Castleberry C Formally certified stable marriages Proceedings of the 48th annual ACM Southeast Conference, (1-6)
- Löh A, McBride C and Swierstra W (2010). A Tutorial Implementation of a Dependently Typed Lambda Calculus, Fundamenta Informaticae, 102:2, (177-207), Online publication date: 1-Apr-2010.
- Vogels F, Jacobs B and Piessens F A machine-checked soundness proof for an efficient verification condition generator Proceedings of the 2010 ACM Symposium on Applied Computing, (2517-2522)
- Srivastava S, Gulwani S and Foster J From program verification to program synthesis Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (313-326)
- Malecha G, Morrisett G, Shinnar A and Wisnesky R Toward a verified relational database management system Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (237-248)
- Srivastava S, Gulwani S and Foster J (2010). From program verification to program synthesis, ACM SIGPLAN Notices, 45:1, (313-326), Online publication date: 2-Jan-2010.
- Malecha G, Morrisett G, Shinnar A and Wisnesky R (2010). Toward a verified relational database management system, ACM SIGPLAN Notices, 45:1, (237-248), Online publication date: 2-Jan-2010.
- Shankar N Fixpoints and search in PVS Advanced Lectures on Software Engineering, (140-161)
- Adams R and Luo Z (2010). Weyl's predicative classical mathematics as a logic-enriched type theory, ACM Transactions on Computational Logic, 11:2, (1-29), Online publication date: 1-Jan-2010.
- Shankar N (2009). Automated deduction for verification, ACM Computing Surveys, 41:4, (1-56), Online publication date: 1-Oct-2009.
- McBride C Let's see how things unfold Proceedings of the 3rd international conference on Algebra and coalgebra in computer science, (113-126)
- Unno H and Kobayashi N Dependent type inference with interpolants Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, (277-288)
- Felty A and Momigliano A Reasoning with hypothetical judgments and open terms in hybrid Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, (83-92)
- del Vado Vírseda R A higher-order logical framework for the algorithmic debugging and verification of declarative programs Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, (49-60)
- Chlipala A, Malecha G, Morrisett G, Shinnar A and Wisnesky R (2009). Effective interactive proofs for higher-order imperative programs, ACM SIGPLAN Notices, 44:9, (79-90), Online publication date: 31-Aug-2009.
- Chlipala A, Malecha G, Morrisett G, Shinnar A and Wisnesky R Effective interactive proofs for higher-order imperative programs Proceedings of the 14th ACM SIGPLAN international conference on Functional programming, (79-90)
- Verbruggen W, de Vries E and Hughes A Polytypic properties and proofs in Coq Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming, (1-12)
- Delaware B, Cook W and Batory D Fitting the pieces together Proceedings of the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering, (243-252)
- Biha S Finite Groups Representation Theory with Coq Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics, (438-452)
- Calude C and Müller C Formal Proof Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics, (217-232)
- Boldo S, Filliâtre J and Melquiond G Combining Coq and Gappa for Certifying Floating-Point Programs Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics, (59-74)
- Leroy X (2009). Formal verification of a realistic compiler, Communications of the ACM, 52:7, (107-115), Online publication date: 1-Jul-2009.
- Zee K, Kuncak V and Rinard M An integrated proof language for imperative programs Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation, (338-351)
- Tristan J and Leroy X Verified validation of lazy code motion Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation, (316-326)
- Rendel T, Ostermann K and Hofer C Typed self-representation Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation, (293-303)
- Hooimeijer P and Weimer W A decision procedure for subset constraints over regular languages Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation, (188-198)
- Monniaux D (2009). A minimalistic look at widening operators, Higher-Order and Symbolic Computation, 22:2, (145-154), Online publication date: 1-Jun-2009.
- Zee K, Kuncak V and Rinard M (2009). An integrated proof language for imperative programs, ACM SIGPLAN Notices, 44:6, (338-351), Online publication date: 28-May-2009.
- Tristan J and Leroy X (2009). Verified validation of lazy code motion, ACM SIGPLAN Notices, 44:6, (316-326), Online publication date: 28-May-2009.
- Rendel T, Ostermann K and Hofer C (2009). Typed self-representation, ACM SIGPLAN Notices, 44:6, (293-303), Online publication date: 28-May-2009.
- Hooimeijer P and Weimer W (2009). A decision procedure for subset constraints over regular languages, ACM SIGPLAN Notices, 44:6, (188-198), Online publication date: 28-May-2009.
- Jorge J, Gulias V and Freire J (2009). Certifying properties of an efficient functional program for computing Gröbner bases, Journal of Symbolic Computation, 44:5, (571-582), Online publication date: 1-May-2009.
- Blech J and Périn M Certifying deadlock-freedom for BIP models Proceedings of th 12th International Workshop on Software and Compilers for Embedded Systems, (61-70)
- Magaud N, Narboux J and Schreck P Formalizing Desargues' theorem in Coq using ranks Proceedings of the 2009 ACM symposium on Applied Computing, (1110-1115)
- Swamy N and Hicks M (2009). Verified enforcement of stateful information release policies, ACM SIGPLAN Notices, 43:12, (21-31), Online publication date: 28-Feb-2009.
- Leroy X and Grall H (2009). Coinductive big-step operational semantics, Information and Computation, 207:2, (284-304), Online publication date: 1-Feb-2009.
- Dagand P, Kostić D and Kuncak V Opis Proceedings of the 4th international workshop on Types in language design and implementation, (65-78)
- Norell U Dependently typed programming in Agda Proceedings of the 4th international workshop on Types in language design and implementation, (1-2)
- Licata D and Harper R Positively dependent types Proceedings of the 3rd workshop on Programming languages meets program verification, (3-14)
- Gacek A, Miller D and Nadathur G (2009). Reasoning in Abella about Structural Operational Semantics Specifications, Electronic Notes in Theoretical Computer Science (ENTCS), 228, (85-100), Online publication date: 1-Jan-2009.
- Avellone A, Fiorino G and Moscato U (2008). Optimization techniques for propositional intuitionistic logic and their implementation, Theoretical Computer Science, 409:1, (41-58), Online publication date: 1-Dec-2008.
- Chlipala A (2008). Parametric higher-order abstract syntax for mechanized semantics, ACM SIGPLAN Notices, 43:9, (143-156), Online publication date: 27-Sep-2008.
- Magaud N, Narboux J and Schreck P Formalizing projective plane geometry in Coq Proceedings of the 7th international conference on Automated deduction in geometry, (141-162)
- Aldrich J, Simmons R and Shin K SASyLF Proceedings of the 2008 international workshop on Functional and declarative programming in education, (31-40)
- Verbruggen W, de Vries E and Hughes A Polytypic programming in COQ Proceedings of the ACM SIGPLAN workshop on Generic programming, (49-60)
- Chlipala A Parametric higher-order abstract syntax for mechanized semantics Proceedings of the 13th ACM SIGPLAN international conference on Functional programming, (143-156)
- Chlipala A (2008). Modular development of certified program verifiers with a proof assistant1,2, Journal of Functional Programming, 18:5-6, (599-647), Online publication date: 1-Sep-2008.
- Boyer B, Genet T and Jensen T Certifying a Tree Automata Completion Checker Proceedings of the 4th international joint conference on Automated Reasoning, (523-538)
- Verchinine K, Lyaletski A, Paskevich A and Anisimov A On Correctness of Mathematical Texts from a Logical and Practical Point of View Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics, (583-598)
- Jorge J, Gulias V and Castro L Using Coq to Prove Properties of the Cache Level of a Functional Video-on-Demand Server Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics, (296-299)
- Bertot Y and Komendantsky V Fixed point semantics and partial recursion in Coq Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming, (89-96)
- Silva P and Oliveira J 'Galculator' Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming, (44-55)
- Leroy X and Blazy S (2008). Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations, Journal of Automated Reasoning, 41:1, (1-31), Online publication date: 1-Jul-2008.
- Swamy N and Hicks M Verified enforcement of stateful information release policies Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security, (21-32)
- Zee K, Kuncak V and Rinard M Full functional verification of linked data structures Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation, (349-361)
- Bertot Y and Komendantskaya E (2008). Inductive and Coinductive Components of Corecursive Functions in Coq, Electronic Notes in Theoretical Computer Science (ENTCS), 203:5, (25-47), Online publication date: 1-Jun-2008.
- Zee K, Kuncak V and Rinard M (2008). Full functional verification of linked data structures, ACM SIGPLAN Notices, 43:6, (349-361), Online publication date: 30-May-2008.
- Jeuring J, Leather S, Magalhães J and Yakushev A Libraries for generic programming in haskell Proceedings of the 6th international conference on Advanced functional programming, (165-229)
- Unno H and Kobayashi N On-demand refinement of dependent types Proceedings of the 9th international conference on Functional and logic programming, (81-96)
- Julien N Certified exact real arithmetic using co-induction in arbitrary integer base Proceedings of the 9th international conference on Functional and logic programming, (48-63)
- Abel A, Coquand T and Dybjer P On the algebraic foundation of proof assistants for intuitionistic type theory Proceedings of the 9th international conference on Functional and logic programming, (3-13)
- Tristan J and Leroy X (2008). Formal verification of translation validators, ACM SIGPLAN Notices, 43:1, (17-27), Online publication date: 14-Jan-2008.
- Tristan J and Leroy X Formal verification of translation validators Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (17-27)
- Dévai G (2008). Programming language elements for correctness proofs, Acta Cybernetica, 18:3, (403-425), Online publication date: 1-Jan-2008.
- Felty A (2007). Tutorial Examples of the Semantic Approach to Foundational Proof-Carrying Code, Fundamenta Informaticae, 77:4, (303-330), Online publication date: 1-Dec-2007.
- Ogata K and Futatsugi K (2007). State Machines as Inductive Types, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E90-A:12, (2985-2988), Online publication date: 1-Dec-2007.
- Capretta V, Stepien B, Felty A and Matwin S Formal correctness of conflict detection for firewalls Proceedings of the 2007 ACM workshop on Formal methods in security engineering, (22-30)
- Whitehead N, Johnson J and Abadi M Policies and proofs for code auditing Proceedings of the 5th international conference on Automated technology for verification and analysis, (1-14)
- Conchon S and Filliâtre J A persistent union-find data structure Proceedings of the 2007 workshop on Workshop on ML, (37-46)
- Bakhshi R, Bonnet F, Fokkink W and Haverkort B (2007). Formal analysis techniques for gossiping protocols, ACM SIGOPS Operating Systems Review, 41:5, (28-36), Online publication date: 1-Oct-2007.
- Swierstra W and Altenkirch T Beauty in the beast Proceedings of the ACM SIGPLAN workshop on Haskell workshop, (25-36)
- Darvas Á and Müller P Faithful mapping of model classes to mathematical structures Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, (31-38)
- Felty A (2007). Tutorial Examples of the Semantic Approach to Foundational Proof-Carrying Code, Fundamenta Informaticae, 77:4, (303-330), Online publication date: 1-Aug-2007.
- Krauss A Certified Size-Change Termination Proceedings of the 21st international conference on Automated Deduction: Automated Deduction, (460-475)
- Couchot J and Lescuyer S Handling Polymorphism in Automated Deduction Proceedings of the 21st international conference on Automated Deduction: Automated Deduction, (263-278)
- Horozal F and Brown C Formal Representation of Mathematics in a Dependently Typed Set Theory Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference, (265-279)
- Andrés M, Lambán L and Rubio J Executing in Common Lisp, Proving in ACL2 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference, (1-12)
- Bove A and Capretta V Computation by prophecy Proceedings of the 8th international conference on Typed lambda calculi and applications, (70-83)
- Bauer A and Stone C RZ Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World, (28-42)
- Chlipala A A certified type-preserving compiler from lambda calculus to assembly language Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation, (54-65)
- Chlipala A (2007). A certified type-preserving compiler from lambda calculus to assembly language, ACM SIGPLAN Notices, 42:6, (54-65), Online publication date: 10-Jun-2007.
- Jacobs B, Smetsers S and Schreur R (2007). Code-carrying theories, Formal Aspects of Computing, 19:2, (191-203), Online publication date: 1-Jun-2007.
- Xi H Attributive types for proof erasure Proceedings of the 2007 international conference on Types for proofs and programs, (188-202)
- Matthes R and Strecker M Verification of the redecoration algorithm for triangular matrices Proceedings of the 2007 international conference on Types for proofs and programs, (125-141)
- Kozubek A and Urzyczyn P In the search of a naive type theory Proceedings of the 2007 international conference on Types for proofs and programs, (110-124)
- Atkey R CoqJVM Proceedings of the 2007 international conference on Types for proofs and programs, (18-32)
- Cleva J and López-Fraguas F (2007). Semantic Determinism and Functional Logic Program Properties, Electronic Notes in Theoretical Computer Science (ENTCS), 174:1, (3-15), Online publication date: 1-Apr-2007.
- Morimoto S, Shigematsu S, Goto Y and Cheng J Formal verification of security specifications with common criteria Proceedings of the 2007 ACM symposium on Applied computing, (1506-1512)
- Dufourd J A hypermap framework for computer-aided proofs in surface subdivisions Proceedings of the 2007 ACM symposium on Applied computing, (757-761)
- Jorge J, Gulias V and Castro L Verification of program properties using different theorem provers Proceedings of the 11th international conference on Computer aided systems theory, (233-240)
- Blanco A, Freire J and Freire J Using Coq to understand nested datatypes Proceedings of the 11th international conference on Computer aided systems theory, (210-216)
- Nistal J, Brañas E, Ferro A and Souto D On the representation of imperative programs in a logical framework Proceedings of the 11th international conference on Computer aided systems theory, (202-209)
- Mahboubi A (2007). Implementing the cylindrical algebraic decomposition within the Coq system, Mathematical Structures in Computer Science, 17:1, (99-127), Online publication date: 1-Feb-2007.
- Bertot Y (2007). Affine functions and series with co-inductive real numbers, Mathematical Structures in Computer Science, 17:1, (37-63), Online publication date: 1-Feb-2007.
- Abrial J, Butler M, Hallerstede S and Voisin L An open extensible tool environment for event-b Proceedings of the 8th international conference on Formal Methods and Software Engineering, (588-605)
- Janvier R, Lakhnech Y and Périn M (2006). Certifying cryptographic protocols by abstract model-checking and proof concretization, ACM SIGBED Review, 3:4, (37-57), Online publication date: 1-Oct-2006.
- Rypacek O, Backhouse R and Nilsson H Type-theoretic design patterns Proceedings of the 2006 ACM SIGPLAN workshop on Generic programming, (13-22)
- Narboux J Mechanical theorem proving in Tarski's geometry Proceedings of the 6th international conference on Automated deduction in geometry, (139-156)
- Krauss A Partial recursive functions in higher-order logic Proceedings of the Third international joint conference on Automated Reasoning, (589-603)
- Mahboubi A Proving formally the implementation of an efficient gcd algorithm for polynomials Proceedings of the Third international joint conference on Automated Reasoning, (438-452)
- Constable R and Moczydłowski W Extracting programs from constructive HOL proofs via IZF set-theoretic semantics Proceedings of the Third international joint conference on Automated Reasoning, (162-176)
- Swords S and Cook W Soundness of the simply typed lambda calculus in ACL2 Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications, (35-39)
- Matthes R A datastructure for iterated powers Proceedings of the 8th international conference on Mathematics of Program Construction, (299-315)
- Loulergue F, Benheddi R, Gava F and Louis-Régis D Bulk synchronous parallel ML Proceedings of the First international computer science conference on Theory and Applications, (475-486)
- Bortin M, Johnsen E and Lüth C (2006). Structured formal development in Isabelle, Nordic Journal of Computing, 13:1, (2-21), Online publication date: 1-Jun-2006.
- Morimoto S, Shigematsu S, Goto Y and Cheng J A security specification verification technique based on the international standard ISO/IEC 15408 Proceedings of the 2006 ACM symposium on Applied computing, (1802-1803)
- Whitehead N A certified distributed security logic for authorizing code Proceedings of the 2006 international conference on Types for proofs and programs, (253-268)
- Sozeau M Subset coercions in Coq Proceedings of the 2006 international conference on Types for proofs and programs, (237-252)
- Capretta V and Felty A Combining de Bruijn indices and higher-order abstract syntax in Coq Proceedings of the 2006 international conference on Types for proofs and programs, (63-77)
- Besson F Fast reflexive arithmetic tactics the linear case and beyond Proceedings of the 2006 international conference on Types for proofs and programs, (48-62)
- Leroy X Coinductive big-step operational semantics Proceedings of the 15th European conference on Programming Languages and Systems, (54-68)
- Leroy X (2006). Formal certification of a compiler back-end or, ACM SIGPLAN Notices, 41:1, (42-54), Online publication date: 12-Jan-2006.
- Leroy X Formal certification of a compiler back-end or Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (42-54)
- Seino T, Ogata K and Futatsugi K (2006). A Toolkit for Generating and Displaying Proof Scores in the OTS/CafeOBJ Method, Electronic Notes in Theoretical Computer Science (ENTCS), 147:1, (57-72), Online publication date: 1-Jan-2006.
- Duprat J (2005). About Constructive vectors, Electronic Notes in Theoretical Computer Science (ENTCS), 140, (93-100), Online publication date: 1-Nov-2005.
- Blazy S and Leroy X Formal verification of a memory model for C-like imperative languages Proceedings of the 7th international conference on Formal Methods and Software Engineering, (280-299)
- Abel A, Benke M, Bove A, Hughes J and Norell U Verifying haskell programs using constructive type theory Proceedings of the 2005 ACM SIGPLAN workshop on Haskell, (62-73)
- Brotherston J Cyclic proofs for first-order logic with inductive definitions Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods, (78-92)
- Raths T, Otten J and Kreitz C The ILTP library Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods, (333-337)
- Otten J Clausal connection-based theorem proving in intuitionistic first-order logic Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods, (245-261)
- Grégoire B and Mahboubi A Proving equalities in a commutative ring done right in coq Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics, (98-113)
- Huffman B, Matthews J and White P Axiomatic constructor classes in Isabelle/HOLCF Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics, (147-162)
- Autexier S, Benzmüller C, Dietrich D, Meier A and Wirth C A generic modular data structure for proof attempts alternating on ideas and granularity Proceedings of the 4th international conference on Mathematical Knowledge Management, (126-142)
- Cairns P and Gow J Literate proving Proceedings of the 4th international conference on Mathematical Knowledge Management, (159-173)
- Bertot Y Filters on coinductive streams, an application to eratosthenes' sieve Proceedings of the 7th international conference on Typed Lambda Calculi and Applications, (102-115)
- Freire J, Freire E and Blanco A On recursive functions and well–founded relations in the calculus of constructions Proceedings of the 10th international conference on Computer Aided Systems Theory, (69-80)
- Sato M A simple theory of expressions, judgments and derivations Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday, (437-451)
- Lüth C, Roggenbach M and Schröder L CCC Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques, (94-105)
Index Terms
- Interactive Theorem Proving and Program Development
Recommendations
Verifying safety properties of a nonlinear control by interactive theorem proving with the Prototype Verification System
Interactive, or computer-assisted, theorem proving is the verification of statements in a formal system, where the proof is developed by a logician who chooses the appropriate inference steps, in turn executed by an automatic theorem prover. In this ...
Theorem proving: not an esoteric diversion, but the unifying framework for industrial verification
ICCD '95: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and ProcessorsThe effectiveness of hardware verification techniques has increased markedly in the past decade. As hardware verification techniques become increasingly powerful the idea of transitioning verification technology to industry can be taken seriously. ...
Combining Theorem Proving with Model Checking through Predicate Abstraction
This article presents a procedure for proving invariants of infinite-state reactive systems using a combination of two formal verification techniques: theorem proving and model checking. This method uses term rewriting on the definition of the target ...