On the public citation graph
A comparison of PVS and Isabelle/HOL
0 signed · 44 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-61042-1_52openalex-snapshot
Generic system support for deductive program development
inferredcites →https://doi.org/10.1007/978-3-7091-7491-3_17openalex-snapshot
Evaluating the Interfaces of Three Theorem Proving Assistants
inferredcites →https://doi.org/10.1007/bfb0028402openalex-snapshot
Type classes and overloading in higher-order logic
inferredcites →https://doi.org/10.1007/bfb0028403openalex-snapshot
A comparative study of Coq and HOL
inferredcites →https://doi.org/10.1007/bfb0031813openalex-snapshot
PVS: Combining specification, proof checking, and model checking
inferredcites →https://doi.org/10.1007/bfb0053566openalex-snapshot
Reasoning about classes in object-oriented languages: Logical models and tools
inferredcites →https://doi.org/10.1016/s0049-237x(09)70189-2openalex-snapshot
Constructive Mathematics and Computer Programming
inferredcites →https://doi.org/10.1017/cbo9780511569807.006openalex-snapshot
The Boyer-Moore prover and Nuprl: an experimental comparison
inferredcites →https://doi.org/10.1098/rsta.1984.0073openalex-snapshot
Constructive mathematics and computer programming
inferredcites →https://doi.org/10.1109/32.588536openalex-snapshot
Comparing verification systems: interactive consistency in ACL2
inferredcites →https://doi.org/10.1109/32.713327openalex-snapshot
Subtypes for specifications: predicate subtyping in PVS
inferredcites →https://doi.org/10.1145/287000.287023openalex-snapshot
Formalizing space shuttle software requirements
inferredcites →https://doi.org/10.1145/75277.75283openalex-snapshot
How to make ad-hoc polymorphism less ad hoc
inferredcites →https://doi.org/10.17863/cam.23640openalex-snapshot
ISABELLE - THE NEXT 700 THEOREM PROVERS
inferredcites →https://doi.org/10.7146/brics.v2i37.19940openalex-snapshot
Experiments with ZF Set Theory in HOL and Isabelle
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11576280_27openalex-snapshot
Incremental Verification of Owicki/Gries Proof Outlines Using PVS
inferred← citeshttps://doi.org/10.1007/3-540-36469-2_15openalex-snapshot
Comparing Mathematical Provers
inferred← citeshttps://doi.org/10.1007/3-540-46428-x_20openalex-snapshot
Java Program Verification via a Hoare Logic with Abrupt Termination
inferred← citeshttps://doi.org/10.1007/978-3-319-98938-9_3openalex-snapshot
Reasoning About JML: Differences Between KeY and OpenJML
inferred← citeshttps://doi.org/10.1007/978-3-540-37621-7_7openalex-snapshot
Java Program Verification at Nijmegen: Developments and Perspective
inferred← citeshttps://doi.org/10.1007/978-3-540-44616-3_1openalex-snapshot
A Type-Theoretic Memory Model for Verification of Sequential Java Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-44616-3_3openalex-snapshot
Principles and Pragmatics of Subtyping in PVS
inferred← citeshttps://doi.org/10.1007/978-3-642-11811-1_40openalex-snapshot
On an Extensible Rule-Based Prover for Event-B
inferred← citeshttps://doi.org/10.1007/978-3-642-39320-4_13openalex-snapshot
A Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-39698-4_5openalex-snapshot
Practical Theory Extension in Event-B
inferred← citeshttps://doi.org/10.1007/s10817-015-9324-6openalex-snapshot
The Reflective Milawa Theorem Prover is Sound (Down to the Machine Code that Runs it)
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.006openalex-snapshot
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
inferred← citeshttps://doi.org/10.1016/s0951-8320(02)00009-1openalex-snapshot
A tool based approach to checking logical consistency in accident reports
inferred← citeshttps://doi.org/10.1023/a:1014530313153openalex-snapshot
Mark, a Reasoning Kit for Mobility
inferred← citeshttps://doi.org/10.1109/aswec.2001.948514openalex-snapshot
An environment for specifying and verifying security properties
inferred← citeshttps://doi.org/10.21236/ada423822openalex-snapshot
Security/Trust as a Polymorphic Computing Constraint
inferred← citeshttps://doi.org/10.25911/5d6e4c3c4b543openalex-snapshot
A formalisation of the theory of context-free languages in higher order logic
inferred← citeshttps://doi.org/10.26076/e00c-7bbfopenalex-snapshot
A Formal Approach to Specifying and Verifying Spacecraft Behavior
inferred← citeshttps://doi.org/10.3929/ethz-a-005635243openalex-snapshot
Proofs for the working engineer
inferred← citeshttps://doi.org/10.4230/lipics.itp.2025.26openalex-snapshot
Improving the SMT Proof Reconstruction Pipeline in Isabelle/HOL
inferred← citeshttps://doi.org/10.48456/tr-601openalex-snapshot
Combining model checking and theorem proving
inferred← citeshttps://doi.org/10.48550/arxiv.1303.4193openalex-snapshot
A Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1912.03028openalex-snapshot
A Survey on Theorem Provers in Formal Methods
inferred← citeshttps://doi.org/10.6100/ir612838openalex-snapshot
Constructive formal methods and protocol standardization
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.