On the public citation graph

SAT-based Abstraction Refinement for Real-time Systems

0 signed · 23 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/11513988_6openalex-snapshot
Interpolant-Based Transition Relation Approximation
inferredcites →https://doi.org/10.1007/3-540-36135-9_16openalex-snapshot
Bounded Model Checking for Timed Systems
inferredcites →https://doi.org/10.1016/j.entcs.2006.11.026openalex-snapshot
Towards a Hybrid Dynamic Logic for Hybrid Dynamic Systems
inferredcites →https://doi.org/10.1016/j.tcs.2005.07.003openalex-snapshot
An interpolating theorem prover
inferredcites →https://doi.org/10.1023/a:1011276507260openalex-snapshot
Bounded Model Checking Using Satisfiability Solving
inferredcites →https://doi.org/10.1109/lics.1996.561342openalex-snapshot
The theory of hybrid automata
inferredcites →https://doi.org/10.1145/2641638.2641655openalex-snapshot
Abstractions from proofs
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff
inferredcites →https://doi.org/10.1145/876638.876643openalex-snapshot
Counterexample-guided abstraction refinement for symbolic model checking
inferredcites →https://doi.org/10.1145/964001.964021openalex-snapshot
Abstractions from proofs
inferredcites →https://doi.org/10.5860/choice.37-4551openalex-snapshot
Practical foundations of mathematics

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-319-11936-6_28openalex-snapshot
Trace Abstraction Refinement for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-04368-0_17openalex-snapshot
Stochastic Games for Verification of Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-13414-2_7openalex-snapshot
Compositional Construction of Real-Time Dataflow Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-15297-9_4openalex-snapshot
A Framework for Verification of Software with Time and Probabilities
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.10.027openalex-snapshot
SAT-based Verification for Timed Component Connectors
inferred← citeshttps://doi.org/10.1016/j.scico.2011.02.003openalex-snapshot
SAT-based verification for timed component connectors
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351149openalex-snapshot
Structure-aware computation of predicate abstraction
inferred← citeshttps://doi.org/10.1109/icnc.2011.42openalex-snapshot
Clock Number Reduction Abstraction on CEGAR Loop Approach to Timed Automaton
inferred← citeshttps://doi.org/10.1109/tase.2010.27openalex-snapshot
Compositional Abstraction Refinement for Timed Systems
inferred← citeshttps://doi.org/10.1587/transinf.e93.d.994openalex-snapshot
An Abstraction Refinement Technique for Timed Automata Based on Counterexample-Guided Abstraction Refinement Loop
inferred← citeshttps://doi.org/10.3311/ppee.9766openalex-snapshot
Formal Verification of Real-Time Systems with Data Processing
inferred← citeshttps://doi.org/10.5281/zenodo.291891openalex-snapshot
Activity-Based Abstraction Refinement For Timed 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.