On the public citation graph
Proving precedence properties: The temporal way
0 signed · 50 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/3-540-10843-2_22openalex-snapshot
Impartiality, justice and fairness: The ethics of concurrent termination
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1007/bfb0025785openalex-snapshot
Verification of concurrent programs: Temporal proof principles
inferredcites →https://doi.org/10.1016/0020-0190(81)90106-xopenalex-snapshot
Myths about the mutual exclusion problem
inferredcites →https://doi.org/10.1016/0378-4754(83)90038-1openalex-snapshot
The correctness problem in computer science
inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot
Proving the Correctness of Multiprocess Programs
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/360248.360251openalex-snapshot
Formal verification of parallel programs
inferredcites →https://doi.org/10.1145/567067.567082openalex-snapshot
How to cook a temporal proof system for your pet language
inferredcites →https://doi.org/10.1145/567446.567463openalex-snapshot
"Sometime" is sometimes "not never"
inferredcites →https://doi.org/10.21236/ada116035openalex-snapshot
Verification of Concurrent Programs. Part II. Temporal Proof Principles.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1994.1060openalex-snapshot
Temporal Proof Methodologies for Timed Transition-Systems
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_23openalex-snapshot
On the relation of programs and computations to models of temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_20openalex-snapshot
Automated verification of timed transition models
inferred← citeshttps://doi.org/10.1007/978-1-4615-3220-0_4openalex-snapshot
Modeling Real-Time and Reliability
inferred← citeshttps://doi.org/10.1007/978-3-662-02880-3_10openalex-snapshot
A Temporal Proof Methodology for Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-94-009-3461-0_2openalex-snapshot
Formal Support for Development of Safety Related Systems
inferred← citeshttps://doi.org/10.1007/bf01888216openalex-snapshot
Branching versus linear logics yet again
inferred← citeshttps://doi.org/10.1007/bfb0013024openalex-snapshot
The anchored version of the temporal framework
inferred← citeshttps://doi.org/10.1007/bfb0016280openalex-snapshot
A proof system to derive eventuality properties under justice hypothesis
inferred← citeshttps://doi.org/10.1007/bfb0022111openalex-snapshot
On the specification of real-time systems using logic programming
inferred← citeshttps://doi.org/10.1007/bfb0027047openalex-snapshot
Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends
inferred← citeshttps://doi.org/10.1007/bfb0031988openalex-snapshot
Logics and models of real time: A survey
inferred← citeshttps://doi.org/10.1007/bfb0036892openalex-snapshot
Automata, Languages and Programming
inferred← citeshttps://doi.org/10.1016/0010-4655(88)90117-8openalex-snapshot
Formal specification of real time systems
inferred← citeshttps://doi.org/10.1016/0164-1212(90)90074-vopenalex-snapshot
TRIO: A logic language for executable specifications of real-time systems
inferred← citeshttps://doi.org/10.1016/0167-6423(84)90003-0openalex-snapshot
Adequate proof principles for invariance and liveness properties of concurrent programs
inferred← citeshttps://doi.org/10.1016/0306-4379(91)90001-popenalex-snapshot
Formal techniques for systems specification and verification
inferred← citeshttps://doi.org/10.1016/j.jss.2016.03.064openalex-snapshot
An approach to modeling and developing teleo-reactive systems considering timing constraints
inferred← citeshttps://doi.org/10.1023/a:1012581223007openalex-snapshot
Application of Modal Logics to the Specification and Verification of Programs
inferred← citeshttps://doi.org/10.1051/ita/1985190302611openalex-snapshot
On temporal program verification rules
inferred← citeshttps://doi.org/10.1051/ita/1987210302871openalex-snapshot
Méthode axiomatique sur les propriétés de fatalité des programmes parallèles
inferred← citeshttps://doi.org/10.1109/21.310517openalex-snapshot
A reachability synthesis procedure for discrete event systems in a temporal logic framework
inferred← citeshttps://doi.org/10.1109/32.21744openalex-snapshot
Extending Ina Jo with temporal logic
inferred← citeshttps://doi.org/10.1109/32.910858openalex-snapshot
An interval logic for real-time system specification
inferred← citeshttps://doi.org/10.1109/71.80145openalex-snapshot
Deciding properties of timed transition models
inferred← citeshttps://doi.org/10.1109/ccece.1993.332301openalex-snapshot
A visual-programming environment for a temporal logic language
inferred← citeshttps://doi.org/10.1109/hase.2014.40openalex-snapshot
Verifying the Precedence Property Pattern Using the B Method
inferred← citeshttps://doi.org/10.1109/hicss.1989.47998openalex-snapshot
Formal approach to development of critical computer applications
inferred← citeshttps://doi.org/10.1109/icdcs.1989.37949openalex-snapshot
Verifying finite state real-time discrete event processes
inferred← citeshttps://doi.org/10.1109/iceccs.1996.558324openalex-snapshot
Using TILCO for specifying real-time systems
inferred← citeshttps://doi.org/10.1109/real.1989.63560openalex-snapshot
Real-time temporal logic decision procedures
inferred← citeshttps://doi.org/10.1145/318593.318622openalex-snapshot
Checking that finite state concurrent programs satisfy their linear specification
inferred← citeshttps://doi.org/10.1145/349194.349197openalex-snapshot
Temporal logics for real-time system specification
inferred← citeshttps://doi.org/10.1145/99583.99629openalex-snapshot
Temporal proof methodologies for real-time systems
inferred← citeshttps://doi.org/10.21236/ada227320openalex-snapshot
Tools and Rules for the Practicing Verifier
inferred← citeshttps://doi.org/10.48550/arxiv.1005.3200openalex-snapshot
Real-time and Probabilistic Temporal Logics: An Overview
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.