On the public citation graph

Verification, model checking, and abstract interpretation : 5th International Conference, VMCAI 2004, Venice, Italy, January 11-13, 2004 : proceedings

0 signed · 32 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 points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.cosrev.2023.100594openalex-snapshot
Uncertainty in runtime verification: A survey
inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.166openalex-snapshot
Mathematical programming based debugging
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.018openalex-snapshot
Communicating Concurrent Objects in HiddenCCS
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.07.019openalex-snapshot
Termination Criteria for Bounded Model Checking: Extensions and Comparison
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.09.004openalex-snapshot
Abstract Fixpoint Computations with Numerical Acceleration Methods
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.09.007openalex-snapshot
Static Analysis by Abstract Interpretation: A Mathematical Programming Approach
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.09.010openalex-snapshot
A Note on the Inversion Join for Polyhedral Analysis
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.07.011openalex-snapshot
Extending -clauses with disequalities
inferred← citeshttps://doi.org/10.1016/j.jal.2014.07.005openalex-snapshot
Constraint LTL satisfiability checking without automata
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.05.003openalex-snapshot
Comparing disjunctive modal transition systems with an one-selecting variant
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.12.003openalex-snapshot
Global optimization of polynomials restricted to a smooth variety using sums of squares
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.12.049openalex-snapshot
Tropical linear-fractional programming and parametric mean payoff games
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.12.050openalex-snapshot
Acceleration of the abstract fixpoint computation in numerical program analysis
inferred← citeshttps://doi.org/10.1016/j.jss.2017.06.001openalex-snapshot
Efficient detection and validation of atomicity violations in concurrent programs
inferred← citeshttps://doi.org/10.1016/j.peva.2012.05.005openalex-snapshot
p-Automata: New foundations for discrete-time probabilistic verification
inferred← citeshttps://doi.org/10.1016/j.scico.2005.02.008openalex-snapshot
Abstract interpretation of programs as Markov decision processes
inferred← citeshttps://doi.org/10.1016/j.scico.2011.10.006openalex-snapshot
Combining traits with boxes and ownership types in a Java-like setting
inferred← citeshttps://doi.org/10.1016/j.scico.2012.06.001openalex-snapshot
Abstract interpretation of microcontroller code: Intervals meet congruences
inferred← citeshttps://doi.org/10.1016/j.scico.2012.10.015openalex-snapshot
Runtime verification of microcontroller binary code
inferred← citeshttps://doi.org/10.1016/j.scico.2013.09.016openalex-snapshot
Abstract acceleration in linear relation analysis
inferred← citeshttps://doi.org/10.1016/j.scico.2015.02.005openalex-snapshot
Specifying linked data structures in JML for combining formal verification and testing
inferred← citeshttps://doi.org/10.1016/j.scico.2015.06.006openalex-snapshot
Certifying execution time in multicores
inferred← citeshttps://doi.org/10.1016/j.scico.2016.05.008openalex-snapshot
Statistical and exact schedulability analysis of hierarchical scheduling systems
inferred← citeshttps://doi.org/10.1016/j.scico.2018.04.001openalex-snapshot
A two-step approach for pattern-based API-call constraint checking
inferred← citeshttps://doi.org/10.1016/j.scico.2024.103141openalex-snapshot
TerGEC: A graph enhanced contrastive approach for program termination analysis
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.032openalex-snapshot
Finite-state concurrent programs can be expressed in pairwise normal form
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.08.009openalex-snapshot
Command-based importance sampling for statistical model checking
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.03.036openalex-snapshot
Witness to non-termination of linear programs
inferred← citeshttps://doi.org/10.1109/synasc.2012.68openalex-snapshot
Program Verification in the Presence of Complex Numbers, Functions with Branch Cuts etc
inferred← citeshttps://doi.org/10.1145/1879021.1879026openalex-snapshot
Online stability validation using sector analysis
inferred← citeshttps://doi.org/10.1145/3316482.3326353openalex-snapshot
Imprecision in WCET estimates due to library calls and how to reduce it (WIP paper)
inferred← citeshttps://doi.org/10.1186/1471-2105-13-s17-s15openalex-snapshot
Improved statistical model checking methods for pathway analysis
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.