On the public citation graph
Axioms and proof rules for Ada tasks
0 signed · 22 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_2openalex-snapshot
Cooperating Sequential Processes
inferredcites →https://doi.org/10.1007/bfb0022469openalex-snapshot
On the absence of livelocks in parallel programs
inferredcites →https://doi.org/10.1109/icdcs.2002.1022236openalex-snapshot
Proceedings 22nd International Conference on Distributed Computing Systems
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-15239-3_18openalex-snapshot
Barringer & Mearns: Verification of Ada Tasks
inferred← citeshttps://doi.org/10.1007/bfb0012774openalex-snapshot
A sound and complete HOARE axiomatization of the ADA-rendezvous
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90049-5openalex-snapshot
Cooperating proofs for distributed programs with multiparty interactions
inferred← citeshttps://doi.org/10.1016/0164-1212(91)90065-eopenalex-snapshot
An isolation approach to symbolic execution-based verification of Ada tasking programs
inferred← citeshttps://doi.org/10.1016/0164-1212(94)00101-4openalex-snapshot
AIDA: A dynamic analyzer for Ada programs
inferred← citeshttps://doi.org/10.1016/0167-6423(83)90005-9openalex-snapshot
Extended naming conventions for communicating processes
inferred← citeshttps://doi.org/10.1016/0167-6423(84)90018-2openalex-snapshot
A proof system for concurrent ADA programs
inferred← citeshttps://doi.org/10.1016/0950-5849(94)90090-6openalex-snapshot
AIDA: a dynamic analyser for Ada programs
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50007-3openalex-snapshot
Concepts and notations for concurrent programming**Reprinted from: ACM Computing Surveys, 15(1), March 1983 with permission of the Association for Computing Machinery Inc.
inferred← citeshttps://doi.org/10.1109/32.44363openalex-snapshot
Verifying general safety properties of Ada tasking programs
inferred← citeshttps://doi.org/10.1109/ada.1988.4780openalex-snapshot
Symbolic execution-based verification of Ada tasking programs
inferred← citeshttps://doi.org/10.1109/ada.1988.4781openalex-snapshot
An interleaving symbolic execution approach for the formal verification of Ada programs with tasking
inferred← citeshttps://doi.org/10.1109/hicss.1990.205212openalex-snapshot
Temporal specification of Ada tasks
inferred← citeshttps://doi.org/10.1145/170791.170855openalex-snapshot
Analysis of timing hazards in Ada programs
inferred← citeshttps://doi.org/10.1145/255471.255472openalex-snapshot
Proving specifications of tasking systems using Ada/TL
inferred← citeshttps://doi.org/10.1145/356901.356903openalex-snapshot
Concepts and Notations for Concurrent Programming
inferred← citeshttps://doi.org/10.1145/579.583openalex-snapshot
Using message passing for distributed programming: proof rules and disciplines
inferred← citeshttps://doi.org/10.1145/88616.96551openalex-snapshot
Using symbolic execution for verification of Ada tasking programs
inferred← citeshttps://doi.org/10.29007/65ltopenalex-snapshot
Howard Barringer: the Man who Invented the Past
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.