Filters








387 Hits in 3.9 sec

Interactive Simplifier Tracing and Debugging in Isabelle [chapter]

Lars Hupel
2014 Lecture Notes in Computer Science  
The new simplifier trace is integrated into the Isabelle/jEdit Prover IDE.  ...  We describe a new, interactive tracing facility which offers insight into the hierarchical structure of the simplification with user-defined filtering, memoization and search.  ...  Acknowledgements I thank Tobias Nipkow and Lars Noschinski for encouraging me to implement a new simplifier trace.  ... 
doi:10.1007/978-3-319-08434-3_24 fatcat:ejhykf62crhz5mmo44ernikime

Enhancing Theorem Prover Interfaces with Program Slice Information

Louise A. Dennis
2007 Electronical Notes in Theoretical Computer Science  
Information is collected based on the involvement of these rules in both successful and unsuccessful proof branches.  ...  This paper proposes an extension to theorem proving interfaces for use with proof-directed debugging and other disproof-based applications.  ...  specifications and definitions in general (non-verification based) proofs to be handled in the same way.  ... 
doi:10.1016/j.entcs.2006.09.019 fatcat:f45n5tvvjvctziq73icolsnyny

HOL-Boogie — An Interactive Prover for the Boogie Program-Verifier [chapter]

Sascha Böhme, K. Rustan M. Leino, Burkhart Wolff
2008 Lecture Notes in Computer Science  
In this paper, however, we present a proofenvironment, HOL-Boogie, that combines Boogie with the interactive theorem prover Isabelle/HOL.  ...  We will exploit our proof-environment in two ways: First, we present scenarios to "debug" annotations (in particular: invariants) by interactive proofs.  ...  Combining Boogie with an interactive prover has a number of incentives: verification attempts can be debugged by interactive proofs, background theories can be proven consistent, existing front-end compilers  ... 
doi:10.1007/978-3-540-71067-7_15 fatcat:odqtglfglvhvxhvoxhhybwl7ey

Prototyping "Systems that Explain Themselves" for Education

Alan Krempler, Walther Neuper
2018 Electronic Proceedings in Theoretical Computer Science  
"Systems that Explain Themselves" appears a provocative wording, in particular in the context of mathematics education -- it is as provocative as the idea of building educational software upon technology  ...  can students and teachers request from educational systems based on technology and concepts from computer theorem proving, now and then?  ...  Acknowledgements The remarkable origins of the ISACproject were described in §1.  ... 
doi:10.4204/eptcs.267.6 fatcat:omz22kzbmngj3jwvedw6lvqvge

Virtualization of HOL4 in Isabelle

Fabian Immler, Jonas Rädle, Makarius Wenzel, Michael Wagner
2019 International Conference on Interactive Theorem Proving  
We present a novel approach to combine the HOL4 and Isabelle theorem provers: both are implemented in SML and based on distinctive variants of HOL.  ...  That is the starting point to provide a virtual instance of HOL4 in the same run-time environment as Isabelle.  ...  This has been greatly improved by Kaliszyk and Krauss [10] : the HOL-Light standard library is loaded into Isabelle/HOL in a few minutes.  ... 
doi:10.4230/lipics.itp.2019.21 dblp:conf/itp/ImmlerRW19 fatcat:dug7fiugq5cmrkpnkkznqmkxia

Opis

Pierre-Évariste Dagand, Dejan Kostić, Viktor Kuncak
2008 Proceedings of the 4th international workshop on Types in language design and implementation - TLDI '09  
Such architecture aids reasoning about event functions both informally and using interactive theorem provers. For example, it facilitates simple termination arguments.  ...  We present an alternative to these approaches, showing that modern, higher-order, strongly typed, memory safe languages provide an excellent vehicle for developing and debugging distributed systems.  ...  Acknowledgements We would like to thank Zheng Li, Oleg Kiselyov, and Jacques Garrigue for their valuable help to devise an efficient and sound implementation of the event function type in OCaml.  ... 
doi:10.1145/1481861.1481870 dblp:conf/tldi/DagandKK09 fatcat:s7djj3nyefeyvo7v5culazgy2q

Engineering the Prover Interface

Holger Gast
2012 Electronical Notes in Theoretical Computer Science  
Isabelle, how judicious architectural and design decisions lead to an interface software possessing these properties.  ...  Practical prover interfaces are sizeable pieces of software, whose construction and maintenance requires an extensive amount of effort and resources.  ...  Different types of messages are supported, among them normal output (e.g. for goals), error and warning messages, and debug and tracing messages.  ... 
doi:10.1016/j.entcs.2012.06.002 fatcat:ejeg26z76zfh5kprrcq7ttumry

HOL-Boogie—An Interactive Prover-Backend for the Verifying C Compiler

Sascha Böhme, Michał Moskal, Wolfram Schulte, Burkhart Wolff
2009 Journal of automated reasoning  
In this paper, we present a proof environment, HOL-Boogie, that combines Boogie with the interactive theorem prover Isabelle/HOL, for a specific C front-end and a machine/memory model.  ...  In particular, we present specific techniques combining automated and interactive proof methods for code verification.  ...  Acknowledgements Sascha Böhme was supported by the German Federal Ministry of Education and Research under grant 01IS07008.  ... 
doi:10.1007/s10817-009-9142-9 fatcat:rzk3lxalf5ewhd52jxdpbcpdi4

CTP-based programming languages?

Florian Haftmann, Cezary Kaliszyk, Walther Neuper
2010 ACM SIGSAM Bulletin  
This paper discusses plans for joint work in order to gain early feedback from the community.  ...  Tracing down details in type-definitions into (sub-)terms and tracing partiality conditions are discussed.  ...  experimental language described in Sect.2.3), or whether the high-level constructs of Isabelle/HOL can be traced/pushed down to the implementation language SML.  ... 
doi:10.1145/1838599.1838621 fatcat:w6b52oz7r5a2zenu4a5j7hznfu

Understanding and maintaining tactics graphically OR how we learned that a diagram can be worth more than 10K LoC

YuHui Lin, Gudmund Grov, Rob Arthan
2016 Journal of Formalized Reasoning  
The use of a functional language to implement proof strategies as proof tactics in interactive theorem provers, often provides short, concise and elegant implementations.  ...  This can make a tactic hard to understand and hence difficult to to debug and maintain for experts and non-experts alike: one often has to tear apart complex combinations of lower level tactics manually  ...  Another tool recently developed to support debugging is the new tracing mechanism for the simp tactic in Isabelle [34] . This is implemented as plug-in for the Isabelle/jEdit Prover IDE.  ... 
doi:10.6092/issn.1972-5787/6298 dblp:journals/jfrea/LinGA16 fatcat:iqztrkhotveataxdvb6ernsk7y

Understanding and maintaining tactics graphically OR how we are learning that a diagram can be worth more than 10K LoC [article]

Yuhui Lin, Gudmund Grov, Rob Arthan
2016 arXiv   pre-print
The use of a functional language to implement proof strategies as proof tactics in interactive theorem provers, often provides short, concise and elegant implementations.  ...  This can make a tactic hard to understand and hence difficult to to debug and maintain for experts and non-experts alike: one often has to tear apart complex combinations of lower level tactics manually  ...  Another tool recently developed to support debugging is the new tracing mechanism for the simp tactic in Isabelle [34] . This is implemented as plug-in for the Isabelle/jEdit Prover IDE.  ... 
arXiv:1610.05593v2 fatcat:tbsaymlqnnf47pdmjhthxpkrky

Automating Verification of State Machines with Reactive Designs and Isabelle/UTP [article]

Simon Foster, James Baxter, Ana Cavalcanti, Alvaro Miyazawa, Jim Woodcock
2018 arXiv   pre-print
The work has been mechanised in our proof tool, Isabelle/UTP, and so also illustrates the use of UTP to build practical verification tools.  ...  State-machine based notations are ubiquitous in the description of component systems, particularly in the robotic domain.  ...  This work is funded by the EPSRC projects RoboCalc 4 (Grant EP/M025756/1) and CyPhyAssure (Grant EP/S001190/1), and the Royal Academy of Engineering.  ... 
arXiv:1807.08588v1 fatcat:nboohuqn3rh7dmmax7cqud4taa

On theorem prover-based testing

Achim D. Brucker, Burkhart Wolff
2012 Formal Aspects of Computing  
HOL-TestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL.  ...  As such, HOL-TestGen allows for an integrated workflow supporting interactive theorem proving, test case generation, and test data generation.  ...  Acknowledgments: Lukas Brügger, Ana Cavalcanti, Abdou Feliachi, and Marie-Claude Gaudel made valuable comments on earlier versions of this paper.  ... 
doi:10.1007/s00165-012-0222-y fatcat:irheykkagzfyteb4znote6ckme

Formal Verification of Quantum Algorithms Using Quantum Hoare Logic [chapter]

Junyi Liu, Bohua Zhan, Shuling Wang, Shenggang Ying, Tao Liu, Yangjia Li, Mingsheng Ying, Naijun Zhan
2019 Lecture Notes in Computer Science  
In particular, we formalize the syntax and semantics of quantum programs in Isabelle/HOL, write down the rules of quantum Hoare logic, and verify the soundness and completeness of the deduction system  ...  To our best knowledge, this is the first time a Hoare logic for quantum programs is formalized in an interactive theorem prover, and used to verify the correctness of a nontrivial quantum algorithm.  ...  Formalization in Isabelle/HOL In this section, we describe the formalization of quantum Hoare logic in Isabelle/HOL. Isabelle/HOL [44] is an interactive theorem prover based on higher-order logic.  ... 
doi:10.1007/978-3-030-25543-5_12 fatcat:kvxjv4o5pfbqblpvof6xcpb2d4

Model Transformation as Conservative Theory-Transformation

Achim Brucker, Frédéric Tuong†, Burkhart Wolff
2020 Journal of Object Technology  
We present a new technique to construct tool support for domain-specific languages (DSLs) inside the interactive theorem prover environment Isabelle.  ...  Our approach is based on modeling the DSL formally in higher-order logic (HOL), modeling the API of Isabelle inside it, and defining the transformation between these two.  ...  -if any generated proofs fail, the deep mode of our approach generates an actual Isabelle theory file that can be "debugged" interactively.  ... 
doi:10.5381/jot.2020.19.3.a3 fatcat:uytv466ht5fq7lolxbypmuytey
« Previous Showing results 1 — 15 out of 387 results