On the public citation graph

Experience with literate programming in the modelling and validation of systems

https://doi.org/10.1007/bfb0054185
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.1002/spe.4380150703openalex-snapshot
Rcs — a system for version control
inferredcites →https://doi.org/10.1007/bfb0035403openalex-snapshot
The bounded retransmission protocol must be on time!
inferredcites →https://doi.org/10.1007/s100090050010openalex-snapshot
Uppaal in a nutshell
inferredcites →https://doi.org/10.1016/0141-1195(83)90118-3openalex-snapshot
Software engineering: A practitioner's approach
inferredcites →https://doi.org/10.1090/dimacs/032/05openalex-snapshot
The application of PROMELA and SPIN in the BOS project
inferredcites →https://doi.org/10.1093/comjnl/27.2.97openalex-snapshot
Literate Programming
inferredcites →https://doi.org/10.1109/32.588521openalex-snapshot
The model checker SPIN
inferredcites →https://doi.org/10.1109/52.311070openalex-snapshot
Literate programming simplified

What points at this work

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

inferred← citeshttps://doi.org/10.1002/0471028959.sof332openalex-snapshot
Software Tools
inferred← citeshttps://doi.org/10.1007/10722468_5openalex-snapshot
Verification and Optimization of a PLC Control Schedule
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_47openalex-snapshot
As Cheap as Possible: Effcient Cost-Optimal Reachability for Priced Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-44829-2_1openalex-snapshot
Optimal Scheduling Using Branch and Bound with SPIN 4.0
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_13openalex-snapshot
Efficient Guiding Towards Cost-Optimality in UPPAAL
inferred← citeshttps://doi.org/10.1007/3-540-46017-9_12openalex-snapshot
The Agreement Problem Protocol Verification Environment
inferred← citeshttps://doi.org/10.1007/3-540-48234-2_8openalex-snapshot
Xspin/Project - Integrated Validation Management for Xspin
inferred← citeshttps://doi.org/10.1007/978-3-030-72013-1_23openalex-snapshot
Momba: JANI Meets Python
inferred← citeshttps://doi.org/10.1007/978-3-031-16767-6_4openalex-snapshot
Model Checking Meets Auto-Tuning of High-Performance Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-32582-8_4openalex-snapshot
Using SPIN for the Optimized Scheduling of Discrete Event Systems in Manufacturing
inferred← citeshttps://doi.org/10.1007/978-3-319-53354-4_2openalex-snapshot
Two Model Checking Approaches to Branch-and-Bound Optimization of a Flow Production System
inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_9openalex-snapshot
Symbolic Model Checking for Simply-Timed Systems
inferred← citeshttps://doi.org/10.1007/s00766-002-0154-9openalex-snapshot
Lightweight models for interpreting informal specifications
inferred← citeshttps://doi.org/10.1007/s10009-002-0078-1openalex-snapshot
Managing the verification trajectory
inferred← citeshttps://doi.org/10.1007/s10009-002-0079-0openalex-snapshot
Verification and Optimization of a PLC Control Schedule
inferred← citeshttps://doi.org/10.1007/s10009-018-0498-1openalex-snapshot
A case study of planning for smart factories
inferred← citeshttps://doi.org/10.1007/s10958-025-07687-3openalex-snapshot
USING THE SPIN MODEL CHECKER FOR AUTO-TUNING HIGH-PERFORMANCE PROGRAMS
inferred← citeshttps://doi.org/10.1109/contel.2007.381862openalex-snapshot
From Declarative Model to Solution: Scheduling Scenario Synthesis
inferred← citeshttps://doi.org/10.1109/contel.2007.381898openalex-snapshot
From Declarative Model to Solution: Scheduling Scenario Synthesis
inferred← citeshttps://doi.org/10.1109/fmcad.2008.ecp.25openalex-snapshot
Scheduling Optimisations for SPIN to Minimise Buffer Requirements in Synchronous Data Flow
inferred← citeshttps://doi.org/10.1177/1536867x1601600408openalex-snapshot
Rethinking Literate Programming in Statistics
inferred← citeshttps://doi.org/10.18255/1818-1015-2021-4-338-355openalex-snapshot
Autotuning Parallel Programs by Model Checking
inferred← citeshttps://doi.org/10.29007/6fqkopenalex-snapshot
Model checking Timed CSP
inferred← citeshttps://doi.org/10.3103/s0146411622070045openalex-snapshot
Autotuning Parallel Programs by Model Checking
inferred← citeshttps://doi.org/10.3990/1.9789036515641openalex-snapshot
Towards effective model checking
inferred← citeshttps://doi.org/10.5220/0005705100270037openalex-snapshot
Branch-and-Bound Optimization of a Multiagent System for Flow Production using Model Checking
inferred← citeshttps://doi.org/10.7146/brics.v8i4.20458openalex-snapshot
Efficient Guiding Towards Cost-Optimality in UPPAAL
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.