On the public citation graph

I/O automata and beyond: Temporal logic and abstraction in Isabelle

https://doi.org/10.1007/bfb0055145
0 signed · 32 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-56922-7_25openalex-snapshot
Computer-assisted simulation proofs
inferredcites →https://doi.org/10.1007/3-540-58201-0_66openalex-snapshot
Liveness in timed and untimed systems
inferredcites →https://doi.org/10.1007/3-540-58450-1_52openalex-snapshot
A HOL formalisation of the Temporal Logic of Actions
inferredcites →https://doi.org/10.1007/3-540-60630-0_1openalex-snapshot
Combining model checking and deduction for I/O- automata
inferredcites →https://doi.org/10.1007/3-540-61474-5_92openalex-snapshot
STeP: Deductive-algorithmic verification of reactive and real-time systems
inferredcites →https://doi.org/10.1007/3-540-63166-6_50openalex-snapshot
μcke — Efficient μ-calculus model checking
inferredcites →https://doi.org/10.1007/978-1-4612-4222-2openalex-snapshot
Temporal Verification of Reactive Systems
inferredcites →https://doi.org/10.1007/978-3-642-71549-5openalex-snapshot
Temporal Logic of Programs
inferredcites →https://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/bfb0028384openalex-snapshot
Human-style theorem proving using PVS
inferredcites →https://doi.org/10.1007/bfb0028388openalex-snapshot
Possibly infinite sequences in theorem provers: A comparative study
inferredcites →https://doi.org/10.1007/bfb0030541openalex-snapshot
Isabelle
inferredcites →https://doi.org/10.1007/bfb0030627openalex-snapshot
Traces of I/O-automata in Isabelle/HOLCF
inferredcites →https://doi.org/10.1017/s095679689900341xopenalex-snapshot
HOLCF = HOL + LCF
inferredcites →https://doi.org/10.1145/177492.177726openalex-snapshot
The temporal logic of actions

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-48256-3_18openalex-snapshot
From I/O Automata to Timed I/O Automata
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_4openalex-snapshot
Isomorphisms — A Link Between the Shallow and the Deep
inferred← citeshttps://doi.org/10.1007/978-3-030-50086-3_3openalex-snapshot
Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_5openalex-snapshot
A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol
inferred← citeshttps://doi.org/10.1007/978-3-540-71067-7_20openalex-snapshot
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
inferred← citeshttps://doi.org/10.1007/978-3-540-77505-8_25openalex-snapshot
Formalization of CTL* in Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1007/978-3-540-77505-8_9openalex-snapshot
Modular Formalization of Reactive Modules in COQ
inferred← citeshttps://doi.org/10.1007/s00165-017-0433-3openalex-snapshot
Mechanized proofs of opacity: a comparison of two techniques
inferred← citeshttps://doi.org/10.1007/s00446-013-0205-0openalex-snapshot
Partition consistency
inferred← citeshttps://doi.org/10.1017/s095679689900341xopenalex-snapshot
HOLCF = HOL + LCF
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00052openalex-snapshot
Functional Stream Semantics for a Synchronous Block-Diagram Compiler
inferred← citeshttps://doi.org/10.1145/2254064.2254072openalex-snapshot
Speculative linearizability
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2016.35openalex-snapshot
Proving Opacity of a Pessimistic STM
inferred← citeshttps://doi.org/10.46298/lmcs-18(3:7)2022openalex-snapshot
Modularising Verification Of Durable Opacity
inferred← citeshttps://doi.org/10.48550/arxiv.1306.0077openalex-snapshot
Partition Consistency: A Case Study in Modeling Systems with Weak Memory Consistency and Proving Correctness of their Implementations
inferred← citeshttps://doi.org/10.5075/epfl-thesis-6085openalex-snapshot
Modularity in the design of robust distributed algorithms
inferred← citeshttps://doi.org/10.5753/jidm.2015.1556openalex-snapshot
A New Technique for Verifying the Consistency of Distributed R-Trees
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.