Skip header Section
Skip Bibliometrics Section
Isabelle/HOL: a proof assistant for higher-order logicJanuary 2002
Abstract
No abstract available.
- David Aspinall. Proof General. http://www.proofgeneral.org.Google Scholar
- David Aspinall. Proof General: A generic tool for proof development. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 1785 of Lecture Notes in Computer Science, pages 38-42. Springer-Verlag, 2000.Google Scholar
- Franz Baader and Tobias Nipkow. Term Rewriting and All That. Cambridge University Press, 1998. Google ScholarDigital Library
- Gertrud Bauer, Tobias Nipkow, David von Oheimb, Lawrence C Paulson, Thomas M Rasmussen, Christophe Tabacznyj, and MarkusWenzel. The supplemental Isabelle/HOL library. Part of the Isabelle distribution, http://isabelle.in.tum.de/library/HOL/Library/document.pdf, 2002.Google Scholar
- Richard Bird. Introduction to Functional Programming using Haskell. Prentice-Hall, 1998. Google ScholarDigital Library
- M. Burrows, M. Abadi, and R. M. Needham. A logic of authentication. Proceedings of the Royal Society of London, 426:233-271, 1989.Google ScholarCross Ref
- Edmund Clarke, Orna Grumberg, and Doron Peled. Model Checking. MIT Press, 1999.Google Scholar
- Jacques Fleuriot and Lawrence C. Paulson. Mechanizing nonstandard real analysis. LMS Journal of Computation and Mathematics, 3:140-190, 2000. http://www.lms.ac.uk/jcm/3/lms1999-027/.Google ScholarCross Ref
- Jean-Yves Girard. Proofs and Types. Cambridge University Press, 1989. Translated by Yves LaFont and Paul Taylor.Google ScholarDigital Library
- M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.Google ScholarDigital Library
- David Harel, Dexter Kozen, and Jerzy Tiuryn. Dynamic Logic. MIT Press, 2000.Google Scholar
- John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.Google ScholarDigital Library
- Paul Hudak. The Haskell School of Expression. Cambridge University Press, 2000.Google ScholarDigital Library
- Michael Huth and Mark Ryan. Logic in Computer Science. Modelling and reasoning about systems. Cambridge University Press, 2000.Google Scholar
- Donald E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, 1975.Google Scholar
- Gavin Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using CSP and FDR. In T. Margaria and B. Steffen, editors, Tools and Algorithms for the Construction and Analysis of Systems: second international workshop, TACAS'96, LNCS 1055, pages 147-166. Springer, 1996. Google Scholar
- Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, 1990.Google ScholarDigital Library
- Olaf Müller, Tobias Nipkow, David von Oheimb, and Oscar Slotosch. HOLCF = HOL + LCF. Journal of Functional Programming, 9:191- 223, 1999. Google ScholarDigital Library
- Wolfgang Naraschewski and Markus Wenzel. Object-oriented verification based on record subtyping in higher-order logic. In Jim Grundy and Malcom Newey, editors, Theorem Proving in Higher Order Logics: TPHOLs'98, LNCS 1479, 1998.Google Scholar
- Roger M. Needham and Michael D. Schroeder. Using encryption for authentication in large networks of computers. Communications of the ACM, 21(12):993-999, December 1978. Google ScholarDigital Library
- Tobias Nipkow. Functional unification of higher-order patterns. In M. Vardi, editor, Eighth Annual Symposium on Logic in Computer Science, pages 64-74. ieee Computer Society Press, 1993.Google ScholarCross Ref
- Tobias Nipkow, Lawrence C. Paulson, and Markus Wenzel. Isabelle's Logics: HOL. http://isabelle.in.tum.de/doc/logics-HOL.pdf.Google Scholar
- Lawrence C. Paulson. The Isabelle Reference Manual. http://isabelle. in.tum.de/doc/ref.pdf.Google Scholar
- Lawrence C. Paulson. Relations between secrets: Two formal analyses of the Yahalom protocol. Journal of Computer Security. in press.Google Scholar
- Lawrence C. Paulson. Logic and Computation: Interactive proof with Cambridge LCF. Cambridge University Press, 1987.Google ScholarCross Ref
- Lawrence C. Paulson. Isabelle: A Generic Theorem Prover. Springer, 1994. LNCS 828.Google Scholar
- Lawrence C. Paulson. ML for the Working Programmer. Cambridge University Press, 2nd edition, 1996.Google Scholar
- Lawrence C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6:85-128, 1998. Google ScholarDigital Library
- Lawrence C. Paulson. Inductive analysis of the Internet protocol TLS. ACM Transactions on Information and System Security, 2(3):332-351, August 1999. Google ScholarDigital Library
- F. J. Pelletier. Seventy-five problems for testing automatic theorem provers. Journal of Automated Reasoning, 2:191-216, 1986. Errata, JAR 4 (1988), 235-236 and JAR 18 (1997), 135.Google ScholarDigital Library
- Kenneth H. Rosen. Discrete Mathematics and Its Applications. McGraw-Hill, 1998.Google Scholar
- Simon Thompson. Haskell: The Craft of Functional Programming. Addison-Wesley, 1999.Google ScholarDigital Library
- Markus Wenzel. The Isabelle/Isar Reference Manual. http://isabelle.in. tum.de/doc/isar-ref.pdf.Google Scholar
- Markus Wenzel. Isabelle/Isar -- a versatile environment for humanreadable formal proof documents. PhD thesis, Institut für Informatik, Technische Universität München, 2002.Google Scholar
- Markus Wenzel and Stefan Berghofer. The Isabelle System Manual. http://isabelle.in.tum.de/doc/system.pdf.Google Scholar
Cited By
Lu M, Delaware B and Zhang T Proof Automation with Large Language Models Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering, (1509-1520)- Dardinier T, Li A and Müller P (2024). Hypra: A Deductive Program Verifier for Hyper Hoare Logic, Proceedings of the ACM on Programming Languages, 8:OOPSLA2, (1279-1308), Online publication date: 8-Oct-2024.
- Zueck D, Atallah N, Do I, Yao Z and Sani A Hora: High Assurance Periodic Availability Guarantee for Life-Critical Applications on Smartphones Proceedings of the 15th ACM SIGOPS Asia-Pacific Workshop on Systems, (115-121)
- Dardinier T and Müller P (2024). Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties, Proceedings of the ACM on Programming Languages, 8:PLDI, (1485-1509), Online publication date: 20-Jun-2024.
- Hoag A, Kostas J, Silva B, Thomas P and Brun Y Seldonian Toolkit: Building Software with Safe and Fair Machine Learning Proceedings of the 45th International Conference on Software Engineering: Companion Proceedings, (107-111)
- Agrawal A, First E, Kaufman Z, Reichel T, Zhang S, Zhou T, Sanchez-Stern A, Ringer T and Brun Y Proofster: Automated Formal Verification Proceedings of the 45th International Conference on Software Engineering: Companion Proceedings, (26-30)
- Erata F, Deng S, Zaghloul F, Xiong W, Demir O and Szefer J (2022). Survey of Approaches and Techniques for Security Verification of Computer Systems, ACM Journal on Emerging Technologies in Computing Systems, 19:1, (1-34), Online publication date: 31-Jan-2023.
- Guo Y, Wang Z, Zhong B and Zeng Q Formal Modeling and Security Analysis for Intra-level Privilege Separation Proceedings of the 38th Annual Computer Security Applications Conference, (88-101)
- Debant A, Delaune S and Wiedling C (2022). So Near and Yet So Far – Symbolic Verification of Distance-Bounding Protocols, ACM Transactions on Privacy and Security, 25:2, (1-39), Online publication date: 31-May-2022.
- First E and Brun Y Diversity-driven automated formal verification Proceedings of the 44th International Conference on Software Engineering, (749-761)
- Milehins M An extension of the framework types-to-sets for Isabelle/HOL Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs, (180-196)
- Wang Y, He J, Zhu N, Yi Y, Zhang Q, Song H and Xue R (2021). Security enhancement technologies for smart contracts in the blockchain, Transactions on Emerging Telecommunications Technologies, 32:12, Online publication date: 8-Dec-2021.
- Yuan S and Talpin J Verified functional programming of an IoT operating system's bootloader Proceedings of the 19th ACM-IEEE International Conference on Formal Methods and Models for System Design, (89-97)
- Lehr J, Bischof C, Dewald F, Mantel H, Norouzi M and Wolf F Tool-Supported Mini-App Extraction to Facilitate Program Analysis and Parallelization 50th International Conference on Parallel Processing, (1-10)
- Dupont G, Ait-Ameur Y, Singh N and Pantel M (2021). Event-B Hybridation, ACM Transactions on Embedded Computing Systems, 20:4, (1-37), Online publication date: 31-Jul-2021.
- Burjons E, Frei F and Raszyk M From finite-valued nondeterministic transducers to deterministic two-tape automata Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-13)
- Chen H, Pendleton M, Njilla L and Xu S (2020). A Survey on Ethereum Systems Security, ACM Computing Surveys, 53:3, (1-43), Online publication date: 31-May-2021.
- Sanan D, Zhao Y, Lin S and Yang L (2021). CSim, ACM Transactions on Programming Languages and Systems, 43:1, (1-46), Online publication date: 31-Mar-2021.
- Becker H, Bos N, Gavran I, Darulova E and Majumdar R Lassie: HOL4 tactics by example Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, (212-223)
- Hu J and Carette J Formalizing category theory in Agda Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, (327-342)
- Khan W, Khan F, Derhab A, Alhudhaif A and Chen H (2021). CoCEC, Complexity, 2021, Online publication date: 1-Jan-2021.
- Sachtleben R An Executable Mechanised Formalisation of an Adaptive State Counting Algorithm Testing Software and Systems, (236-254)
- First E, Brun Y and Guha A (2020). TacTok: semantics-aware proof synthesis, Proceedings of the ACM on Programming Languages, 4:OOPSLA, (1-31), Online publication date: 13-Nov-2020.
- Hance T, Lattuada A, Hawblitzel C, Howell J, Johnson R and Parno B Storage systems are distributed systems (so verify them that way!) Proceedings of the 14th USENIX Conference on Operating Systems Design and Implementation, (99-115)
- Hähnle R, Heydari Tabar A, Mazaheri A, Norouzi M, Steinhöfel D and Wolf F Safer Parallelization Leveraging Applications of Formal Methods, Verification and Validation: Engineering Principles, (117-137)
- Lamela Seijas P, Smith D and Thompson S Efficient Static Analysis of Marlowe Contracts Leveraging Applications of Formal Methods, Verification and Validation: Applications, (161-177)
- Gurov D, Hähnle R and Kamburjan E Who Carries the Burden of Modularity? Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles, (3-21)
- Verbeek F, Olivier P and Ravindran B Sound C Code Decompilation for a Subset of x86-64 Binaries Software Engineering and Formal Methods, (247-264)
- Nguyen Van H, Balabonski T, Boulanger F, Keller C, Valiron B and Wolff B On the Semantics of Polychronous Polytimed Specifications Formal Modeling and Analysis of Timed Systems, (23-40)
- Selsam D, Hudon S and de Moura L (2020). Sealing pointer-based optimizations behind pure functions, Proceedings of the ACM on Programming Languages, 4:ICFP, (1-20), Online publication date: 2-Aug-2020.
- Nagashima Y Simple Dataset for Proof Method Recommendation in Isabelle/HOL Intelligent Computer Mathematics, (297-302)
- van Doorn F, Ebner G and Lewis R Maintaining a Library of Formal Mathematics Intelligent Computer Mathematics, (251-267)
- Kovács L, Lachnitt H and Szeider S Formalizing Graph Trail Properties in Isabelle/HOL Intelligent Computer Mathematics, (190-205)
- Fu Y and Yu W A Formalization of Properties of Continuous Functions on Closed Intervals Mathematical Software – ICMS 2020, (272-280)
- Sickert S and Esparza J An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, (831-844)
- From A, Blackburn P and Villadsen J Formalizing a Seligman-Style Tableau System for Hybrid Logic Automated Reasoning, (474-481)
- Passmore G, Cruanes S, Ignatovich D, Aitken D, Bray M, Kagan E, Kanishev K, Maclean E and Mometto N The Imandra Automated Reasoning System (System Description) Automated Reasoning, (464-471)
- Czajka Ł Practical Proof Search for Coq by Type Inhabitation Automated Reasoning, (28-57)
- Rau M and Nipkow T Verification of Closest Pair of Points Algorithms Automated Reasoning, (341-357)
- Baanen A A Lean Tactic for Normalising Ring Expressions with Exponents (Short Paper) Automated Reasoning, (21-27)
- Guttmann W Reasoning About Algebraic Structures with Implicit Carriers in Isabelle/HOL Automated Reasoning, (236-253)
- Nguyen T, Pham L, Sun J, Lin Y and Minh Q sFuzz Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering, (778-788)
- Bila E, Doherty S, Dongol B, Derrick J, Schellhorn G and Wehrheim H Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory Formal Techniques for Distributed Objects, Components, and Systems, (39-58)
- Bottesch R, Haslbeck M, Reynaud A and Thiemann R Verifying a Solver for Linear Mixed Integer Arithmetic in Isabelle/HOL NASA Formal Methods, (233-250)
- Abbas M, Ben-Yelles C and Rioboo R (2019). Formalizing UML/OCL structural features with FoCaLiZe, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 24:6, (4149-4164), Online publication date: 1-Mar-2020.
- Khan W, Kamran M, Naqvi S, Khan F, Alghamdi A, Alsolami E and Al-Turjman F (2020). Formal Verification of Hardware Components in Critical Systems, Wireless Communications & Mobile Computing, 2020, Online publication date: 1-Jan-2020.
- Xia L, Zakowski Y, He P, Hur C, Malecha G, Pierce B and Zdancewic S (2019). Interaction trees: representing recursive and impure programs in Coq, Proceedings of the ACM on Programming Languages, 4:POPL, (1-32), Online publication date: 1-Jan-2020.
- Moore J (2019). Milestones from the Pure Lisp theorem prover to ACL2, Formal Aspects of Computing, 31:6, (699-732), Online publication date: 1-Dec-2019.
- 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)
- Marmsoler D and Gidey H (2019). Interactive verification of architectural design patterns in FACTum, Formal Aspects of Computing, 31:5, (541-610), Online publication date: 1-Nov-2019.
- Ma H, Goel A, Jeannin J, Kapritsos M, Kasikci B and Sakallah K I4 Proceedings of the 27th ACM Symposium on Operating Systems Principles, (370-384)
- Reiher T, Senier A, Castrillon J and Strufe T RecordFlux: Formal Message Specification and Generation of Verifiable Binary Parsers Formal Aspects of Component Software, (170-190)
- Brucker A and Herzberg M A Formally Verified Model of Web Components Formal Aspects of Component Software, (51-71)
- Groote J, Keiren J, Luttik B, de Vink E and Willemse T Modelling and Analysing Software in mCRL2 Formal Aspects of Component Software, (25-48)
- 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.
- Marmsoler D and Blakqori G APML: An Architecture Proof Modeling Language Formal Methods – The Next 30 Years, (611-630)
- Smith G, Coughlin N and Murray T Value-Dependent Information-Flow Security on Weak Memory Models Formal Methods – The Next 30 Years, (539-555)
- Miyazawa A, Ribeiro P, Li W, Cavalcanti A, Timmis J and Woodcock J (2019). RoboChart, Software and Systems Modeling (SoSyM), 18:5, (3097-3149), Online publication date: 1-Oct-2019.
- Shukla N, Pandey M and Srivastava S (2019). Formal modeling and verification of software‐defined networks, International Journal of Network Management, 29:5, Online publication date: 12-Sep-2019.
- O'Connor L Deferring the details and deriving programs Proceedings of the 4th ACM SIGPLAN International Workshop on Type-Driven Development, (27-39)
- Bentkamp A, Blanchette J and Klakow D (2019). A Formal Proof of the Expressiveness of Deep Learning, Journal of Automated Reasoning, 63:2, (347-368), Online publication date: 1-Aug-2019.
- Walter M, Wille R, Große D, Torres F and Drechsler R (2019). Placement and Routing for Tile-based Field-coupled Nanocomputing Circuits Is NP-complete (Research Note), ACM Journal on Emerging Technologies in Computing Systems, 15:3, (1-10), Online publication date: 31-Jul-2019.
- Zhao J, Oliveira B and Schrijvers T (2019). A mechanical formalization of higher-ranked polymorphic type inference, Proceedings of the ACM on Programming Languages, 3:ICFP, (1-29), Online publication date: 26-Jul-2019.
- Unruh D Quantum Hoare logic with ghost variables Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-13)
- Libal T and Pascucci M Automated reasoning in normative detachment structures with ideal conditions Proceedings of the Seventeenth International Conference on Artificial Intelligence and Law, (63-72)
- Jones C and Yatapanage N (2019). Investigating the limits of rely/guarantee relations based on a concurrent garbage collector example, Formal Aspects of Computing, 31:3, (353-374), Online publication date: 1-Jun-2019.
- Ma H, Goel A, Jeannin J, Kapritsos M, Kasikci B and Sakallah K Towards Automatic Inference of Inductive Invariants Proceedings of the Workshop on Hot Topics in Operating Systems, (30-36)
- 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.
- 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.
- Nikolić M, Marinković V, Kovács Z and Janiă?Ić P (2019). Portfolio theorem proving and prover runtime prediction for geometry, Annals of Mathematics and Artificial Intelligence, 85:2-4, (119-146), Online publication date: 1-Apr-2019.
- Stojanović-?Ură?Ević S (2019). From informal to formal proofs in Euclidean geometry, Annals of Mathematics and Artificial Intelligence, 85:2-4, (89-117), Online publication date: 1-Apr-2019.
- Hayes I, Meinicke L, Winter K and Colvin R (2019). A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency, Formal Aspects of Computing, 31:2, (133-163), Online publication date: 1-Apr-2019.
- Nipkow T and Brinkop H (2019). Amortized Complexity Verified, Journal of Automated Reasoning, 62:3, (367-391), Online publication date: 1-Mar-2019.
- Marić F (2019). Fast Formal Proof of the Erd?s---Szekeres Conjecture for Convex Polygons with at Most 6 Points, Journal of Automated Reasoning, 62:3, (301-329), 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.
- Immler F and Traut C (2019). The Flow of ODEs, Journal of Automated Reasoning, 62:2, (215-236), Online publication date: 1-Feb-2019.
- Lammich P and Sefidgar S (2019). Formalizing Network Flow Algorithms, Journal of Automated Reasoning, 62:2, (261-280), Online publication date: 1-Feb-2019.
- Gabmeyer S, Kaufmann P, Seidl M, Gogolla M and Kappel G (2019). A feature-based classification of formal verification techniques for software models, Software and Systems Modeling (SoSyM), 18:1, (473-498), Online publication date: 1-Feb-2019.
- Fellner A and Woltzenlogel Paleo B (2019). Greedy pebbling for proof space compression, International Journal on Software Tools for Technology Transfer (STTT), 21:1, (71-86), Online publication date: 1-Feb-2019.
- Yang Y and Song Z LBAC Proceedings of the 3rd International Conference on Cryptography, Security and Privacy, (103-109)
- Roessle I, Verbeek F and Ravindran B Formally verified big step semantics out of x86-64 binaries Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, (181-195)
- Lochmann A and Sternagel C Certified ACKBO Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, (144-151)
- Immler F and Zhan B Smooth manifolds and types to sets for linear algebra in Isabelle/HOL Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, (65-77)
- Unruh D (2019). Quantum relational Hoare logic, Proceedings of the ACM on Programming Languages, 3:POPL, (1-31), Online publication date: 2-Jan-2019.
- Zhao Y, Sanan D, Zhang F and Liu Y (2019). Refinement-Based Specification and Security Analysis of Separation Kernels, IEEE Transactions on Dependable and Secure Computing, 16:1, (127-141), Online publication date: 1-Jan-2019.
- Li W, Passmore G and Paulson L (2019). Deciding Univariate Polynomial Problems Using Untrusted Certificates in Isabelle/HOL, Journal of Automated Reasoning, 62:1, (69-91), Online publication date: 1-Jan-2019.
- 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.
- Cofer D, Gacek A, Backes J, Whalen M, Pike L, Foltzer A, Podhradsky M, Klein G, Kuz I, Andronick J, Heiser G and Stuart D (2018). A Formal Approach to Constructing Secure Air Vehicle Software, Computer, 51:11, (14-23), Online publication date: 1-Nov-2018.
- Li Y, Duan K, Jansen D, Pang J, Zhang L, Lv Y and Cai S (2018). An Automatic Proving Approach to Parameterized Verification, ACM Transactions on Computational Logic, 19:4, (1-25), Online publication date: 31-Oct-2018.
- Seshia S and Subramanyan P UCLID5 Proceedings of the 16th ACM-IEEE International Conference on Formal Methods and Models for System Design, (1-10)
- Bartoletti M and Zunino R BitML Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, (83-100)
- 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)
- Nagashima Y and He Y PaMpeR: proof method recommendation system for Isabelle/HOL Proceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering, (362-372)
- Grewe S, Erdweg S, Pacak A and Mezini M System Description Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, (1-10)
- Breitner J, Spector-Zabusky A, Li Y, Rizkallah C, Wiegley J and Weirich S (2018). Ready, set, verify! applying hs-to-coq to real-world Haskell code (experience report), Proceedings of the ACM on Programming Languages, 2:ICFP, (1-16), Online publication date: 30-Jul-2018.
- Palmskog K, Celik A and Gligoric M piCoq: parallel regression proving for large-scale verification projects Proceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis, (344-355)
- Brandt F, Saile C and Stricker C Voting with Ties Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, (1285-1293)
- 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)
- Blanchette J, Fleury M, Lammich P and Weidenbach C (2018). A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality, Journal of Automated Reasoning, 61:1-4, (333-365), Online publication date: 1-Jun-2018.
- Immler F (2018). A Verified ODE Solver and the Lorenz Attractor, Journal of Automated Reasoning, 61:1-4, (73-111), Online publication date: 1-Jun-2018.
- Schlichtkrull A (2018). Formalization of the Resolution Calculus for First-Order Logic, Journal of Automated Reasoning, 61:1-4, (455-484), Online publication date: 1-Jun-2018.
- Diekmann C, Hupel L, Michaelis J, Haslbeck M and Carle G (2018). Verified iptables Firewall Analysis and Verification, Journal of Automated Reasoning, 61:1-4, (191-242), Online publication date: 1-Jun-2018.
- Bertot Y, Rideau L and Théry L (2018). Distant Decimals of $$\pi $$ź, Journal of Automated Reasoning, 61:1-4, (33-71), Online publication date: 1-Jun-2018.
- Bauereiβ T, Pesenti Gritti A, Popescu A and Raimondi F (2018). CoSMed, Journal of Automated Reasoning, 61:1-4, (113-139), Online publication date: 1-Jun-2018.
- Riesco A and Ogata K (2018). Prove it! Inferring Formal Proof Scripts from CafeOBJ Proof Scores, ACM Transactions on Software Engineering and Methodology, 27:2, (1-32), Online publication date: 30-Apr-2018.
- Shapiro M, Bieniusa A, Zeller P and Petri G Ensuring referential integrity under causal consistency Proceedings of the 5th Workshop on the Principles and Practice of Consistency for Distributed Data, (1-5)
- 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.
- Brandl F, Brandt F, Eberl M and Geist C (2018). Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving, Journal of the ACM, 65:2, (1-28), Online publication date: 8-Mar-2018.
- Divasón J, Joosten S, Kunčar O, Thiemann R and Yamada A Efficient certification of complexity proofs: formalizing the Perron–Frobenius theorem (invited talk paper) Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, (2-13)
- Amani S, Bégel M, Bortin M and Staples M Towards verifying ethereum smart contract bytecode in Isabelle/HOL Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, (66-77)
- McLaughlin C, McKinna J and Stark I Triangulating context lemmas Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, (102-114)
- Brunner J and Lammich P (2018). Formal Verification of an Executable LTL Model Checker with Partial Order Reduction, Journal of Automated Reasoning, 60:1, (3-21), Online publication date: 1-Jan-2018.
- Padon O, Losa G, Sagiv M and Shoham S (2017). Paxos made EPR: decidable reasoning about distributed protocols, Proceedings of the ACM on Programming Languages, 1:OOPSLA, (1-31), Online publication date: 12-Oct-2017.
- Verbeek F and van Vugt N Estimating worst-case latency of on-chip interconnects with formal simulation Proceedings of the 17th Conference on Formal Methods in Computer-Aided Design, (204-211)
- 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.
- Bodeveix J, Filali-Amine M and Kan S A refinement-based compiler development for synchronous languages Proceedings of the 15th ACM-IEEE International Conference on Formal Methods and Models for System Design, (165-174)
- Ribeiro R and Bois A Certified Bit-Coded Regular Expression Parsing Proceedings of the 21st Brazilian Symposium on Programming Languages, (1-8)
- Spichkova M and Simic M (2017). Human-centred analysis of the dependencies within sets of proofs, Procedia Computer Science, 112:C, (2290-2298), Online publication date: 1-Sep-2017.
- Clunne-Kiely L, Idicula B, Payne L, Ronggowarsito E, Spichkova M, Simic M and Schmidt H (2017). Modelling and Implementation of Humanoid Robot Behaviour, Procedia Computer Science, 112:C, (2249-2258), Online publication date: 1-Sep-2017.
- Kumar A and Pais A (2017). En-Route Filtering Techniques in Wireless Sensor Networks, Wireless Personal Communications: An International Journal, 96:1, (697-739), Online publication date: 1-Sep-2017.
- Blanchette J, Fleury M and Weidenbach C A verified SAT solver framework with learn, forget, restart and incrementality Proceedings of the 26th International Joint Conference on Artificial Intelligence, (4786-4790)
- Selsam D, Liang P and Dill D Developing bug-free machine learning systems with formal mathematics Proceedings of the 34th International Conference on Machine Learning - Volume 70, (3047-3056)
- Pinisetty S, Preoteasa V, Tripakis S, Jéron T, Falcone Y and Marchand H (2017). Predictive runtime enforcement, Formal Methods in System Design, 51:1, (154-199), Online publication date: 1-Aug-2017.
- El Bakouny Y, Crolard T and Mezher D A Coq-based synthesis of Scala programs which are correct-by-construction Proceedings of the 19th Workshop on Formal Techniques for Java-like Programs, (1-2)
- Kovács L, Robillard S and Voronkov A (2017). Coming to terms with quantified reasoning, ACM SIGPLAN Notices, 52:1, (260-270), 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.
- Lampropoulos L, Gallois-Wong D, Hriţcu C, Hughes J, Pierce B and Xia L (2017). Beginner's luck: a language for property-based generators, ACM SIGPLAN Notices, 52:1, (114-129), Online publication date: 11-May-2017.
- Stratulat S (2017). Mechanically certifying formula-based Noetherian induction reasoning, Journal of Symbolic Computation, 80:P1, (209-249), Online publication date: 1-May-2017.
- Blanchette J, Waldmann U and Wand D A Lambda-Free Higher-Order RecursiveźPathźOrder Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures - Volume 10203, (461-479)
- Atzei N, Bartoletti M and Cimoli T A Survey of Attacks on Ethereum Smart Contracts SoK Proceedings of the 6th International Conference on Principles of Security and Trust - Volume 10204, (164-186)
- Aransay J and Divasón J (2017). A Formalisation in HOL of the Fundamental Theorem of Linear Algebra and Its Application to the Solution of the Least Squares Problem, Journal of Automated Reasoning, 58:4, (509-535), Online publication date: 1-Apr-2017.
- Zulkoski E, Bright C, Heinle A, Kotsireas I, Czarnecki K and Ganesh V (2017). Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures, Journal of Automated Reasoning, 58:3, (313-339), Online publication date: 1-Mar-2017.
- Reynolds A and Blanchette J (2017). A Decision Procedure for (Co)datatypes in SMT Solvers, Journal of Automated Reasoning, 58:3, (341-362), Online publication date: 1-Mar-2017.
- Steffen B (2017). The physics of software tools, International Journal on Software Tools for Technology Transfer (STTT), 19:1, (1-7), Online publication date: 1-Feb-2017.
- Amani S, Andronick J, Bortin M, Lewis C, Rizkallah C and Tuong J Complx: a verification framework for concurrent imperative programs Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, (138-150)
- Divasón J, Joosten S, Thiemann R and Yamada A A formalization of the Berlekamp-Zassenhaus factorization algorithm Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, (17-29)
- 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)
- Kovács L, Robillard S and Voronkov A Coming to terms with quantified reasoning Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, (260-270)
- 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)
- Lampropoulos L, Gallois-Wong D, Hriţcu C, Hughes J, Pierce B and Xia L Beginner's luck: a language for property-based generators Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, (114-129)
- Blanchette J, Popescu A and Traytel D (2017). Soundness and Completeness Proofs by Coinductive Methods, Journal of Automated Reasoning, 58:1, (149-179), Online publication date: 1-Jan-2017.
- Ströder T, Giesl J, Brockschmidt M, Frohn F, Fuhs C, Hensel J, Schneider-Kamp P and Aschermann C (2017). Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic, Journal of Automated Reasoning, 58:1, (33-65), Online publication date: 1-Jan-2017.
- Giesl J, Aschermann C, Brockschmidt M, Emmes F, Frohn F, Fuhs C, Hensel J, Otto C, Plücker M, Schneider-Kamp P, Ströder T, Swiderski S and Thiemann R (2017). Analyzing Program Termination and Complexity Automatically with AProVE, Journal of Automated Reasoning, 58:1, (3-31), Online publication date: 1-Jan-2017.
- Beaumont M, McCarthy J and Murray T The cross domain desktop compositor Proceedings of the 32nd Annual Conference on Computer Security Applications, (533-545)
- Esparza J, Křetínský J and Sickert S (2016). From LTL to deterministic automata, Formal Methods in System Design, 49:3, (219-271), Online publication date: 1-Dec-2016.
- You Z, Xue J and Zuo Z (2016). Unified formal derivation and automatic verification of three binary-tree traversal non-recursive algorithms, Cluster Computing, 19:4, (2145-2156), Online publication date: 1-Dec-2016.
- Schubert A, Urzyczyn P and Walukiewicz-Chrząszcz D (2016). How Hard Is Positive Quantification?, ACM Transactions on Computational Logic, 17:4, (1-29), Online publication date: 15-Nov-2016.
- Furusawa H and Struth G (2016). Taming Multirelations, ACM Transactions on Computational Logic, 17:4, (1-34), Online publication date: 15-Nov-2016.
- Kammueller F, Kerber M and Probst C Towards Formal Analysis of Insider Threats for Auctions Proceedings of the 8th ACM CCS International Workshop on Managing Insider Security Threats, (23-34)
- Grewe S VeriTaS: verification of type system specifications: mechanizing domain knowledge about progress and preservation proofs Companion Proceedings of the 2016 ACM SIGPLAN International Conference on Systems, Programming, Languages and Applications: Software for Humanity, (12-14)
- Blanchette J, Greenaway D, Kaliszyk C, Kühlwein D and Urban J (2016). A Learning-Based Fact Selector for Isabelle/HOL, Journal of Automated Reasoning, 57:3, (219-244), Online publication date: 1-Oct-2016.
- O'Connor L Applications of applicative proof search Proceedings of the 1st International Workshop on Type-Driven Development, (43-55)
- Grewe S, Erdweg S, Raulf M and Mezini M Exploration of language specifications by compilation to first-order logic Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, (104-117)
- Hentschel M, Hähnle R and Bubel R An empirical evaluation of two user interfaces of an interactive program verifier Proceedings of the 31st IEEE/ACM International Conference on Automated Software Engineering, (403-413)
- Padon O, McMillan K, Panda A, Sagiv M and Shoham S (2016). Ivy: safety verification by interactive generalization, ACM SIGPLAN Notices, 51:6, (614-630), Online publication date: 1-Aug-2016.
- Dongol B, Hayes I and Struth G (2016). Convolution as a Unifying Concept, ACM Transactions on Computational Logic, 17:3, (1-25), Online publication date: 22-Jul-2016.
- Benzmüller C and Paleo B The inconsistency in Gödel's ontological argument Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, (936-942)
- Preoteasa V and Tripakis S Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (768-777)
- Blanchette J, Fleury M and Weidenbach C A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality Proceedings of the 8th International Joint Conference on Automated Reasoning - Volume 9706, (25-44)
- Wisniewski M, Steen A, Kern K and Benzmüller C Effective Normalization Techniques for HOL Proceedings of the 8th International Joint Conference on Automated Reasoning - Volume 9706, (362-370)
- Rizaldi A, Immler F and Althoff M A Formally Verified Checker of the Safe Distance Traffic Rules for Autonomous Vehicles Proceedings of the 8th International Symposium on NASA Formal Methods - Volume 9690, (175-190)
- Padon O, McMillan K, Panda A, Sagiv M and Shoham S Ivy: safety verification by interactive generalization Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, (614-630)
- Aiguier M, Arnould A, Gall P and Longuet D (2016). Exhaustive test sets for algebraic specifications, Software Testing, Verification & Reliability, 26:4, (294-317), Online publication date: 1-Jun-2016.
- Pinisetty S, Preoteasa V, Tripakis S, Jéron T, Falcone Y and Marchand H Predictive runtime enforcement Proceedings of the 31st Annual ACM Symposium on Applied Computing, (1628-1633)
- Åman Pohjola J and Parrow J The Expressive Power of Monotonic Parallel Composition Proceedings of the 25th European Symposium on Programming Languages and Systems - Volume 9632, (780-803)
- 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)
- Zhao Y, Sanán D, Zhang F and Liu Y Reasoning About Information Flow Security of Separation Kernels with Channel-Based Communication Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 9636, (791-810)
- Lochbihler A Probabilistic Functions and Cryptographic Oracles in Higher Order Logic Proceedings of the 25th European Symposium on Programming Languages and Systems - Volume 9632, (503-531)
- Blanchette J, Böhme S, Fleury M, Smolka S and Steckermeier A (2016). Semi-intelligible Isar Proofs from Machine-Generated Proofs, Journal of Automated Reasoning, 56:2, (155-200), Online publication date: 1-Feb-2016.
- Elliott T, Pike L, Winwood S, Hickey P, Bielman J, Sharp J, Seidel E and Launchbury J (2015). Guilt free ivory, ACM SIGPLAN Notices, 50:12, (189-200), Online publication date: 28-Jan-2016.
- Breitner J (2015). Formally proving a compiler transformation safe, ACM SIGPLAN Notices, 50:12, (35-46), Online publication date: 28-Jan-2016.
- Åman Pohjola J and Parrow J Bisimulation up-to techniques for psi-calculi Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, (142-153)
- Fulton N and Platzer A A logic of proofs for differential dynamic logic: toward independently checkable proof certificates for dynamic logics Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, (110-121)
- Li W and Paulson L A modular, efficient formalisation of real algebraic numbers Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, (66-75)
- Thiemann R and Yamada A Formalizing Jordan normal forms in Isabelle/HOL Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, (88-99)
- Bernard S, Bertot Y, Rideau L and Strub P Formal proofs of transcendence for e and pi as an application of multivariate and symmetric polynomials Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, (76-87)
- Kotelnikov E, Kovács L, Reger G and Voronkov A The vampire and the FOOL Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, (37-48)
- Draheim D Reflective Constraint Writing Special Issue on Database- and Expert-Systems Applications on Transactions on Large-Scale Data- and Knowledge-Centered Systems XXIV - Volume 9510, (1-60)
- Wickerson J, Batty M, Beckmann B and Donaldson A (2015). Remote-scope promotion: clarified, rectified, and verified, ACM SIGPLAN Notices, 50:10, (731-747), 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.
- Teichel K, Sibold D and Milius S First Results of a Formal Analysis of the Network Time Security Specification Proceedings of the Second International Conference on Security Standardisation Research - Volume 9497, (218-245)
- 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.
- Furusawa H and Struth G (2015). Concurrent Dynamic Algebra, ACM Transactions on Computational Logic, 16:4, (1-38), Online publication date: 19-Nov-2015.
- Wickerson J, Batty M, Beckmann B and Donaldson A Remote-scope promotion: clarified, rectified, and verified Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, (731-747)
- Déharbe D and Merz S Software Component Design with the B Method -- A Formalization in Isabelle/HOL Revised Selected Papers of the 12th International Conference on Formal Aspects of Component Software - Volume 9539, (31-47)
- Amálio N, de Lara J and Guerra E Fragmenta Proceedings of the 18th International Conference on Model Driven Engineering Languages and Systems, (106-115)
- 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)
- Debois S, Hildebrandt T and Slaats T Concurrency and Asynchrony in Declarative Workflows Proceedings of the 13th International Conference on Business Process Management - Volume 9253, (72-89)
- Elliott T, Pike L, Winwood S, Hickey P, Bielman J, Sharp J, Seidel E and Launchbury J Guilt free ivory Proceedings of the 2015 ACM SIGPLAN Symposium on Haskell, (189-200)
- Breitner J Formally proving a compiler transformation safe Proceedings of the 2015 ACM SIGPLAN Symposium on Haskell, (35-46)
- 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)
- Kotelnikov E, Kovács L and Voronkov A A First Class Boolean Sort in First-Order Theorem Proving and TPTP Proceedings of the International Conference on Intelligent Computer Mathematics - Volume 9150, (71-86)
- Murray T Short Paper Proceedings of the 10th ACM Workshop on Programming Languages and Analysis for Security, (43-48)
- Betts A, Chong N, Donaldson A, Ketema J, Qadeer S, Thomson P and Wickerson J (2015). The Design and Implementation of a Verification Technique for GPU Kernels, ACM Transactions on Programming Languages and Systems, 37:3, (1-49), Online publication date: 18-Jun-2015.
- 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)
- Zheng X and Julien C Verification and validation in cyber physical systems Proceedings of the First International Workshop on Software Engineering for Smart Cyber-Physical Systems, (15-18)
- Matichuk D, Murray T, Andronick J, Jeffery R, Klein G and Staples M Empirical study towards a leading indicator for cost of formal software verification Proceedings of the 37th International Conference on Software Engineering - Volume 1, (722-732)
- Blanchette J, Hupel L, Nipkow T, Noschinski L and Traytel D (2014). Experience report, ACM SIGPLAN Notices, 49:12, (25-30), Online publication date: 11-May-2015.
- Popescu A and Roşu G (2015). Term-generic logic, Theoretical Computer Science, 577:C, (1-24), Online publication date: 27-Apr-2015.
- Buday G Formalising the SECD machine with nominal Isabelle Proceedings of the 30th Annual ACM Symposium on Applied Computing, (1823-1824)
- Martina J and Paulson L (2015). Verifying multicast-based security protocols using the inductive method, International Journal of Information Security, 14:2, (187-204), Online publication date: 1-Apr-2015.
- Ciabattoni A, Lahav O, Spendier L and Zamansky A (2014). Taming Paraconsistent (and Other) Logics, ACM Transactions on Computational Logic, 16:1, (1-23), Online publication date: 1-Mar-2015.
- Foster S and Struth G (2015). On the Fine-Structure of Regular Algebra, Journal of Automated Reasoning, 54:2, (165-197), Online publication date: 1-Feb-2015.
- Lammich P and Neumann R A Framework for Verifying Depth-First Search Algorithms Proceedings of the 2015 Conference on Certified Programs and Proofs, (137-146)
- Immler F A Verified Algorithm for Geometric Zonotope/Hyperplane Intersection Proceedings of the 2015 Conference on Certified Programs and Proofs, (129-136)
- Preoteasa V and Tripakis S Refinement calculus of reactive systems Proceedings of the 14th International Conference on Embedded Software, (1-10)
- Hawblitzel C, Howell J, Lorch J, Narayan A, Parno B, Zhang D and Zill B Ironclad apps Proceedings of the 11th USENIX conference on Operating Systems Design and Implementation, (165-181)
- TESL Proceedings of the Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign, (114-123)
- Staples M, Jeffery R, Andronick J, Murray T, Klein G and Kolanski R Productivity for proof engineering Proceedings of the 8th ACM/IEEE International Symposium on Empirical Software Engineering and Measurement, (1-4)
- Molotnikov Z, Völter M and Ratiu D Automated domain-specific C verification with mbeddr Proceedings of the 29th ACM/IEEE International Conference on Automated Software Engineering, (539-550)
- Aoto T and Stratulat S Decision Procedures for Proving Inductive Theorems without Induction Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, (237-248)
- Blanchette J, Hupel L, Nipkow T, Noschinski L and Traytel D Experience report Proceedings of the 2014 ACM SIGPLAN symposium on Haskell, (25-30)
- Bahr P Composing and decomposing data types Proceedings of the 10th ACM SIGPLAN workshop on Generic programming, (71-82)
- Gaspar N, Henrio L and Madelaine E (2014). Bringing Coq into the World of GCM Distributed Applications, International Journal of Parallel Programming, 42:4, (643-662), Online publication date: 1-Aug-2014.
- Guo H and Subramaniam M (2014). Model-based test generation using extended symbolic grammars, International Journal on Software Tools for Technology Transfer (STTT), 16:4, (437-455), Online publication date: 1-Aug-2014.
- Ferreira J, Gherghina C, He G, Qin S and Chin W (2014). Automated verification of the FreeRTOS scheduler in Hip/Sleek, International Journal on Software Tools for Technology Transfer (STTT), 16:4, (381-397), Online publication date: 1-Aug-2014.
- Paulson L Automated theorem proving for special functions Proceedings of the 2014 Symposium on Symbolic-Numeric Computation, (3-8)
- 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.
- Greenaway D, Lim J, Andronick J and Klein G Don't sweat the small stuff Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, (429-439)
- Greenaway D, Lim J, Andronick J and Klein G (2014). Don't sweat the small stuff, ACM SIGPLAN Notices, 49:6, (429-439), Online publication date: 5-Jun-2014.
- Visser W, Bjørner N and Shankar N Software engineering and automated deduction Future of Software Engineering Proceedings, (155-166)
- Bartels B and Jähnig N Mechanized, Compositional Verification of Low-Level Code Proceedings of the 6th International Symposium on NASA Formal Methods - Volume 8430, (98-112)
- 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)
- Groce A, Havelund K, Holzmann G, Joshi R and Xu R (2014). Establishing flight software reliability, Annals of Mathematics and Artificial Intelligence, 70:4, (315-349), Online publication date: 1-Apr-2014.
- Felgenhauer B and Thiemann R Reachability Analysis with State-Compatible Automata Proceedings of the 8th International Conference on Language and Automata Theory and Applications - Volume 8370, (347-359)
- Zaccai D, Tagore A, Hoffman D, Kirschenbaum J, Bainazarov Z, Friedman H, Pearl D and Weide B Syrus Proceedings of the 45th ACM technical symposium on Computer science education, (61-66)
- 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.
- Alkassar E, Böhme S, Mehlhorn K and Rizkallah C (2014). A Framework for the Verification of Certifying Computations, Journal of Automated Reasoning, 52:3, (241-273), Online publication date: 1-Mar-2014.
- Welch D, Cook C, Sun Y and Sitaraman M A web-integrated verifying compiler for RESOLVE Proceedings of the 7th India Software Engineering Conference, (1-6)
- Klein G, Andronick J, Elphinstone K, Murray T, Sewell T, Kolanski R and Heiser G (2014). Comprehensive formal verification of an OS microkernel, ACM Transactions on Computer Systems, 32:1, (1-70), Online publication date: 1-Feb-2014.
- Macedonio D and Merro M (2014). A semantic analysis of key management protocols for wireless sensor networks, Science of Computer Programming, 81, (53-78), Online publication date: 1-Feb-2014.
- Alama J, Heskes T, Kühlwein D, Tsivtsivadze E and Urban J (2014). Premise Selection for Mathematics by Corpus Analysis and Kernel Methods, Journal of Automated Reasoning, 52:2, (191-213), Online publication date: 1-Feb-2014.
- Bodin M, Chargueraud A, Filaretti D, Gardner P, Maffeis S, Naudziuniene D, Schmitt A and Smith G (2014). A trusted mechanised JavaScript specification, ACM SIGPLAN Notices, 49:1, (87-100), Online publication date: 13-Jan-2014.
- Bodin M, Chargueraud A, Filaretti D, Gardner P, Maffeis S, Naudziuniene D, Schmitt A and Smith G A trusted mechanised JavaScript specification Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (87-100)
- Schropp A and Popescu A Nonfree Datatypes in Isabelle/HOL Proceedings of the Third International Conference on Certified Programs and Proofs - Volume 8307, (114-130)
- Lochbihler A (2014). Making the java memory model safe, ACM Transactions on Programming Languages and Systems, 35:4, (1-65), Online publication date: 1-Dec-2013.
- Sternagel C (2013). Proof Pearl--A Mechanized Proof of GHC's Mergesort, Journal of Automated Reasoning, 51:4, (357-370), Online publication date: 1-Dec-2013.
- Traytel D and Nipkow T (2013). Verified decision procedures for MSO on words based on derivatives of regular expressions, ACM SIGPLAN Notices, 48:9, (3-12), Online publication date: 12-Nov-2013.
- Kneuss E, Kuraj I, Kuncak V and Suter P (2013). Synthesis modulo recursive functions, ACM SIGPLAN Notices, 48:10, (407-426), Online publication date: 12-Nov-2013.
- Fernandez M, Kuz I, Klein G and Andronick J Towards a verified component platform Proceedings of the Seventh Workshop on Programming Languages and Operating Systems, (1-7)
- van Glabbeek R, Höfner P, Tan W and Portmann M Sequence numbers do not guarantee loop freedom Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems, (91-100)
- Gammie P (2013). Synchronous digital circuits as functional programs, ACM Computing Surveys, 46:2, (1-27), Online publication date: 1-Nov-2013.
- Kneuss E, Kuraj I, Kuncak V and Suter P Synthesis modulo recursive functions Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications, (407-426)
- Fast E, Lee C, Aiken A, Bernstein M, Koller D and Smith E Crowd-scale interactive formal reasoning and analytics Proceedings of the 26th annual ACM symposium on User interface software and technology, (363-372)
- Traytel D and Nipkow T Verified decision procedures for MSO on words based on derivatives of regular expressions Proceedings of the 18th ACM SIGPLAN international conference on Functional programming, (3-12)
- Saleh I, Kulczycki G, Blake M and Wei Y Static Detection of Implementation Errors Using Formal Code Specification Proceedings of the 11th International Conference on Software Engineering and Formal Methods - Volume 8137, (197-211)
- 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)
- Pham T and Whalen M RADA: a tool for reasoning about algebraic data types with abstractions Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering, (611-614)
- Kühlwein D, Blanchette J, Kaliszyk C and Urban J MaSh Proceedings of the 4th international conference on Interactive Theorem Proving, (35-50)
- Esparza J, Lammich P, Neumann R, Nipkow T, Schimpf A and Smaus J A Fully Verified Executable LTL Model Checker Proceedings of the 25th International Conference on Computer Aided Verification - Volume 8044, (463-478)
- Dai L, Xia B and Zhan N Generating Non-linear Interpolants by Semidefinite Programming Proceedings of the 25th International Conference on Computer Aided Verification - Volume 8044, (364-380)
- 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)
- Sewell T, Myreen M and Klein G (2013). Translation validation for a verified OS kernel, ACM SIGPLAN Notices, 48:6, (471-482), Online publication date: 23-Jun-2013.
- Qiu X, Garg P, Ştefănescu A and Madhusudan P (2013). Natural proofs for structure, data, and separation, ACM SIGPLAN Notices, 48:6, (231-242), Online publication date: 23-Jun-2013.
- Sewell T, Myreen M and Klein G Translation validation for a verified OS kernel Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, (471-482)
- Qiu X, Garg P, Ştefănescu A and Madhusudan P Natural proofs for structure, data, and separation Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, (231-242)
- Staples M, Kolanski R, Klein G, Lewis C, Andronick J, Murray T, Jeffery R and Bass L Formal specifications better than function points for code sizing Proceedings of the 2013 International Conference on Software Engineering, (1257-1260)
- Bongiovanni F and Henrio L A mechanized model for CAN protocols Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering, (266-281)
- Blanchette J, Böhme S, Popescu A and Smallbone N Encoding monomorphic and polymorphic types Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems, (493-507)
- Ludwich M and Fröhlich A (2013). On the formal verification of component-based embedded operating systems, ACM SIGOPS Operating Systems Review, 47:1, (28-34), Online publication date: 29-Jan-2013.
- Meier S, Cremers C and Basin D (2013). Efficient construction of machine-checked symbolic protocol security proofs, Journal of Computer Security, 21:1, (41-87), Online publication date: 1-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)
- Murray T, Matichuk D, Brassil M, Gammie P and Klein G Noninterference for operating system kernels Proceedings of the Second international conference on Certified Programs and Proofs, (126-142)
- Bulwahn L The new quickcheck for isabelle Proceedings of the Second international conference on Certified Programs and Proofs, (92-108)
- Huffman B (2012). Formal verification of monad transformers, ACM SIGPLAN Notices, 47:9, (15-16), Online publication date: 15-Oct-2012.
- Djeddai S, Strecker M and Mezghiche M Integrating a formal development for DSLs into meta-modeling Proceedings of the 2nd international conference on Model and Data Engineering, (55-66)
- Brucker A and Wolff B Featherweight OCL Proceedings of the 12th Workshop on OCL and Textual Modelling, (19-24)
- Küfner P, Nestmann U and Rickmann C Formal verification of distributed algorithms Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science, (209-224)
- Sánchez-Gil L, Hidalgo-Herrero M and Ortega-Mallén Y A locally nameless representation for a natural semantics for lazy evaluation Proceedings of the 9th international conference on Theoretical Aspects of Computing, (105-119)
- Huffman B Formal verification of monad transformers Proceedings of the 17th ACM SIGPLAN international conference on Functional programming, (15-16)
- 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.
- Chin W, David C, Nguyen H and Qin S (2012). Automated verification of shape, size and bag properties via user-defined predicates in separation logic, Science of Computer Programming, 77:9, (1006-1036), Online publication date: 1-Aug-2012.
- Baresi L, Morzenti A, Motta A and Rossi M (2012). A logic-based semantics for the verification of multi-diagram UML models, ACM SIGSOFT Software Engineering Notes, 37:4, (1-8), Online publication date: 16-Jul-2012.
- Horozal F, Kohlhase M and Rabe F Extending MKM formats at the statement level Proceedings of the 11th international conference on Intelligent Computer Mathematics, (65-80)
- 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)
- Marić F, Živković M and Vučković B Formalizing frankl's conjecture Proceedings of the 11th international conference on Intelligent Computer Mathematics, (248-263)
- Hoare T and van Staden S (2012). In praise of algebra, Formal Aspects of Computing, 24:4-6, (423-431), Online publication date: 1-Jul-2012.
- Traytel D, Popescu A and Blanchette J Foundational, Compositional (Co)datatypes for Higher-Order Logic Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science, (596-605)
- 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)
- Zhang H, Klein G, Staples M, Andronick J, Zhu L and Kolanski R Simulation modeling of a large-scale formal verification process Proceedings of the International Conference on Software and System Process, (3-12)
- 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)
- Andronick J, Jeffery R, Klein G, Kolanski R, Staples M, Zhang H and Zhu L Large-scale formal verification in practice: a process perspective Proceedings of the 34th International Conference on Software Engineering, (1002-1011)
- de Oliveira D, Déharbe D and Fontaine P (2012). Combining decision procedures by (model-)equality propagation, Science of Computer Programming, 77:4, (518-532), Online publication date: 1-Apr-2012.
- Lochbihler A Java and the java memory model -- a unified, machine-checked formalisation Proceedings of the 21st European conference on Programming Languages and Systems, (497-517)
- Basin D, Cremers C and Meier S Provably repairing the ISO/IEC 9798 standard for entity authentication Proceedings of the First international conference on Principles of Security and Trust, (129-148)
- Karunamurthy R, Khendek F and Glitho R (2012). A novel architecture for Web service composition, Journal of Network and Computer Applications, 35:2, (787-802), Online publication date: 1-Mar-2012.
- Wies T, Muñiz M and Kuncak V Deciding functional lists with sublist sets Proceedings of the 4th international conference on Verified Software: theories, tools, experiments, (66-81)
- Feliachi A, Gaudel M and Wolff B Isabelle/circus Proceedings of the 4th international conference on Verified Software: theories, tools, experiments, (243-260)
- Stampoulis A and Shao Z Static and user-extensible proof checking Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (273-284)
- Kimmell G, Stump A, Eades H, Fu P, Sheard T, Weirich S, Casinghino C, Sjöberg V, Collins N and Ahn K Equational reasoning about programs with general recursion and call-by-value semantics Proceedings of the sixth workshop on Programming languages meets program verification, (15-26)
- Stampoulis A and Shao Z (2012). Static and user-extensible proof checking, ACM SIGPLAN Notices, 47:1, (273-284), Online publication date: 18-Jan-2012.
- Heidarian F, Schmaltz J and Vaandrager F (2012). Analysis of a clock synchronization protocol for wireless sensor networks, Theoretical Computer Science, 413:1, (87-105), Online publication date: 1-Jan-2012.
- Felty A and Momigliano A (2012). Hybrid, Journal of Automated Reasoning, 48:1, (43-105), Online publication date: 1-Jan-2012.
- Dietl W, Drossopoulou S and Müller P (2012). Separating ownership topology and encapsulation with generic universe types, ACM Transactions on Programming Languages and Systems, 33:6, (1-62), Online publication date: 1-Dec-2011.
- Hirokawa N and Middeldorp A (2011). Decreasing Diagrams and Relative Termination, Journal of Automated Reasoning, 47:4, (481-501), Online publication date: 1-Dec-2011.
- Blanchette J and Krauss A (2011). Monotonicity Inference for Higher-Order Formulas, Journal of Automated Reasoning, 47:4, (369-398), Online publication date: 1-Dec-2011.
- Schmalz M Term rewriting in logics of partial functions Proceedings of the 13th international conference on Formal methods and software engineering, (633-650)
- Maclean E and Ireland A Mutation in linked data structures Proceedings of the 13th international conference on Formal methods and software engineering, (275-290)
- David C and Chin W Immutable specifications for more concise and precise verification Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications, (359-374)
- David C and Chin W (2011). Immutable specifications for more concise and precise verification, ACM SIGPLAN Notices, 46:10, (359-374), Online publication date: 18-Oct-2011.
- Charron-Bost B, Debrat H and Merz S Formal verification of consensus algorithms tolerating malicious faults Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems, (120-134)
- Sternagel C and Thiemann R Generalized and formalized uncurrying Proceedings of the 8th international conference on Frontiers of combining systems, (243-258)
- Bobot F and Paskevich A Expressing polymorphic types in a many-sorted language Proceedings of the 8th international conference on Frontiers of combining systems, (87-102)
- Blanchette J, Bulwahn L and Nipkow T Automatic proof and disproof in Isabelle/HOL Proceedings of the 8th international conference on Frontiers of combining systems, (12-27)
- Weber T (2011). SMT solvers, International Journal on Software Tools for Technology Transfer (STTT), 13:5, (419-429), Online publication date: 1-Oct-2011.
- Chaieb A (2011). Formal Power Series, Journal of Automated Reasoning, 47:3, (291-318), Online publication date: 1-Oct-2011.
- Johansson M, Dixon L and Bundy A (2011). Conjecture Synthesis for Inductive Theories, Journal of Automated Reasoning, 47:3, (251-289), Online publication date: 1-Oct-2011.
- Preoteasa V Algebra of monotonic boolean transformers Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications, (140-155)
- Popescu A and Gunter E Recursion principles for syntax with bindings and substitution Proceedings of the 16th ACM SIGPLAN international conference on Functional programming, (346-358)
- Popescu A and Gunter E (2011). Recursion principles for syntax with bindings and substitution, ACM SIGPLAN Notices, 46:9, (346-358), 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)
- Basin D, Capkun S, Schaller P and Schmidt B (2011). Formal Reasoning about Physical Properties of Security Protocols, ACM Transactions on Information and System Security, 14:2, (1-28), Online publication date: 1-Sep-2011.
- Nipkow T Verified efficient enumeration of plane graphs modulo isomorphism Proceedings of the Second international conference on Interactive theorem proving, (281-296)
- Krauss A, Sternagel C, Thiemann R, Fuhs C and Giesl J Termination of Isabelle functions via termination of rewriting Proceedings of the Second international conference on Interactive theorem proving, (152-167)
- Gammie P Verified synthesis of knowledge-based programs in finite synchronous environments Proceedings of the Second international conference on Interactive theorem proving, (87-102)
- Böhme S and Moskal M Heaps and data structures Proceedings of the 23rd international conference on Automated deduction, (177-191)
- Blanchette J, Böhme S and Paulson L Extending Sledgehammer with SMT solvers Proceedings of the 23rd international conference on Automated deduction, (116-130)
- Blanchette J, Weber T, Batty M, Owens S and Sarkar S Nitpicking c++ concurrency Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming, (113-124)
- Krebbers R and Wiedijk F A formalization of the C99 standard in HOL, isabelle and Coq Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics, (301-303)
- Qin S, Luo C, Chin W and He G Automatically refining partial specifications for program verification Proceedings of the 17th international conference on Formal methods, (369-385)
- De Dios J and Peña R Certification of safe polynomial memory bounds Proceedings of the 17th international conference on Formal methods, (184-199)
- Li G Validated compilation through logic Proceedings of the 17th international conference on Formal methods, (169-183)
- Brucker A, Brügger L, Kearney P and Wolff B An approach to modular and testable security models of real-world health-care applications Proceedings of the 16th ACM symposium on Access control models and technologies, (133-142)
- 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)
- Bartels B and Kleine M A CSP-based framework for the specification, verification, and implementation of adaptive systems Proceedings of the 6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems, (158-167)
- del Vado Vírseda R (2011). A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains, Electronic Notes in Theoretical Computer Science (ENTCS), 269:C, (55-69), Online publication date: 22-Apr-2011.
- de Moura F, Barbosa A, Ayala-Rincón M and Kamareddine F (2011). A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi, Electronic Notes in Theoretical Computer Science (ENTCS), 269:C, (41-54), Online publication date: 22-Apr-2011.
- Foster S and Struth G Integrating an automated theorem prover into agda Proceedings of the Third international conference on NASA Formal methods, (116-130)
- Dietrich D, Schröder L and Schulz E Formalizing and operationalizing industrial standards Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software, (81-95)
- Back R and Preoteasa V Semantics and proof rules of invariant based programs Proceedings of the 2011 ACM Symposium on Applied Computing, (1658-1665)
- Blech J and Grégoire B (2011). Certifying compilers using higher-order theorem provers as certificate checkers, Formal Methods in System Design, 38:1, (33-61), Online publication date: 1-Feb-2011.
- Owre S and Shankar N Solving the first verified software competition problems using PVS Formal modeling, (315-328)
- Urban C, Cheney J and Berghofer S (2011). Mechanizing the metatheory of LF, ACM Transactions on Computational Logic, 12:2, (1-42), Online publication date: 1-Jan-2011.
- Adler R, Schaefer I, Trapp M and Poetzsch-Heffter A (2011). Component-based modeling and verification of dynamic adaptation in safety-critical embedded systems, ACM Transactions on Embedded Computing Systems, 10:2, (1-39), Online publication date: 1-Dec-2010.
- Miller D Reasoning about computations using two-levels of logic Proceedings of the 8th Asian conference on Programming languages and systems, (34-46)
- Feliachi A, Gaudel M and Wolff B Unifying theories in Isabelle/HOL Proceedings of the Third international conference on Unifying theories of programming, (188-206)
- Butterfield A Saoithín Proceedings of the Third international conference on Unifying theories of programming, (137-156)
- Montano-Rivas O, McCasland R, Dixon L and Bundy A Scheme-based synthesis of inductive theories Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I, (348-361)
- Böhm P A framework for incremental modelling and verification of on-chip protocols Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design, (159-166)
- 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)
- De Dios J, Montenegro M and Peña R Certified absence of dangling pointers in a language with explicit deallocation Proceedings of the 8th international conference on Integrated formal methods, (305-319)
- Daum M, Schirmer N and Schmidt M From operating-system correctness to pervasively verified applications Proceedings of the 8th international conference on Integrated formal methods, (105-120)
- Papapanagiotou P and Fleuriot J An Isabelle-like procedural mode for HOL light Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning, (565-580)
- Heiser G, Andronick J, Elphinstone K, Klein G, Kuz I and Ryzhyk L The road to trustworthy systems Proceedings of the fifth ACM workshop on Scalable trusted computing, (3-10)
- Sprenger C and Basin D Developing security protocols by refinement Proceedings of the 17th ACM conference on Computer and communications security, (361-374)
- Brucker A, Krieger M, Longuet D and Wolff B A specification-based test case generation method for UML/OCL Proceedings of the 2010 international conference on Models in software engineering, (334-348)
- Stampoulis A and Shao Z (2010). VeriML, ACM SIGPLAN Notices, 45:9, (333-344), Online publication date: 27-Sep-2010.
- Arnold G, Hölzl J, Köksal A, Bodík R and Sagiv M (2010). Specifying and verifying sparse matrix codes, ACM SIGPLAN Notices, 45:9, (249-260), Online publication date: 27-Sep-2010.
- Stampoulis A and Shao Z VeriML Proceedings of the 15th ACM SIGPLAN international conference on Functional programming, (333-344)
- Arnold G, Hölzl J, Köksal A, Bodík R and Sagiv M Specifying and verifying sparse matrix codes Proceedings of the 15th ACM SIGPLAN international conference on Functional programming, (249-260)
- Felty A Hybrid Proceedings of the third ACM SIGPLAN workshop on Mathematically structured functional programming, (1-2)
- Clarkson M and Schneider F (2010). Hyperproperties, Journal of Computer Security, 18:6, (1157-1210), Online publication date: 21-Sep-2010.
- 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)
- Almeida J, Bangerter E, Barbosa M, Krenn S, Sadeghi A and Schneider T A certifying compiler for zero-knowledge proofs of knowledge based on Σ-protocols Proceedings of the 15th European conference on Research in computer security, (151-167)
- Hurlin C and Kirchner H Semi-automatic synthesis of security policies by invariant-guided abduction Proceedings of the 7th International conference on Formal aspects of security and trust, (157-175)
- Walter D, Täubig H and Lüth C Experiences in applying formal verification in robotics Proceedings of the 29th international conference on Computer safety, reliability, and security, (347-360)
- Kohlhase A, Kohlhase M and Lange C STEX+ Proceedings of the 6th International Conference on Semantic Systems, (1-9)
- Benzmüller C Combining logics in simple type theory Proceedings of the 11th international conference on Computational logic in multi-agent systems, (33-48)
- Nipkow T (2010). Linear Quantifier Elimination, Journal of Automated Reasoning, 45:2, (189-212), Online publication date: 1-Aug-2010.
- Haftmann F, Kaliszyk C and Neuper W (2010). CTP-based programming languages?, ACM Communications in Computer Algebra, 44:1/2, (27-41), Online publication date: 29-Jul-2010.
- Giorgino M, Strecker M, Matthes R and Pantel M Verification of the Schorr-Waite algorithm - from trees to graphs Proceedings of the 20th international conference on Logic-based program synthesis and transformation, (67-83)
- Blanchette J and Krauss A Monotonicity inference for higher-order formulas Proceedings of the 5th international conference on Automated Reasoning, (91-106)
- Backes J and Brown C Analytic tableaux for higher-order logic with choice Proceedings of the 5th international conference on Automated Reasoning, (76-90)
- Cramer M, Koepke P, Kühlwein D and Schröder B Premise selection in the naproche system Proceedings of the 5th international conference on Automated Reasoning, (434-440)
- Aderhold M Automated synthesis of induction axioms for programs with second-order recursion Proceedings of the 5th international conference on Automated Reasoning, (263-277)
- Kohlhase M, Rabe F and Zholudev V Towards MKM in the large Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics, (370-384)
- Kohlhase A, Kohlhase M and Lange C Dimensions of formality Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics, (355-369)
- 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)
- 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)
- Bortin M and Lüth C Structured formal development with quotient types in Isabelle/HOL Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics, (34-48)
- Blanchette J Relational analysis of (Co)inductive predicates, (Co)algebraic datatypes, and (Co)recursive functions Proceedings of the 4th international conference on Tests and proofs, (117-134)
- Hales T, Harrison J, Mclaughlin S, Nipkow T, Obua S and Zumkeller R (2010). A Revision of the Proof of the Kepler Conjecture, Discrete & Computational Geometry, 44:1, (1-34), Online publication date: 1-Jul-2010.
- Codescu M, Horozal F, Kohlhase M, Mossakowski T, Rabe F and Sojakova K Towards logical frameworks in the heterogeneous tool set hets Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques, (139-159)
- Andronick J From a proven correct microkernel to trustworthy large systems Proceedings of the 2010 international conference on Formal verification of object-oriented software, (1-9)
- Klein G, Andronick J, Elphinstone K, Heiser G, Cock D, Derrin P, Elkaduwe D, Engelhardt K, Kolanski R, Norrish M, Sewell T, Tuch H and Winwood S (2010). seL4, Communications of the ACM, 53:6, (107-115), Online publication date: 1-Jun-2010.
- Kammüller F, Rein A and Reiser M Feature link propagation across variability representations with Isabelle/HOL Proceedings of the 2010 ICSE Workshop on Product Line Approaches in Software Engineering, (48-53)
- Sutcliffe G The TPTP world - infrastructure for automated reasoning Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning, (1-12)
- Chen C, Dong J, Sun J and Martin A (2010). A verification system for interval-based specification languages, ACM Transactions on Software Engineering and Methodology, 19:4, (1-36), Online publication date: 1-Apr-2010.
- Grönniger H and Rumpe B Modeling language variability Proceedings of the 16th Monterey conference on Foundations of computer software: modeling, development, and verification of adaptive systems, (17-32)
- Böhme S, Moskal M, Schulte W and Wolff B (2010). HOL-Boogie--An Interactive Prover-Backend for the Verifying C Compiler, Journal of Automated Reasoning, 44:1-2, (111-144), Online publication date: 1-Feb-2010.
- Dietrich D and Schulz E (2010). Crystal, Journal of Automated Reasoning, 44:1-2, (79-110), Online publication date: 1-Feb-2010.
- James P and Chalin P (2010). Faster and More Complete Extended Static Checking for the Java Modeling Language, Journal of Automated Reasoning, 44:1-2, (145-174), Online publication date: 1-Feb-2010.
- Haftmann F From higher-order logic to Haskell Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation, (155-158)
- Contejean É, Paskevich A, Urbain X, Courtieu P, Pons O and Forest J A3PAT, an approach for certified automated termination proofs Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation, (63-72)
- Shankar N Fixpoints and search in PVS Advanced Lectures on Software Engineering, (140-161)
- Aderhold M Second-order programs with preconditions Verification, induction termination analysis, (129-143)
- Benzmüller C Verifying the modal logic cube is an easy task Verification, induction termination analysis, (117-128)
- Johansson M, Dixon L and Bundy A Dynamic rippling, middle-out reasoning and lemma discovery Verification, induction termination analysis, (102-116)
- Glesner S, Bartels B, Göthel T and Kleine M The VATES-diamond as a verifier's best friend Verification, induction termination analysis, (81-101)
- Brockschmidt M, Otto C, Von Essen C and Giesl J Termination graphs for Java bytecode Verification, induction termination analysis, (17-37)
- Aderhold M Second-order programs with preconditions Verification, induction termination analysis, (129-143)
- Benzmüller C Verifying the modal logic cube is an easy task Verification, induction termination analysis, (117-128)
- Johansson M, Dixon L and Bundy A Dynamic rippling, middle-out reasoning and lemma discovery Verification, induction termination analysis, (102-116)
- Glesner S, Bartels B, Göthel T and Kleine M The VATES-diamond as a verifier's best friend Verification, induction termination analysis, (81-101)
- Brockschmidt M, Otto C, Von Essen C and Giesl J Termination graphs for Java bytecode Verification, induction termination analysis, (17-37)
- Sutcliffe G (2010). The CADE-22 automated theorem proving system competition - CASC-22, AI Communications, 23:1, (47-59), Online publication date: 1-Jan-2010.
- Reeves S and Streader D (2009). Guarded Operations, Refinement and Simulation, Electronic Notes in Theoretical Computer Science (ENTCS), 259, (177-191), Online publication date: 1-Dec-2009.
- Preoteasa V and Back R (2009). Data Refinement of Invariant Based Programs, Electronic Notes in Theoretical Computer Science (ENTCS), 259, (143-163), Online publication date: 1-Dec-2009.
- Brucker A and Mödersheim S Integrating automated and interactive protocol verification Proceedings of the 6th international conference on Formal Aspects in Security and Trust, (248-262)
- Henrio L, Kammüller F and Khan M A framework for reasoning on component composition Proceedings of the 8th international conference on Formal methods for components and objects, (1-20)
- Henrio L and Kammüller F (2009). Functional Active Objects, Electronic Notes in Theoretical Computer Science (ENTCS), 255, (83-101), Online publication date: 1-Nov-2009.
- Klein G, Elphinstone K, Heiser G, Andronick J, Cock D, Derrin P, Elkaduwe D, Engelhardt K, Kolanski R, Norrish M, Sewell T, Tuch H and Winwood S seL4 Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles, (207-220)
- Harrison W and Hook J (2009). Achieving information flow security through monadic control of effects, Journal of Computer Security, 17:5, (599-653), Online publication date: 1-Oct-2009.
- Shankar N (2009). Automated deduction for verification, ACM Computing Surveys, 41:4, (1-56), Online publication date: 1-Oct-2009.
- Schirmer N and Wenzel M (2009). State Spaces --- The Locale Way, Electronic Notes in Theoretical Computer Science (ENTCS), 254, (161-179), Online publication date: 1-Oct-2009.
- Boyton A (2009). A Verified Shared Capability Model, Electronic Notes in Theoretical Computer Science (ENTCS), 254, (25-44), Online publication date: 1-Oct-2009.
- Cengarle M, Grönniger H and Rumpe B Variability within Modeling Language Definitions Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems, (670-684)
- Kaiser M and Lämmel R An Isabelle/HOL-based model of stratego-like traversal strategies Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, (93-104)
- 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)
- Frese U, Hausmann D, Lüth C, Täubig H and Walter D (2009). The Importance of Being Formal, Electronic Notes in Theoretical Computer Science (ENTCS), 238:4, (57-70), Online publication date: 1-Sep-2009.
- Samuel D, Roggenbach M and Isobe Y (2009). The Stable Revivals Model in CSP-Prover, Electronic Notes in Theoretical Computer Science (ENTCS), 250:2, (119-134), Online publication date: 1-Sep-2009.
- Klein G, Derrin P and Elphinstone K (2009). Experience report, ACM SIGPLAN Notices, 44:9, (91-96), Online publication date: 31-Aug-2009.
- Klein G, Derrin P and Elphinstone K Experience report Proceedings of the 14th ACM SIGPLAN international conference on Functional programming, (91-96)
- Westbrook E, Stump A and Austin E The calculus of nominal inductive constructions Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, (74-83)
- Gunter E, Osborn C and Popescu A Theory support for weak higher order abstract syntax in Isabelle/HOL Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, (12-20)
- Howe D Higher-order abstract syntax in classical higher-order logic Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, (1-11)
- Obua S and Nipkow T (2009). Flyspeck II, Annals of Mathematics and Artificial Intelligence, 56:3-4, (245-272), Online publication date: 1-Aug-2009.
- Böhm P Incremental modelling and verification of the PCI express transaction layer Proceedings of the 7th IEEE/ACM international conference on Formal Methods and Models for Codesign, (36-45)
- Wasserrab D, Lohner D and Snelting G On PDG-based noninterference and its modular proof Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security, (31-44)
- 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)
- Grönniger H, Ringert J and Rumpe B System Model-Based Definition of Modeling Language Semantics Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems, (152-166)
- Bertot Y and Komendantskaya E Using Structural Recursion for Corecursion Types for Proofs and Programs, (220-236)
- Haftmann F and Wenzel M Local Theory Specifications in Isabelle/Isar Types for Proofs and Programs, (153-168)
- Blanchette J (2009). Proof Pearl, Journal of Automated Reasoning, 43:1, (1-18), 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.
- Erkök L and Matthews J High assurance programming in Cryptol Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies, (1-2)
- Malloy B, Sitaraman M and Hallstrom J Detecting overflow vulnerabilities using automated verification Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies, (1-4)
- Alkassar E, Hillebrand M, Leinenbach D, Schirmer N, Starostin A and Tsyban A (2009). Balancing the Load, Journal of Automated Reasoning, 42:2-4, (389-454), Online publication date: 1-Apr-2009.
- Daum M, Dörrenbächer J and Wolff B (2009). Proving Fairness and Implementation Correctness of a Microkernel Scheduler, Journal of Automated Reasoning, 42:2-4, (349-388), Online publication date: 1-Apr-2009.
- Schröder L and Mossakowski T (2009). HasCasl, Theoretical Computer Science, 410:12-13, (1217-1260), Online publication date: 20-Mar-2009.
- Wang L, Chang Y and Cheng K (2009). Electronic Design Automation, 10.5555/2843514, Online publication date: 11-Mar-2009.
- Leino K and Monahan R Reasoning about comprehensions with first-order SMT solvers Proceedings of the 2009 ACM symposium on Applied Computing, (615-622)
- James P and Chalin P Extended static checking in JML4 Proceedings of the 2009 ACM symposium on Applied Computing, (609-614)
- Dagand P, Kostić D and Kuncak V Opis Proceedings of the 4th international workshop on Types in language design and implementation, (65-78)
- Erkök L and Matthews J Pragmatic equivalence and safety checking in Cryptol Proceedings of the 3rd workshop on Programming languages meets program verification, (73-82)
- 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.
- Aransay J (2008). Mechanized reasoning in Homological Algebra, AI Communications, 21:4, (265-267), Online publication date: 1-Dec-2008.
- Brucker A, Brügger L and Wolff B (2008). Verifying Test-Hypotheses, Electronic Notes in Theoretical Computer Science (ENTCS), 220:1, (15-27), Online publication date: 1-Dec-2008.
- Owens S and Slind K (2008). Adapting functional programs to higher order logic, Higher-Order and Symbolic Computation, 21:4, (377-409), Online publication date: 1-Dec-2008.
- Böhm P and Melham T A refinement approach to design and verification of on-chip communication protocols Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design, (1-8)
- Brucker A and Wolff B (2008). An Extensible Encoding of Object-oriented Data Models in hol, Journal of Automated Reasoning, 41:3-4, (219-249), Online publication date: 1-Nov-2008.
- Krauss A (2008). Pattern minimization problems over recursive data types, ACM SIGPLAN Notices, 43:9, (267-274), Online publication date: 27-Sep-2008.
- Aldrich J, Simmons R and Shin K SASyLF Proceedings of the 2008 international workshop on Functional and declarative programming in education, (31-40)
- Krauss A Pattern minimization problems over recursive data types Proceedings of the 13th ACM SIGPLAN international conference on Functional programming, (267-274)
- Chapurlat V and Braesch C (2008). Verification, validation, qualification and certification of enterprise models, Computers in Industry, 59:7, (711-721), Online publication date: 1-Sep-2008.
- Chapman P, Mckinna J and Urban C Mechanising a Proof of Craig's Interpolation Theorem for Intuitionistic Logic in Nominal Isabelle Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics, (38-52)
- 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)
- Montenegro M, Peña R and Segura C A type system for safe memory management and its proof of correctness Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming, (152-162)
- Nguyen H and Chin W Enhancing Program Verification with Lemmas Proceedings of the 20th international conference on Computer Aided Verification, (355-369)
- Kolanski R (2008). A Logic for Virtual Memory, Electronic Notes in Theoretical Computer Science (ENTCS), 217, (61-77), Online publication date: 1-Jul-2008.
- Leinenbach D and Petrova E (2008). Pervasive Compiler Verification -- From Verified Programs to Verified Systems, Electronic Notes in Theoretical Computer Science (ENTCS), 217, (23-40), Online publication date: 1-Jul-2008.
- Chaieb A and Nipkow T (2008). Proof Synthesis and Reflection for Linear Arithmetic, Journal of Automated Reasoning, 41:1, (33-59), Online publication date: 1-Jul-2008.
- 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)
- Correctness of a Fault-Tolerant Real-Time Scheduler and its Hardware Implementation Proceedings of the Sixth ACM/IEEE International Conference on Formal Methods and Models for Co-Design, (175-186)
- 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.
- CHEN C, DONG J and SUN J A verification system for timed interval calculus Proceedings of the 30th international conference on Software engineering, (271-280)
- Schaefer I and Poetzsch-Heffter A Slicing for model reduction in adaptive embedded systems development Proceedings of the 2008 international workshop on Software engineering for adaptive and self-managing systems, (25-32)
- Elkaduwe D, Derrin P and Elphinstone K Kernel design for isolation and assurance of physical memory Proceedings of the 1st workshop on Isolation and integration in embedded systems, (35-40)
- Strecker M (2008). Modeling and Verifying Graph Transformations in Proof Assistants, Electronic Notes in Theoretical Computer Science (ENTCS), 203:1, (135-148), Online publication date: 1-Mar-2008.
- Tobin-Hochstadt S and Felleisen M (2008). The design and implementation of typed scheme, ACM SIGPLAN Notices, 43:1, (395-406), Online publication date: 14-Jan-2008.
- Voigtländer J (2008). Much ado about two (pearl), ACM SIGPLAN Notices, 43:1, (29-35), Online publication date: 14-Jan-2008.
- Tobin-Hochstadt S and Felleisen M The design and implementation of typed scheme Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (395-406)
- Voigtländer J Much ado about two (pearl) Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (29-35)
- Sultana N and Thompson S Mechanical verification of refactorings Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (51-60)
- Barthe G and Prensa Nieto L (2007). Secure information flow for a concurrent language with scheduling, Journal of Computer Security, 15:6, (647-689), Online publication date: 1-Dec-2007.
- Avigad J, Donnelly K, Gray D and Raff P (2007). A formally verified proof of the prime number theorem, ACM Transactions on Computational Logic, 9:1, (2-es), Online publication date: 1-Dec-2007.
- Chen C, Dong J and Sun J Machine-assisted proof support for validation beyond Simulink Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering, (96-115)
- Jackson P, Ellis B and Sharp K Using SMT solvers to verify high-integrity programs Proceedings of the second workshop on Automated formal methods, (60-68)
- Ireland A Cooperative reasoning for automatic software verification Proceedings of the second workshop on Automated formal methods, (51-54)
- Blech J and Poetzsch-Heffter A (2007). A Certifying Code Generation Phase, Electronic Notes in Theoretical Computer Science (ENTCS), 190:4, (65-82), Online publication date: 1-Nov-2007.
- 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.
- Bengtson J and Parrow J (2007). A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle, Electronic Notes in Theoretical Computer Science (ENTCS), 192:1, (61-75), Online publication date: 1-Oct-2007.
- Burel G Unbounded proof-length speed-up in deduction modulo Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic, (496-511)
- Obua S Proof pearl Proceedings of the 20th international conference on Theorem proving in higher order logics, (223-231)
- Contejean E, Courtieu P, Forest J, Pons O and Urbain X Certification of Automated Termination Proofs Proceedings of the 6th international symposium on Frontiers of Combining Systems, (148-162)
- 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)
- Schröder L Bootstrapping types and cotypes in HASCASL Proceedings of the 2nd international conference on Algebra and coalgebra in computer science, (447-461)
- Billingsley W and Robinson P (2007). Student Proof Exercises Using MathsTiles and Isabelle/HOL in an Intelligent Book, Journal of Automated Reasoning, 39:2, (181-218), Online publication date: 1-Aug-2007.
- Couchot J and Lescuyer S Handling Polymorphism in Automated Deduction Proceedings of the 21st international conference on Automated Deduction: Automated Deduction, (263-278)
- Heiser G, Elphinstone K, Kuz I, Klein G and Petters S (2007). Towards trustworthy computing systems, ACM SIGOPS Operating Systems Review, 41:4, (3-11), Online publication date: 1-Jul-2007.
- Broy M, Fox J, Hölzl F, Koss D, Kuhrmann M, Meisinger M, Penzenstadler B, Rittmann S, Schätz B, Spichkova M and Wild D Service-Oriented Modeling of CoCoME with Focus and AutoFocus The Common Component Modeling Example, (177-206)
- Elphinstone K, Klein G, Derrin P, Roscoe T and Heiser G Towards a practical, verified kernel Proceedings of the 11th USENIX workshop on Hot topics in operating systems, (1-6)
- Dennis L (2007). Enhancing Theorem Prover Interfaces with Program Slice Information, Electronic Notes in Theoretical Computer Science (ENTCS), 174:2, (19-33), Online publication date: 1-May-2007.
- Krstic S, Goel A, Grundy J and Tinelli C Combined satisfiability modulo parametric theories Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems, (602-617)
- Mossakowski T, Maeder C and Lüttich K The heterogeneous tool set, HETS Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems, (519-522)
- Li G, Owens S and Slind K Structure of a proof-producing compiler for a subset of higher order logic Proceedings of the 16th European Symposium on Programming, (205-219)
- Bengtson J and Parrow J Formalising the π-calculus using nominal logic Proceedings of the 10th international conference on Foundations of software science and computational structures, (63-77)
- Zee K, Kuncak V, Taylor M and Rinard M Runtime checking for program verification Proceedings of the 7th international conference on Runtime verification, (202-213)
- Li Y Mechanized proofs for the parameter abstraction and guard strengthening principle in parameterized verification of cache coherence protocols Proceedings of the 2007 ACM symposium on Applied computing, (1534-1535)
- Geuvers H, Niqui M, Spitters B and Wiedijk F (2007). Constructive analysis, types and exact real numbers, Mathematical Structures in Computer Science, 17:1, (3-36), Online publication date: 1-Feb-2007.
- Tuch H, Klein G and Norrish M Types, bytes, and separation logic Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (97-108)
- Pitts A and Shinwell M Generative unbinding of names Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (85-95)
- Tuch H, Klein G and Norrish M (2007). Types, bytes, and separation logic, ACM SIGPLAN Notices, 42:1, (97-108), Online publication date: 17-Jan-2007.
- Pitts A and Shinwell M (2007). Generative unbinding of names, ACM SIGPLAN Notices, 42:1, (85-95), Online publication date: 17-Jan-2007.
- Bouillaguet C, Kuncak V, Wies T, Zee K and Rinard M Using first-order theorem provers in the Jahob data structure verification system Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation, (74-88)
- Kuncak V, Lam P, Zee K and Rinard M (2006). Modular Pluggable Analyses for Data Structure Consistency, IEEE Transactions on Software Engineering, 32:12, (988-1005), Online publication date: 1-Dec-2006.
- Déharbe D, Fontaine P, Ranise S and Ringeissen C Decision procedures for the formal analysis of software Proceedings of the Third international conference on Theoretical Aspects of Computing, (366-370)
- Chaieb A Proof-producing program analysis Proceedings of the Third international conference on Theoretical Aspects of Computing, (287-301)
- Obua S Partizan games in Isabelle/HOLZF Proceedings of the Third international conference on Theoretical Aspects of Computing, (272-286)
- Nipkow T Verifying a hotel key card system Proceedings of the Third international conference on Theoretical Aspects of Computing, (1-14)
- Chen C and Dong J Applying timed interval calculus to simulink diagrams Proceedings of the 8th international conference on Formal Methods and Software Engineering, (74-93)
- Dharmadeep M and Gopinath K Proactive leader election in asynchronous shared memory systems Proceedings of the 4th international conference on Automated Technology for Verification and Analysis, (384-398)
- Brucker A, Doser J and Wolff B A model transformation semantics and analysis methodology for SecureUML Proceedings of the 9th international conference on Model Driven Engineering Languages and Systems, (306-320)
- Derrin P, Elphinstone K, Klein G, Cock D and Chakravarty M Running the manual Proceedings of the 2006 ACM SIGPLAN workshop on Haskell, (60-71)
- Brady E Ivor, a proof engine Proceedings of the 18th international conference on Implementation and application of functional languages, (145-162)
- Krauss A Partial recursive functions in higher-order logic Proceedings of the Third international joint conference on Automated Reasoning, (589-603)
- Chaieb A Verifying mixed real-integer quantifier elimination Proceedings of the Third international joint conference on Automated Reasoning, (528-540)
- Nipkow T, Bauer G and Schultz P Flyspeck i Proceedings of the Third international joint conference on Automated Reasoning, (21-35)
- 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)
- Miller D Representing and reasoning with operational semantics Proceedings of the Third international joint conference on Automated Reasoning, (4-20)
- Obua S and Skalberg S Importing HOL into Isabelle/HOL Proceedings of the Third international joint conference on Automated Reasoning, (298-302)
- Pike L, Shields M and Matthews J A verifying core for a cryptographic language compiler Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications, (1-10)
- Obua S Checking conservativity of overloaded definitions in higher-order logic Proceedings of the 17th international conference on Term Rewriting and Applications, (212-226)
- Winwood S, Klein G and Chakravarty M On the automated synthesis of proof-carrying temporal reference monitors Proceedings of the 16th international conference on Logic-based program synthesis and transformation, (111-126)
- Siek J and Taha W A semantic analysis of c++ templates Proceedings of the 20th European conference on Object-Oriented Programming, (304-327)
- Lüttich K and Mossakowski T Reasoning support for CASL with automated theorem proving systems Proceedings of the 18th international conference on Recent trends in algebraic development techniques, (74-91)
- Yang H, Zhang X and Wang Y A correctness proof of the SRP protocal Proceedings of the 20th international conference on Parallel and distributed processing, (357-357)
- Kuncak V and Rinard M An overview of the Jahob analysis system Proceedings of the 20th international conference on Parallel and distributed processing, (285-285)
- 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)
- Klein G and Huuck R High assurance system software Proceedings of the 10th Australian workshop on Safety critical systems and software - Volume 55, (59-67)
- Fontaine P, Marion J, Merz S, Nieto L and Tiu A Expressiveness + automation + soundness Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems, (167-181)
- Kolanski R and Klein G Formalising the L4 microkernel API Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51, (53-68)
- Johansson M, Bundy A and Dixon L Best-First rippling Reasoning, Action and Interaction in AI Theories and Systems, (83-100)
- Kolanski R and Klein G Formalising the L4 microkernel API Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51, (53-68)
- 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.
- Bodeveix J, Chemouil D, Filali M and Strecker M (2005). Towards formalising AADL in Proof Assistants, Electronic Notes in Theoretical Computer Science (ENTCS), 141:3, (153-169), Online publication date: 1-Dec-2005.
- Blech J, Glesner S, Leitner J and Mülling S (2005). Optimizing Code Generation from SSA Form, Electronic Notes in Theoretical Computer Science (ENTCS), 141:2, (33-51), Online publication date: 1-Dec-2005.
- Gilmore S and Prowse M (2005). Proof-carrying Bytecode, Electronic Notes in Theoretical Computer Science (ENTCS), 141:1, (3-18), Online publication date: 1-Dec-2005.
- Grov G Verifying the correctness of hume programs Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering, (444-447)
- Wölfl S and Mossakowski T CASL specifications of qualitative calculi Proceedings of the 2005 international conference on Spatial Information Theory, (200-217)
- 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)
- Leinenbach D, Paul W and Petrova E Towards the Formal Verification of a C0 Compiler Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods, (2-12)
- Blech J, Gesellensetter L and Glesner S Formal Verification of Dead Code Elimination in Isabelle/HOL Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods, (200-209)
- In der Rieden T and Knapp S An approach to the pervasive formal specification and verification of an automotive system Proceedings of the 10th international workshop on Formal methods for industrial critical systems, (115-124)
- Norrish M and Slind K Proof pearl Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics, (397-408)
- Nipkow T and Paulson L Proof pearl Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics, (385-396)
- Ortner V and Schirmer N Verification of BDD normalization Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics, (261-277)
- Obua S Proving bounds for real linear programs in Isabelle/HOL Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics, (227-244)
- 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)
- Gargano M, Hillebrand M, Leinenbach D and Paul W On the correctness of operating system kernels Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics, (1-16)
- Urban C and Tasson C Nominal techniques in Isabelle/HOL Proceedings of the 20th international conference on Automated Deduction, (38-53)
- Ogawa M, Horita E and Ono S Proving properties of incremental merkle trees Proceedings of the 20th international conference on Automated Deduction, (424-440)
- Kuncak V, Nguyen H and Rinard M An algorithm for deciding BAPA Proceedings of the 20th international conference on Automated Deduction, (260-277)
- Basin D, Kuruma H, Takaragi K and Wolff B Verification of a signature architecture with HOL-Z Proceedings of the 2005 international conference on Formal Methods, (269-285)
- Jojgov G Translating a fragment of weak type theory into type theory with open terms Proceedings of the 4th international conference on Mathematical Knowledge Management, (389-403)
- Brucker A and Wolff B Interactive testing with HOL-TestGen Proceedings of the 5th international conference on Formal Approaches to Software Testing, (87-102)
- Botaschanjan J, Kof L, Kühnel C and Spichkova M (2005). Towards verified automotive software, ACM SIGSOFT Software Engineering Notes, 30:4, (1-6), Online publication date: 1-Jul-2005.
- Siek J and Lumsdaine A Essential language support for generic programming Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation, (73-84)
- Siek J and Lumsdaine A (2005). Essential language support for generic programming, ACM SIGPLAN Notices, 40:6, (73-84), Online publication date: 12-Jun-2005.
- Botaschanjan J, Kof L, Kühnel C and Spichkova M Towards verified automotive software Proceedings of the second international workshop on Software engineering for automotive systems, (1-6)
- Wildmoser M and Nipkow T Asserting bytecode safety Proceedings of the 14th European conference on Programming Languages and Systems, (326-341)
- Hausmann D, Mossakowski T and Schröder L Iterative circular coinduction for CoCasl in isabelle/HOL Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering, (341-356)
- Sohr K, Drouineaud M and Ahn G Formal specification of role-based security policies for clinical information systems Proceedings of the 2005 ACM symposium on Applied computing, (332-339)
- Aransay J, Ballarin C and Rubio J Extracting computer algebra programs from statements Proceedings of the 10th international conference on Computer Aided Systems Theory, (159-168)
- Jouannaud J Higher-Order rewriting Processes, Terms and Cycles, (224-250)
- Compton M Stenning's protocol implemented in UDP and verified in Isabelle Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41, (21-30)
- Hemer D A formal approach to component adaptation and composition Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38, (259-266)
- Berghofer S Extracting a normalization algorithm in Isabelle/HOL Proceedings of the 2004 international conference on Types for Proofs and Programs, (50-65)
- Meyer T and Wolff B Tactic-based optimized compilation of functional programs Proceedings of the 2004 international conference on Types for Proofs and Programs, (201-214)
- Schoeller B, Widmer T and Meyer B Making specifications complete through models Proceedings of the 2004 international conference on Architecting Systems with Trustworthy Components, (48-70)
- 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)
- Barthe G and Nieto L Formally verifying information flow type systems for concurrent and thread systems Proceedings of the 2004 ACM workshop on Formal methods in security engineering, (13-22)
- Krieg-Brückner B, Frese U, Lüttich K, Mandel C, Mossakowski T and Ross R Specification of an ontology for route graphs Proceedings of the 4th international conference on Spatial Cognition: reasoning, Action, Interaction, (390-412)
- Brucker A and Wolff B Symbolic test case generation for primitive recursive functions Proceedings of the 4th international conference on Formal Approaches to Software Testing, (16-32)
- Drouineaud M, Bortin M, Torrini P and Sohr K A First Step Towards Formal Verification of Security Policy Properties for RBAC Proceedings of the Quality Software, Fourth International Conference, (60-67)
- Liang C, Nadathur G and Qi X (2004). Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts, Journal of Automated Reasoning, 33:2, (89-132), Online publication date: 1-Sep-2004.
- Cleva J, Leach J and López-Fraguas F A logic programming approach to the verification of functional-logic programs Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming, (9-19)
- Kamareddine F and Nederpelt R (2004). A Refinement of de Bruijn's Formal Language of Mathematics, Journal of Logic, Language and Information, 13:3, (287-340), Online publication date: 1-Jun-2004.
- Leow W, Khoo S and Sun Y Automated Generation of Test Programs from Closed Specifications of Classes and Test Cases Proceedings of the 26th International Conference on Software Engineering, (96-105)
- 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)
- Schröder L, Mossakowski T and Lüth C Type class polymorphism in an institutional framework Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques, (234-251)
- Poetzsch-Heffter A and Rauch N Application and formal specification of sorted term-position algebras Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques, (201-217)
- Aspinall D, Gilmore S, Hofmann M, Sannella D and Stark I Mobile resource guarantees for smart devices Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices, (1-26)
- Nieto L The rely-guarantee method in Isabelle/HOL Proceedings of the 12th European conference on Programming, (348-362)
- Wiedijk F (2003). A New Implementation of Automath, Journal of Automated Reasoning, 29:3-4, (365-387), Online publication date: 14-Jan-2003.
- Wenzel M and Wiedijk F (2003). A Comparison of Mizar and Isar, Journal of Automated Reasoning, 29:3-4, (389-411), Online publication date: 14-Jan-2003.
- Bella G, Paulson L and Massacci F The verification of an industrial payment protocol Proceedings of the 9th ACM conference on Computer and communications security, (12-20)
- Nipkow T Structured proofs in isar/HOL Proceedings of the 2002 international conference on Types for proofs and programs, (259-278)
- Brucker A and Wolff B Using theory morphisms for implementing formal methods tools Proceedings of the 2002 international conference on Types for proofs and programs, (59-77)
Recommendations
Nominal Techniques in Isabelle/HOL
This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that is bijective with the alpha-equated lambda-terms. Unlike de-Bruijn indices, however,...
Formalizing Axiomatic Systems for Propositional Logic in Isabelle/HOL
Intelligent Computer MathematicsAbstractWe formalize soundness and completeness proofs for a number of axiomatic systems for propositional logic in the proof assistant Isabelle/HOL.
Programming Language Semantics with Isabelle/HOL
WEIT '13: Proceedings of the 2013 2nd Workshop-School on Theoretical Computer ScienceIsabelle is a generic meta-logical framework for implementing logical formalisms, and Isabelle/HOL is the specialization of Isabelle for HOL, which stands for Higher Order Logic. In programming language theory, formal semantics is the field concerned ...