isabelle hol
Using Isabelle/HOL to verify first-order relativity theory
... of Isabelle/HOL record structures is particularly convenient, since we can easily extend the Body record structure to include new descriptions (once again, we can prove from the axioms introduced to ...
18
Towards Verification of Cyber-Physical Systems with UTP and Isabelle/HOL
... Abstract. In this paper, we outline our vision for building verifica- tion tools for Cyber-Physical Systems based on Hoare and He’s Uni- fying Theories of Programming (UTP) and interactive proof technology in ...
26
A Formal Semantics of the Core DOM in Isabelle/HOL
... To our knowledge, there are only very few formalizations of data structures for manipulating XML-like document structures avail- able. Sternagel and Thiemann [19] present an łXML libraryž for Isabelle/HOL. ...
10
Optics in Isabelle/HOL
... We also add support for record lenses. Every record created can yield a lens for each field. These cannot be created generically and thus must be defined case by case as new records are created. We thus create a new ...
29
Volume 53: Automated Verification of Critical Systems 2012
... Abstract: Published correctness proofs of garbage collectors in separation logic to date depend on extensive manual, interactive formula manipulations. This paper shows that the approach of symbolic execution in ...
16
Automating Verification of State Machines with Reactive Designs and Isabelle/UTP
... A challenge that remains is handling assumptions and guarantees between parallel components, but we believe that abstraction of state machines to in- variants, using our results, can make this tractable. We will also ...
19
Automating Verification of State Machines with Reactive Designs and Isabelle/UTP
... In this paper we present a verification approach for state machines, based on a subset of RoboChart, that has been mechanised in the Isabelle/HOL [4] proof assistant. We mechanise the meta-model, including ...
19
Isabelle/UTP: Mechanised Theory Engineering for Unifying Theories of Programming
... in Isabelle/HOL, including new type definitions, relational constructors, automated proof tactics, and accompanying algebraic ...laws. Isabelle/UTP can be used to both capture laws of programming for ...
169
Isabelle/UTP: Mechanised Theory Engineering for the UTP
... in Isabelle/HOL, including new type definitions, relational constructors, automated proof tactics, and accompanying algebraic ...laws. Isabelle/UTP can be used to both capture laws of programming for ...
163
Generating inductive verification proofs for Isabelle using the partial evaluator Ecce
... assistant Isabelle has been developed as a generic system for implementing logical .... HOL allows to express most mathematical concepts and, in contrast to, for example, First Order Logic, it allows the ...
46
Hybrid Relations in Isabelle/UTP
... In Isabelle/UTP, state spaces are modelled as Isabelle types, and programs are parametric in their state ...using Isabelle/HOL [20,23], and allows us to obtain the UTP relational operators ...
24
Unifying Theories of Programming in Isabelle
... In Section 2, we introduce the basic concepts of UTP: alphabets, signatures, and healthiness conditions, and in Section 3 we outline the idea of theory mech- anisation in Isabelle/HOL. In Section 4, we go ...
48
Unifying Semantic Foundations for Automated Verification Tools in Isabelle/UTP
... is Isabelle/UTP, an implementation of Hoare and He’s Unifying Theories of Programming, a framework for unification of formal ...semantics. Isabelle/UTP permits the mechanisation of computational theories ...
46
Volume 30: Graph and Model Transformation 2010
... control process and P · · · P a network of homogeneous processes. The operator is some kind of parallel composition, which may be equipped with hiding and renaming of communi- cation channels. Network Invariants can be ...
16
HOL-TestGen 1.8.0 User Guide
... the HOL-level, the SML-level, and the C-level, there are different repre- sentations of basic data-types possible; the translation process of data to and from the C-code under test has therefore to be carefully ...
112
Proceedings of ACL 2018, Student Research Workshop
... Jacob Andreas, University of California, Berkeley Isabelle Augenstein, Department of Computer Science, University of Copenhagen Petr Babkin, Rensselaer Polytechnic Institute Fan Bai, The[r] ...
10
Tools and techniques for formalising structural proof theory
... the Weakening case, all of the cases were informally sketched. Roughly a quarter of the formal proof was shown. The number of proof steps is 779. The proof in [Ridge, 2006] for classical logic was adapted for ...
234
Taum Aviation: Its Technical Features and Some Experimental Results
... Pierre Isabelle and Laurent Bourbeau TAUM-AVIATION: Its Technical Features and Some Experimental Results.. Metalanguage compiler sizes..[r] ...
10
Cut elimination, substitution and normalisation
... Our result is for all the connectives of intuitionistic zero-order logic, including disjunction. Given that there are examples in (for example) [21] illustrating the difficulty with disjunction, this may be surprising. ...
20
KIERKEGAARD AND THE ASH‘ARITES ON REASON AND THEOLOGY
... 3-1) The rejection of the anti-rationalism of Kierkegaard and the Ash‘arites Faith, in the analysis of Kierkegaard and the Ash„arites, is not anti- rational. Kierkegaard hol[r] ...
18