Cited in
(68)- Transition_Systems_and_Automata
- A graph library for Isabelle
- CoSMed: a confidentiality-verified social media platform
- Formally verified algorithms for upper-bounding state space diameters
- CoSMed: a confidentiality-verified social media platform
- From LCF to Isabelle/HOL
- Formalisation in higher-order logic and code generation to functional languages of the Gauss-Jordan algorithm
- From LTL to deterministic automata. A safraless compositional approach
- CoCon: a conference management system with formally verified document confidentiality
- Certifying proofs for SAT-based model checking
- Optimising the ProB model checker for B using partial order reduction
- Formal verification of an executable LTL model checker with partial order reduction
- Comprehending Isabelle/HOL’s Consistency
- JGraphT
- CakeML
- TeMP
- Poly/ML
- Locales
- Autoref
- Eisbach
- ConfiChair
- CFML
- libclang
- Jif
- CoSMed
- Ur/Web
- Efficient verified (UN)SAT certificate checking
- ltl2dstar
- Fiat
- CAMPY
- GRAT
- InKreSAT
- Pfold
- CAVA Automata Library
- CAVA
- Dijkstra Shortest Path
- Edmonds-Karp
- Collections
- Gauss-Jordan
- Markov Models
- Myhill-Nerode
- Perron Frobenius
- NASA PVS
- Refinement Monadic
- Gabow SCC
- LTL_to_DRA
- Finite Automata HF
- Hotel Key Card
- Hereditarily Finite Sets
- Imperative Refinement
- Knuth Morris Pratt
- LTL_to_GBA
- Stuttering Equivalence
- Real_Impl
- Tree Automata
- BDDTab
- AutoCorres
- JRIF
- IEEE_Floating_Point
- Program-Conflict-Analysis
- Dune
- Automatic refinement to efficient data structures: a comparison of two approaches
- FlowFox
- Boolean_Expression_Checkers
- CoCon
- Pacheck
- Refinement to imperative HOL
- Markov chains and Markov decision processes in Isabelle/HOL
This page was built for software: CAVA LTL Modelchecker
