24 Hits in 2.6 sec

An Isabelle Proof Method Language [chapter]

Daniel Matichuk, Makarius Wenzel, Toby Murray
2014 Lecture Notes in Computer Science  
In this paper we present Eisbach, a proof method language for Isabelle, which aims to fill this gap by incorporating Isar language elements, thus making it accessible to existing users.  ...  Isabelle's most popular language interface, Isar, is attractive for new users, and powerful in the hands of experts, but has previously lacked a means to write automated proof procedures.  ...  Thanks also to Peter Gammie, Magnus Myreen, and Thomas Sewell for feedback on drafts of this paper.  ... 
doi:10.1007/978-3-319-08970-6_25 fatcat:j32ukqtr35di5emlzbcpqlwta4

A Proof Strategy Language and Proof Script Generation for Isabelle/HOL [article]

Yutaka Nagashima, Ramana Kumar
2017 arXiv   pre-print
We introduce a language, PSL, designed to capture high level proof strategies in Isabelle/HOL.  ...  Upon success, PSL generates an efficient proof script, which bypasses a large part of the proof search.  ...  We implemented IDDFS without code clutter, introducing the idea of a historysensitive tactic: a tactic that takes the log of proof attempts into account.  ... 
arXiv:1606.02941v9 fatcat:m7f7jzd345a3nffibwnb64rzjy

Interactive Theorem Proving

Gerwin Klein, Ruben Gamboa
2016 Journal of automated reasoning  
This special issue collects current efforts towards the construction of formal proofs with the use of interactive theorem provers, which combine formal proof-checking and prooffinding tools with human  ...  The paper by Matichuk, Murray, and Wenzel, "Eisbach: A Proof Method Language for Isabelle," describes a novel language for describing proof methods.  ...  This aims to re-use the definition of similar proof methods, making it easier to scale proofs in Isabelle.  ... 
doi:10.1007/s10817-016-9363-7 fatcat:cz5nkkk6hfbathwh4rg5s5urum

From LCF to Isabelle/HOL

Lawrence C. Paulson, Tobias Nipkow, Makarius Wenzel
2019 Formal Aspects of Computing  
They include a highly readable structured language of proofs and a unique interactive development environment for editing live proof documents.  ...  ML is short for meta language, as it was the vehicle for operating on formulas belonging to the object language (namely, the proof calculus).  ...  Acknowledgements We thank the referees, Jasmin Blanchette, Michael Norrish and Andrei Popescu for valuable comments on drafts of this paper.  ... 
doi:10.1007/s00165-019-00492-1 fatcat:rv5zmo22fjedvjxjz4lm22v6de

LiFtEr: Language to Encode Induction Heuristics for Isabelle/HOL [article]

Yutaka Nagashima
2019 arXiv   pre-print
Isabelle experts know how to use these tools effectively; however, there is a little tool support for transferring this expert knowledge to a wider user audience.  ...  Proof assistants, such as Isabelle/HOL, offer tools to facilitate inductive theorem proving.  ...  The important difference of LiFtEr from other tactic languages, such as Eisbach [16] and Ltac [4] , is that LiFtEr itself is not a tactic language but a language to write how one should use Isabelle's  ... 
arXiv:1906.08084v3 fatcat:uehy5lr3rnhgzfwon7bfbqz6o4

PaMpeR: Proof Method Recommendation System for Isabelle/HOL [article]

Yutaka Nagashima, Yilun He
2018 arXiv   pre-print
Deciding which sub-tool to use for a given proof state requires expertise specific to each ITP. To mitigate this problem, we present PaMpeR, a Proof Method Recommendation system for Isabelle/HOL.  ...  Given a proof state, PaMpeR recommends proof methods to discharge the proof goal and provides qualitative explanations as to why it suggests these methods.  ...  This method was defined in the standard library to test the domain specific language, Eisbach, for writing new proof methods: my_simp is simply a synonym of simp and nobody is expected to use my_simp.  ... 
arXiv:1806.07239v1 fatcat:7uaoocasdzbbfeqsmvyb6lsnhy

Modal Kleene Algebra Applied to Program Correctness [chapter]

Victor B. F. Gomes, Georg Struth
2016 Lecture Notes in Computer Science  
Starting from a weakest precondition based component with a simple relational store model, we show how variants for Hoare logic, strongest postconditions and program refinement can be built in a principled  ...  We describe their application in implementing versatile program correctness components in interactive theorem provers such as Isabelle/HOL.  ...  This work was partly supported by EPSRC Programme Grant REMS: Rigorous Engineering for Mainstream Systems, EP/K008528/1.  ... 
doi:10.1007/978-3-319-48989-6_19 fatcat:mcbdfeuc4zbrze64ndtt4yr4km

Hybrid Systems Verification with Isabelle/HOL: Simpler Syntax, Better Models, Faster Proofs [article]

Simon Foster, Jonathan Julián Huerta y Munive, Mario Gleirscher, Georg Struth
2021 arXiv   pre-print
We extend a semantic verification framework for hybrid systems with the Isabelle/HOL proof assistant by an algebraic model for hybrid program stores, a shallow expression model for hybrid programs and  ...  This leads to more local inference rules, procedures and tactics for reasoning with invariant sets, certifying solutions of hybrid specifications or calculating derivatives with increased proof automation  ...  by UKRI-EPSRC project CyPhyAssure (grant reference EP/S001190/1); Novo Nordisk Fonden Start Package Grant (NNF20OC0063462); and the Assuring Autonomy International Programme (AAIP; grant CSI:Cobot), a  ... 
arXiv:2106.05987v1 fatcat:7nuhzdtenjbcdlsyvnw2zvwwgq

Highly Automated Formal Proofs over Memory Usage of Assembly Code [chapter]

Freek Verbeek, Joshua A. Bockenek, Binoy Ravindran
2020 Lecture Notes in Computer Science  
A formal proof of memory usage is required for compositional reasoning over assembly programs.  ...  We present a methodology for generating a characterization of the memory used by an assembly program, as well as a formal proof that the assembly is bounded to the generated memory regions.  ...  Isabelle also utilizes a powerful proof language known as intelligible semi-automated reasoning (Isar) [59] and a proof strategy language called Eisbach [37] .  ... 
doi:10.1007/978-3-030-45237-7_6 fatcat:jlabxfgxonfojob46dquwcx4zi

Towards Certified Model Checking for PLTL Using One-Pass Tableaux

Alex Abuin, Alexander Bolotov, Unai Díaz De Cerio, Montserrat Hermo, Paqui Lucio, Michael Wagner
2019 International Symposium/Workshop on Temporal Representation and Reasoning  
in a proof assistant.  ...  The combination of the one-pass tableau and the dual sequent calculus enables us to provide not only counter-examples for unsatisfied properties, but also proofs for satisfied properties that can be checked  ...  For this task, interactive proof assistants such as Coq or Isabelle are good tools.  ... 
doi:10.4230/lipics.time.2019.12 dblp:conf/time/AbuinBDHL19 fatcat:bnbnyj6xvffyrjwzbyg4wdalri

The Tinker tool for graphical tactic development

Gudmund Grov, Yuhui Lin
2017 International Journal on Software Tools for Technology Transfer (STTT)  
Springer, Berlin, pp 324-339, 2013 ) is a graphical language to support the development and maintenance of proof tactics for interactive theorem provers.  ...  We then show practical use of PSGraph and Tinker by developing several proof patterns using the language and tool.  ...  Thanks to Pierre Le Bras, who implemented the Tinker GUI [30] , Aleks Kissinger, Rob Arthan, Colin O'Halloran and members of the AI4FM project for valuable discussions.  ... 
doi:10.1007/s10009-017-0452-7 fatcat:ksshsy5npvd5tgdedlymkfwury

ProofScript: Proof Scripting for the Masses [chapter]

Steven Obua, Phil Scott, Jacques Fleuriot
2016 Lecture Notes in Computer Science  
In this paper we will discuss ProofScript's most important aspect of being an integrated language both for interactive proof and for proof scripting.  ...  An important part of our plan to make this happen is ProofScript, a language designed to be the main user interface of ProofPeer.  ...  In acknowledgment of this, limited capabilities for proof automation called Eisbach have recently been added to Isar so that proof methods can be formulated within the Isar language itself [9] .  ... 
doi:10.1007/978-3-319-46750-4_19 fatcat:eydmclozsva5lpzjpep3spf3s4

Mechanised Verification Patterns for Dafny [chapter]

Gudmund Grov, Yuhui Lin, Vytautas Tumas
2016 Lecture Notes in Computer Science  
In previous work, we have developed a tactic language for Dafny, where users can encode their verification patterns and re-apply them for several proof tasks [16] .  ...  In this paper, we present a set of verification patterns to support this process.  ...  LTac for Coq [12] and EisBach for Isabelle [27] ). Autexier and Dietrich [3] has taken this even further and developed a declarative tactic language where tactics are written schematically.  ... 
doi:10.1007/978-3-319-48989-6_20 fatcat:4dcra7l3jndzxpigi6clumja7i

A Formalized Hierarchy of Probabilistic System Types [chapter]

Johannes Hölzl, Andreas Lochbihler, Dmitriy Traytel
2015 Lecture Notes in Computer Science  
This approach yields simple and concise proofs, as bisimilarity coincides with equality for codatatypes.  ...  In this work, we formalize the resulting hierarchy of probabilistic system types in Isabelle/HOL by modeling the semantics of the different systems as codatatypes.  ...  Conclusion We have presented a formalization of the hierarchy of probabilistic system types in Isabelle/HOL.  ... 
doi:10.1007/978-3-319-22102-1_13 fatcat:xt75einfl5epvkunnqi4bxjgki

Rigorous engineering for hardware security: Formal modelling and proof in the CHERI design and implementation process

Kyndylan Nienhuis, Alexandre Joannou, Thomas Bauereiss, Anthony Fox, Michael Roe, Brian Campbell, Matthew Naylor, Robert M. Norton, Simon W. Moore, Peter G. Neumann, Ian Stark, Robert N. M. Watson (+1 others)
2020 2020 IEEE Symposium on Security and Privacy (SP)  
We formalise key intended security properties of the design, and establish that these hold with mechanised proof.  ...  In this paper we show how more rigorous engineering methods can be applied to the development of a new security-enhanced processor architecture, with its accompanying hardware implementation and software  ...  ACKNOWLEDGEMENTS We thank Wes Filardo and Prashanth Mundkur for comments, and all the members of the CHERI team for their work on the project as a whole.  ... 
doi:10.1109/sp40000.2020.00055 dblp:conf/sp/NienhuisJBFR0NN20 fatcat:7ctnxm52abgfdommuxendyfrxm
« Previous Showing results 1 — 15 out of 24 results