On the public citation graph

A machine-checked proof of the optimality of a real-time scheduling policy

https://doi.org/10.1007/bfb0028759
0 signed · 18 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-58468-4_194openalex-snapshot
A formal proof of the Deadline Driven scheduler
inferredcites →https://doi.org/10.1007/bf00249024openalex-snapshot
Proving Matijasevich's lemma with a default arithmetic strategy
inferredcites →https://doi.org/10.1016/0378-4754(89)90181-xopenalex-snapshot
A computational logic handbook
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

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-25543-5_28openalex-snapshot
Integrating Formal Schedulability Analysis into a Verified OS Kernel
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00813-7openalex-snapshot
Automatic synthesis of a subclass of schedulers in timed systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80334-2openalex-snapshot
Automatic Synthesis of Schedulers in Timed Systems
inferred← citeshttps://doi.org/10.1109/dcfts.1999.814301openalex-snapshot
Invariant performance: a statement of task isolation useful for embedded application integration
inferred← citeshttps://doi.org/10.1109/ecrts.2016.28openalex-snapshot
PROSA: A Case for Readable Mechanized Schedulability Analysis
inferred← citeshttps://doi.org/10.1109/icse.2004.1317453openalex-snapshot
Feature-based decomposition of inductive proofs applied to real-time avionics software: an experience report
inferred← citeshttps://doi.org/10.1109/real.2000.896005openalex-snapshot
Formal analysis of the priority ceiling protocol
inferred← citeshttps://doi.org/10.1109/rtas54340.2022.00030openalex-snapshot
A Formal Correctness Proof for an EDF Scheduler Implementation
inferred← citeshttps://doi.org/10.1109/rtcsa52859.2021.00018openalex-snapshot
A generic approach for the certified schedulability analysis of software systems
inferred← citeshttps://doi.org/10.1109/rtss55097.2022.00026openalex-snapshot
From Intuition to Coq: A Case Study in Verified Response-Time Analysis 1 of FIFO Scheduling
inferred← citeshttps://doi.org/10.1109/tase49443.2020.00016openalex-snapshot
Real-time MTL with durations as SMT with applications to schedulability analysis
inferred← citeshttps://doi.org/10.1145/3371088openalex-snapshot
Virtual timeline: a formal abstraction for verifying preemptive schedulers with temporal isolation
inferred← citeshttps://doi.org/10.1145/3563290openalex-snapshot
Compositional virtual timelines: verifying dynamic-priority partitions with algorithmic temporal isolation
inferred← citeshttps://doi.org/10.70675/43adeeecz02d3z4c27zab4ez0373161078a9openalex-snapshot
Certified Tools for Schedulability Analyses
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.