Filters








160 Hits in 4.6 sec

Verifying CPS transformations in Isabelle/HOL

Yasuhiko Minamide, Koji Okuma
2003 Proceedings of the 2003 workshop on Mechanized reasoning about languages with variable binding - MERLIN '03  
We have verified several versions of the CPS transformation in Isabelle/HOL.  ...  To simplify verification of the CPS transformation on the language extended with let-expressions, it was essential to impose that variables are uniquely used in a program.  ...  Acknowledgments This work is partially supported by Japan Society for the Promotion of Science, Grant-in-Aid for Encouragement of Young Scientists of Japan, No. 13780193, 2001.  ... 
doi:10.1145/976571.976576 dblp:conf/icfp/MinamideO03 fatcat:n47e6qcg7zfqpehfyywsfq27f4

The Rely-Guarantee Method in Isabelle/HOL [chapter]

Leonor Prensa Nieto
2003 Lecture Notes in Computer Science  
We present the formalization of the rely-guarantee method in the theorem prover Isabelle/HOL.  ...  Also parameterized programs, where the number of parallel components is a parameter, are included in the programming language and thus can be verified directly in the system.  ...  Isabelle/HOL Isabelle is a generic interactive theorem prover and Isabelle/HOL is its instantiation for higher-order logic. For a gentle introduction to Isabelle/HOL see [7] .  ... 
doi:10.1007/3-540-36575-3_24 fatcat:ma5lrmiurfb4dkzcjicj6oqbzy

Comparison of Two Theorem Provers: Isabelle/HOL and Coq [article]

Artem Yushkovskiy
2018 arXiv   pre-print
This paper compares two widespread tools for automated theorem proving, Isabelle/HOL and Coq, with respect to expressiveness, limitations and usability.  ...  This is a set of techniques used to verify mathematical statements mechanically using logical reasoning.  ...  In this paper, the Isabelle/HOL has been considered as the startpoint for exploring the power of this proof assistant.  ... 
arXiv:1808.09701v2 fatcat:ffesxt4esffgjottsxmwjykjri

A Verified Decision Procedure for Orders in Isabelle/HOL [article]

Lukas Stevens, Tobias Nipkow
2021 arXiv   pre-print
We formalise the procedure in Isabelle/HOL and provide a specification that is made executable using Isabelle's code generator.  ...  We present the first verified implementation of a decision procedure for the quantifier-free theory of partial and linear orders.  ...  Soundness and completeness of the executable specification is fully verified in Isabelle/HOL.  ... 
arXiv:2104.13117v2 fatcat:ufcpmxrtwjblxgmtykygprzrhu

Proving the Soundness of a Java Bytecode Verifier Specification in Isabelle/HOL [chapter]

Cornelia Pusch
1999 Lecture Notes in Computer Science  
We have formalized large parts of the JVM, covering the central parts of object orientation, within the theorem prover Isabelle/HOL.  ...  While a similar proof done with paper and pencil turned out to be incomplete, using a theorem prover like Isabelle/HOL guarantees a maximum amount of reliability.  ...  The specification of a bytecode verifier in Isabelle/HOL presented in this paper follows Qian's work.  ... 
doi:10.1007/3-540-49059-0_7 fatcat:3tu75yfqsvalllyyxtspfr3nve

Formalizing Network Flow Algorithms: A Refinement Approach in Isabelle/HOL

Peter Lammich, S. Reza Sefidgar
2017 Journal of automated reasoning  
Our formal proof closely follows a standard textbook proof, and is accessible even without being an expert in Isabelle/HOL -the interactive theorem prover used for the formalization.  ...  Further refinement then yields verified efficient implementations of the algorithms, which compare well to unverified reference implementations.  ...  The formalization is conducted in the Isabelle/HOL proof assistant [39] .  ... 
doi:10.1007/s10817-017-9442-4 fatcat:bhs763gniffzncig46aex74iau

Towards Verification of Cyber-Physical Systems with UTP and Isabelle/HOL [chapter]

Simon Foster, Jim Woodcock
2016 Lecture Notes in Computer Science  
/HOL.  ...  In this paper, we outline our vision for building verification tools for Cyber-Physical Systems based on Hoare and He's Unifying Theories of Programming (UTP) and interactive proof technology in Isabelle  ...  This work is partly by EU H2020 project INTO-CPS, grant agreement 644047, http://into-cps.au.dk/.  ... 
doi:10.1007/978-3-319-51046-0_3 fatcat:5spfjc633vdt3g5hfeupfjgaoq

Hierarchical Specification and Verification of Architectural Design Patterns [chapter]

Diego Marmsoler
2018 Lecture Notes in Computer Science  
Moreover, it describes an algorithm to map a given FACTum specification to a corresponding Isabelle/HOL theory and shows its soundness.  ...  Their description is usually expressed informally and it is not verified whether the proposed specification indeed solves the original design problem.  ...  Parts of the work on which we report in this paper was funded by the German Federal Ministry of Education and Research (BMBF) under grant no. 01Is16043A.  ... 
doi:10.1007/978-3-319-89363-1_9 fatcat:jx3gt4rakzhg3iirgeq5drhbwm

Formal Verification of Cyber-Physical Systems using Theorem Proving (Invited Paper) [article]

Adnan Rashid, Umair Siddique, Sofiene Tahar
2020 arXiv   pre-print
In particular, we survey recent developments in the use of theorem proving, a formal method, for the modeling, analysis and verification of CPS, and overview some real world CPS case studies from the automotive  ...  In fact, a CPS shall adhere to strict safety, reliability, performance and security requirements, where one needs to capture both physical and random aspects of the various CPS modules and then analyze  ...  [34] proposed a framework for the verification of CPS based on Unifying Theories of Programming (UTP) and Isabelle/HOL.  ... 
arXiv:2003.03729v1 fatcat:v57i7srws5afdlixnbype3fztu

A Formal Semantics of the GraalVM Intermediate Representation [article]

Brae J. Webb, Mark Utting, Ian J. Hayes
2021 arXiv   pre-print
As part of a wider project on the verification of optimization passes of GraalVM, this paper describes a semantics for its IR within Isabelle/HOL.  ...  The optimization phase of a compiler is responsible for transforming an intermediate representation (IR) of a program into a more efficient form.  ...  Acknowledgements Mark Utting's position and Brae Webb's scholarship are both funded in part by a gift from Oracle Labs. Thanks especially to Cristina Ci-  ... 
arXiv:2107.01815v1 fatcat:ku642qzjivd4jmq4irzqw4jria

VTOS: Research on Methodology of "Light-Weight" Formal Design and Verification for Microkernel OS [chapter]

Zhenjiang Qian, Hao Huang, Fangmin Song
2013 Lecture Notes in Computer Science  
theorem prover Isabelle/HOL.  ...  In this paper, we present a "light-weight" formal method of design and verification for OS.  ...  On this basis, we verify the consistency of design and implementation of VTOS through reasoning in the Isabelle/HOL logic system.  ... 
doi:10.1007/978-3-319-02726-5_2 fatcat:3h7a27w4bbd4hevgj76jsxpiky

A Verified Decision Procedure for Univariate Real Arithmetic with the BKR Algorithm [article]

Katherine Cordwell and Yong Kiam Tan and André Platzer
2021 arXiv   pre-print
We formalize the univariate fragment of Ben-Or, Kozen, and Reif's (BKR) decision procedure for first-order real arithmetic in Isabelle/HOL.  ...  BKR's algorithm has good potential for parallelism and was designed to be used in practice.  ...  Acknowledgments We would very much like to thank Brandon Bohrer, Fabian Immler, and Wenda Li for useful discussions about Isabelle/HOL and its libraries.  ... 
arXiv:2102.03003v2 fatcat:s2f73nvp2bgaxbffmvlalejeju

Formalising Semantics for Expected Running Time of Probabilistic Programs [chapter]

Johannes Hölzl
2016 Lecture Notes in Computer Science  
We want to use this work to implement a program logic in Isabelle/HOL to verify the expected running time of pGCL programs. We base it on recent work by Kaminski, Katoen, Matheja, and Olmedo.  ...  The first semantics is a denotational semantics providing a direct computation of the running time, similar to the weakest pre-expectation transformer.  ...  Introduction We want to implement expected running time analysis in Isabelle/HOL based on Kaminski et al. [9] .  ... 
doi:10.1007/978-3-319-43144-4_30 fatcat:ldcfxkpvrbapvpyma4p2berdvm

Verification Framework for Control System Functionality of Unmanned Aerial Vehicles [article]

Omar A. Jasim, Sandor M. Veres
2020 arXiv   pre-print
To illustrate the proceedures, a higher-order logic interactive theorem-prover and an automated theorem-prover are utilized to formally verify a nonlinear attitude control system of a generic multi-rotor  ...  using Isabelle/HOL prover.  ...  Isabelle/HOL expressions and symbols are described in Table 1 .  ... 
arXiv:2006.10860v1 fatcat:uc2ecw5dg5bn3hznxjsslimsqi

Certified Ordered Completion [article]

Christian Sternagel, Sarah Winkler
2018 arXiv   pre-print
As a remedy to this situation we give an Isabelle/HOL formalization of ordered rewriting and completion that comes with a formally verified certifier for ordered completion proofs.  ...  On the one hand, ordered completion is a fundamental technique in equational theorem proving that is employed by automated tools.  ...  Together with Hirokawa and Middeldorp we reported on another Isabelle/HOL formalization of ordered completion [3] .  ... 
arXiv:1805.10090v1 fatcat:zg2pl4ea5ndn3idlqkbw37gbpe
« Previous Showing results 1 — 15 out of 160 results