On the public citation graph
Learning-Based Assume-Guarantee Verification (Tool Paper)
0 signed · 24 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-36577-x_24openalex-snapshot
Learning Assumptions for Compositional Verification
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.1007/978-3-540-24848-4_7openalex-snapshot
MagicBeans: a Platform for Deploying Plugin Components
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_5openalex-snapshot
In Transition From Global to Modular Temporal Reasoning about Programs
inferredcites →https://doi.org/10.1016/0890-5401(87)90052-6openalex-snapshot
Learning regular sets from queries and counterexamples
inferredcites →https://doi.org/10.1109/tse.2004.22openalex-snapshot
Modular verification of software components in C
inferredcites →https://doi.org/10.1145/69575.69577openalex-snapshot
Tentative steps toward a development method for interfering programs
inferredcites →https://doi.org/10.5555/998675.999426openalex-snapshot
Assume-guarantee verification of source code with design-level assumptions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11901914_15openalex-snapshot
Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_15openalex-snapshot
Local Proofs for Linear-Time Properties of Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_9openalex-snapshot
Local Proofs for Global Safety Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-85571-2_11openalex-snapshot
Combining Formal Verification and Testing for Correct Legacy Component Integration in Mechatronic UML
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_47openalex-snapshot
SPLIT: A Compositional LTL Verifier
inferred← citeshttps://doi.org/10.1007/s10703-008-0055-8openalex-snapshot
Automatic symbolic compositional verification by learning assumptions
inferred← citeshttps://doi.org/10.1007/s10703-008-0063-8openalex-snapshot
Local proofs for global safety properties
inferred← citeshttps://doi.org/10.1007/s10994-016-5565-9openalex-snapshot
Learning deterministic probabilistic automata from a model checking perspective
inferred← citeshttps://doi.org/10.1109/ase.2013.6693137openalex-snapshot
OCRA: A tool for checking the refinement of temporal contracts
inferred← citeshttps://doi.org/10.1109/rivf.2013.6719860openalex-snapshot
An assume-guarantee model checker for component-based 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.