This technical report contains Isabelle/HOL theories that describe algebras for iteration, infinite executions and correctness of sequential computations. The results are explained in a separate document. The following files are available: Technical Report Isabelle/HOL theory file
In this thesis, extensions of Kleene algebras are used to develop algebras for rely-guarantee style ...
AbstractA formalized theory of alpha-conversion for the π-calculus in Isabelle/HOL is presented. Fol...
We describe a formalization of asymptotic O notation using the Isabelle / HOL proof assistant
Isabelle/HOL is a generic proof assistant. Using Isabelle/HOL requires insight into procedures as we...
The interactive theorem prover Isabelle/HOL is used to verify elementary theorems of classical exten...
We present a formalization of Abadi's and Cardelli's theory of objects in the interactive theorem pr...
This is an overview of a formalisation project in the proof assistant Isabelle/HOL of a number of re...
The interactive theorem prover Isabelle/HOL is based on the well understood higher-order logic (HOL)...
We give an overview of our formalizations in the proof assistant Isabelle/HOL of certain irrationali...
International audienceIsaFoL (Isabelle Formalization of Logic) is an undertaking that aims at develo...
The proof assistant Isabelle/HOL is based on an extension of Higher-Order Logic (HOL) with ad hoc ov...
Isabelle/UTP is a mechanised theory engineering toolkit based on Hoare and He’s Unifying Theories of...
As verification efforts using interactive theorem proving grow, we are in need of certified algorith...
We give an overview of our formalizations in the proof assistant Isabelle/HOL of certain irrationali...
The proof assistant Isabelle/HOL is based on an extension of Higher-Order Logic (HOL) with ad hoc ov...
In this thesis, extensions of Kleene algebras are used to develop algebras for rely-guarantee style ...
AbstractA formalized theory of alpha-conversion for the π-calculus in Isabelle/HOL is presented. Fol...
We describe a formalization of asymptotic O notation using the Isabelle / HOL proof assistant
Isabelle/HOL is a generic proof assistant. Using Isabelle/HOL requires insight into procedures as we...
The interactive theorem prover Isabelle/HOL is used to verify elementary theorems of classical exten...
We present a formalization of Abadi's and Cardelli's theory of objects in the interactive theorem pr...
This is an overview of a formalisation project in the proof assistant Isabelle/HOL of a number of re...
The interactive theorem prover Isabelle/HOL is based on the well understood higher-order logic (HOL)...
We give an overview of our formalizations in the proof assistant Isabelle/HOL of certain irrationali...
International audienceIsaFoL (Isabelle Formalization of Logic) is an undertaking that aims at develo...
The proof assistant Isabelle/HOL is based on an extension of Higher-Order Logic (HOL) with ad hoc ov...
Isabelle/UTP is a mechanised theory engineering toolkit based on Hoare and He’s Unifying Theories of...
As verification efforts using interactive theorem proving grow, we are in need of certified algorith...
We give an overview of our formalizations in the proof assistant Isabelle/HOL of certain irrationali...
The proof assistant Isabelle/HOL is based on an extension of Higher-Order Logic (HOL) with ad hoc ov...
In this thesis, extensions of Kleene algebras are used to develop algebras for rely-guarantee style ...
AbstractA formalized theory of alpha-conversion for the π-calculus in Isabelle/HOL is presented. Fol...
We describe a formalization of asymptotic O notation using the Isabelle / HOL proof assistant
DOI
Add to ORKG