On the public citation graph

Traces of I/O-automata in Isabelle/HOLCF

https://doi.org/10.1007/bfb0030627
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.1006/inco.1995.1134openalex-snapshot
Forward and Backward Simulations
inferredcites →https://doi.org/10.1006/inco.1996.0056openalex-snapshot
Full Abstraction for a Shared-Variable Parallel Language
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-58468-4_165openalex-snapshot
Verification of an audio control protocol
inferredcites →https://doi.org/10.1007/3-540-60275-5_72openalex-snapshot
HOLCF: Higher order logic of computable functions
inferredcites →https://doi.org/10.1007/3-540-60579-7_6openalex-snapshot
I/O automata in Isabelle/HOL
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-61042-1_48openalex-snapshot
Formal verification of a partial-order reduction technique for model checking
inferredcites →https://doi.org/10.1007/978-0-387-34878-0_19openalex-snapshot
Verifying Timing Properties of Concurrent Algorithms
inferredcites →https://doi.org/10.1007/bf01383986openalex-snapshot
A formal theory of simulations between infinite automata
inferredcites →https://doi.org/10.1007/bfb0030541openalex-snapshot
Isabelle
inferredcites →https://doi.org/10.1016/0168-0072(96)88189-9openalex-snapshot
Computation on abstract data types. The extensional approach, with an application to streams
inferredcites →https://doi.org/10.1017/cbo9780511526602openalex-snapshot
Logic and Computation
inferredcites →https://doi.org/10.1109/lics.1988.5115openalex-snapshot
The existence of refinement mappings
inferredcites →https://doi.org/10.1145/3788687openalex-snapshot
An Introduction to Input/Output Automata
inferredcites →https://doi.org/10.48456/tr-304openalex-snapshot
Co-induction and co-recursion in higher-order logic

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-62034-6_48openalex-snapshot
Winskel is (almost) right
inferred← citeshttps://doi.org/10.1007/978-3-540-49020-3_13openalex-snapshot
Owicki/Gries in Isabelle/HOL
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/978-3-8348-9703-9openalex-snapshot
Eigenschaftsorientierte Beschreibung der logischen Architektur eingebetteter Systeme
inferred← citeshttps://doi.org/10.1007/bfb0028388openalex-snapshot
Possibly infinite sequences in theorem provers: A comparative study
inferred← citeshttps://doi.org/10.1007/bfb0035399openalex-snapshot
Theorem prover support for the refinement of stream processing functions
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/bfb0055652openalex-snapshot
Checking verifications of protocols and distributed systems by computer
inferred← citeshttps://doi.org/10.1007/s001650050009openalex-snapshot
Winskel is (almost) Right: Towards a Mechanized Semantics Textbook
inferred← citeshttps://doi.org/10.1007/s10703-006-0004-3openalex-snapshot
Cones and foci: A mechanical framework for protocol verification
inferred← citeshttps://doi.org/10.1017/s095679689900341xopenalex-snapshot
HOLCF = HOL + LCF
inferred← citeshttps://doi.org/10.1023/a:1008764923992openalex-snapshot
Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394
inferred← citeshttps://doi.org/10.1093/comjnl/40.10.640openalex-snapshot
Treating Partiality in a Logic of Total Functions
inferred← citeshttps://doi.org/10.1155/2014/892832openalex-snapshot
Formal Proof of a Machine Closed Theorem in Coq
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.