On the public citation graph

Human-style theorem proving using PVS

0 signed · 35 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-58043-3_24openalex-snapshot
Simulation techniques for proving properties of real-time systems
inferredcites →https://doi.org/10.1007/3-540-58468-4_189openalex-snapshot
Towards a duration calculus proof assistant in PVS
inferredcites →https://doi.org/10.1007/3-540-60275-5_56openalex-snapshot
Automatically synthesized term denotation predicates: A proof aid
inferredcites →https://doi.org/10.1007/3-540-60275-5_59openalex-snapshot
Deciding cryptographic protocol adequacy with HOL
inferredcites →https://doi.org/10.1007/3-540-60472-3_14openalex-snapshot
HyTech: The Cornell Hybrid Technology Tool
inferredcites →https://doi.org/10.1007/3-540-61474-5_93openalex-snapshot
Symbolic model checking
inferredcites →https://doi.org/10.1007/978-1-4615-3190-6openalex-snapshot
Symbolic Model Checking
inferredcites →https://doi.org/10.1007/bfb0014724openalex-snapshot
Verifying hybrid systems modeled as timed automata: A case study
inferredcites →https://doi.org/10.1007/bfb0027243openalex-snapshot
Proving safety properties of the steam boiler controller
inferredcites →https://doi.org/10.1007/bfb0031984openalex-snapshot
Real-Time: Theory in Practice
inferredcites →https://doi.org/10.1007/bfb0032002openalex-snapshot
Forward and backward simulations for timing-based systems
inferredcites →https://doi.org/10.1007/bfb0105406openalex-snapshot
A mizar mode for HOL
inferredcites →https://doi.org/10.1016/0898-1221(95)90267-8openalex-snapshot
Computer-aided verification of coordinating processes: The automata-theoretic approach
inferredcites →https://doi.org/10.1080/00029890.1995.12004627openalex-snapshot
How to Write a Proof
inferredcites →https://doi.org/10.1109/real.1994.342724openalex-snapshot
The generalized railroad crossing: a case study in formal verification of real-time systems
inferredcites →https://doi.org/10.1109/real.1996.563701openalex-snapshot
Correctness of vehicle control systems-a case study
inferredcites →https://doi.org/10.1109/rttas.1996.509536openalex-snapshot
Mechanical verification of timed automata: a case study
inferredcites →https://doi.org/10.1145/259380.259422openalex-snapshot
Specifying and using a partitionable group communication service
inferredcites →https://doi.org/10.1515/9781400864041openalex-snapshot
Computer-Aided Verification of Coordinating Processes
inferredcites →https://doi.org/10.7939/r3c84jopenalex-snapshot
A Note on "How to Write a Proof"

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-64354-6_11openalex-snapshot
Usability Recommendations for User Guidance in Deductive Program Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-15201-1_1openalex-snapshot
A Usability Evaluation of Interactive Theorem Provers Using Focus Groups
inferred← citeshttps://doi.org/10.1007/978-3-642-32332-4_9openalex-snapshot
Logic-Based Formalisms
inferred← citeshttps://doi.org/10.1007/bfb0055145openalex-snapshot
I/O automata and beyond: Temporal logic and abstraction in Isabelle
inferred← citeshttps://doi.org/10.1007/s11390-005-0526-yopenalex-snapshot
LFTOP: An LF-Based Approach to Domain-Specific Reasoning
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.08.020openalex-snapshot
PVS Embedding of cCSP Semantic Models and Their Relationship
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00045-7openalex-snapshot
Proof assistance for real-time systems using an interactive theorem prover
inferred← citeshttps://doi.org/10.1023/a:1016320523091openalex-snapshot
Proving Invariants of I/O Automata with TAME
inferred← citeshttps://doi.org/10.1023/a:1018913028597openalex-snapshot
TAME: Using PVS strategies for special-purpose theorem proving
inferred← citeshttps://doi.org/10.1109/formalise.2015.16openalex-snapshot
Obtaining Trust in Autonomous Systems: Tools for Formal Model Synthesis and Validation
inferred← citeshttps://doi.org/10.1145/349360.351127openalex-snapshot
Using TAME to prove invariants of automata models
inferred← citeshttps://doi.org/10.1145/383876.383877openalex-snapshot
Automated deductive requirements analysis of critical systems
inferred← citeshttps://doi.org/10.21236/ada375903openalex-snapshot
Applying TAME to I/O Automata: A User's Perspective
inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot
Assertion level proof planning with compiled strategies
inferred← citeshttps://doi.org/10.82444/warw.33696865openalex-snapshot
Data fusion for human intelligence and crisis management : handling information from untrusted sources
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.