On the public citation graph
Decision Problems for the Verification of Real-Time Software
0 signed · 40 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.1006/inco.1999.2843openalex-snapshot
Algorithmic Analysis of Programs with Well Quasi-ordered Domains
inferredcites →https://doi.org/10.1007/10722468_7openalex-snapshot
Bebop: A Symbolic Model Checker for Boolean Programs
inferredcites →https://doi.org/10.1007/11523468_88openalex-snapshot
Decidability and Complexity Results for Timed Automata via Channel Machines
inferredcites →https://doi.org/10.1007/3-540-60472-3_4openalex-snapshot
On the automatic verification of systems with continuous variables and unbounded discrete data structures
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0304-3975(00)00102-xopenalex-snapshot
Well-structured transition systems everywhere!
inferredcites →https://doi.org/10.1016/s0304-3975(02)00743-0openalex-snapshot
Pushdown timed automata: a binary reachability characterization and safety verification
inferredcites →https://doi.org/10.1109/lics.1996.561359openalex-snapshot
General decidability theorems for infinite-state systems
inferredcites →https://doi.org/10.1109/rtas.2005.54openalex-snapshot
Timing Analysis of TCP Servers for Surviving Denial-of-Service Attacks
inferredcites →https://doi.org/10.1145/199448.199462openalex-snapshot
Precise interprocedural dataflow analysis via graph reachability
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-00151-3_6openalex-snapshot
Perfect Timed Communication Is Hard
inferred← citeshttps://doi.org/10.1007/978-3-319-07151-0_21openalex-snapshot
Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-20297-6_13openalex-snapshot
A Logical Characterization of Timed Pushdown Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-23534-9_9openalex-snapshot
Logics for Weighted Timed Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-77313-1_6openalex-snapshot
Event-Clock Nested Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_10openalex-snapshot
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
inferred← citeshttps://doi.org/10.1007/978-3-540-75454-1_4openalex-snapshot
Undecidability of Universality for Timed Automata with Minimal Resources
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_50openalex-snapshot
Event-Clock Visibly Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_33openalex-snapshot
Time-Bounded Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-11319-2_10openalex-snapshot
Complexity Bounds for the Verification of Real-Time Software
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_3openalex-snapshot
Towards a Theory of Time-Bounded Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-15643-4_23openalex-snapshot
Recursive Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_6openalex-snapshot
The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_35openalex-snapshot
Verification for Timed Automata Extended with Unbounded Discrete Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-662-59533-6_17openalex-snapshot
Bar-Hillel Theorem Mechanization in Coq
inferred← citeshttps://doi.org/10.1016/j.cosrev.2013.05.001openalex-snapshot
A survey of timed automata for the development of real-time systems
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104673openalex-snapshot
Context-free timed formalisms: Robust automata and linear temporal logics
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.11.003openalex-snapshot
Reachability relations of timed pushdown automata
inferred← citeshttps://doi.org/10.1145/1190215.1190266openalex-snapshot
Interprocedural analysis of asynchronous programs
inferred← citeshttps://doi.org/10.1145/1190216.1190266openalex-snapshot
Interprocedural analysis of asynchronous programs
inferred← citeshttps://doi.org/10.2168/lmcs-11(3:20)2015openalex-snapshot
Verification for Timed Automata extended with Unbounded Discrete Data Structures
inferred← citeshttps://doi.org/10.4204/eptcs.140.3openalex-snapshot
Zenoness for Timed Pushdown Automata
inferred← citeshttps://doi.org/10.4204/eptcs.277.17openalex-snapshot
Timed Context-Free Temporal Logics
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2012.374openalex-snapshot
Timed Lossy Channel Systems
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.