On the public citation graph
Verification, Model Checking, and Abstract Interpretation
0 signed · 58 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/978-3-540-30579-8_19openalex-snapshot
Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_20openalex-snapshot
Minimizing Counterexample with Unit Core Extraction and Incremental SAT
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_26openalex-snapshot
Optimizing Bounded Model Checking for Linear Hybrid Systems
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_28openalex-snapshot
Generalized Typestate Checking for Data Structure Consistency
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_29openalex-snapshot
On the Complexity of Error Explanation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11532231_25openalex-snapshot
On the Complexity of Equational Horn Clauses
inferred← citeshttps://doi.org/10.1007/11841197_6openalex-snapshot
Verified Reference Implementations of WS-Security Protocols
inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_18openalex-snapshot
Automated Termination Analysis of Polynomial Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-10082-1_3openalex-snapshot
Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_24openalex-snapshot
The Constraint Database Approach to Software Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_25openalex-snapshot
Constraint Solving for Interpolation
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_27openalex-snapshot
Invariant Synthesis for Combined Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_31openalex-snapshot
Heap Assumptions on Demand
inferred← citeshttps://doi.org/10.1007/978-3-540-71322-7_5openalex-snapshot
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses
inferred← citeshttps://doi.org/10.1007/978-3-540-71493-4_76openalex-snapshot
A Sound and Complete Proof Rule for Region Stability of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73210-5_28openalex-snapshot
Integrating Verification, Testing, and Learning for Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-73580-9_6openalex-snapshot
CDB-PV: A Constraint Database-Based Program Verifier
inferred← citeshttps://doi.org/10.1007/978-3-540-74810-6_1openalex-snapshot
Security Protocols: Principles and Calculi
inferred← citeshttps://doi.org/10.1007/978-3-540-75101-4_46openalex-snapshot
Detection of Runtime Errors in MISRA C Programs: A Deductive Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-75221-9_4openalex-snapshot
Generating Polynomial Invariants with DISCOVERER and QEPCAD
inferred← citeshttps://doi.org/10.1007/978-3-540-75292-9_3openalex-snapshot
Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-75454-1_23openalex-snapshot
Region Stability Proofs for Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-78739-6_11openalex-snapshot
Iterative Specialisation of Horn Clauses
inferred← citeshttps://doi.org/10.1007/978-3-540-78739-6_14openalex-snapshot
Non-disjunctive Numerical Domain for Array Predicate Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-540-78739-6_5openalex-snapshot
A Hybrid Denotational Semantics for Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85114-1_14openalex-snapshot
Dependency Analysis for Control Flow Cycles in Reactive Communicating Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-85762-4_2openalex-snapshot
A Unified Approach to Abstract Interpretation, Formal Verification and Testing of C/C++ Modules
inferred← citeshttps://doi.org/10.1007/978-3-540-85762-4_29openalex-snapshot
Endomorphisms for Non-trivial Non-linear Loop Invariant Generation
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_5openalex-snapshot
Models and Proofs of Protocol Security: A Progress Report
inferred← citeshttps://doi.org/10.1007/978-3-642-11512-7_18openalex-snapshot
Integrated and Automated Abstract Interpretation, Verification and Testing of C/C++ Modules
inferred← citeshttps://doi.org/10.1007/978-3-642-11957-6_3openalex-snapshot
Coupling Policy Iteration with Semi-definite Relaxation to Compute Accurate Numerical Invariants in Static Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-12189-0_42openalex-snapshot
Termination of Loop Programs with Polynomial Guards
inferred← citeshttps://doi.org/10.1007/978-3-642-15497-3_10openalex-snapshot
A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Σ-Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-15769-1_24openalex-snapshot
Linear-Invariant Generation for Probabilistic Programs:
inferred← citeshttps://doi.org/10.1007/978-3-642-15769-1_8openalex-snapshot
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-16256-5_7openalex-snapshot
Ubiquitous Verification of Ubiquitous Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_5openalex-snapshot
Typechecking Higher-Order Security Libraries
inferred← citeshttps://doi.org/10.1007/978-3-642-21768-5_6openalex-snapshot
Security Mutants for Property-Based Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-23082-0_3openalex-snapshot
Cryptographic Verification by Typing for a Sample Protocol Implementation
inferred← citeshttps://doi.org/10.1007/978-3-642-27375-9_1openalex-snapshot
Union and Intersection Types for Secure Protocol Implementations
inferred← citeshttps://doi.org/10.1007/978-3-642-27705-4_5openalex-snapshot
Verifying Implementations of Security Protocols by Refinement
inferred← citeshttps://doi.org/10.1007/978-3-642-28641-4_2openalex-snapshot
Security Protocol Verification: Symbolic and Computational Models
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_11openalex-snapshot
Extending ${\cal H}_1$ -Clauses with Path Disequalities
inferred← citeshttps://doi.org/10.1007/978-3-642-29420-4_1openalex-snapshot
Verifying Cryptographic Code in C: Some Experience and the Csec Challenge
inferred← citeshttps://doi.org/10.1007/978-3-642-31606-7_26openalex-snapshot
Crossing the Syntactic Barrier: Hom-Disequalities for ${\mathcal H}_1$-Clauses
inferred← citeshttps://doi.org/10.1007/978-3-642-54792-8_12openalex-snapshot
Extending and Applying a Framework for the Cryptographic Verification of Java Programs
inferred← citeshttps://doi.org/10.1007/s00236-016-0291-0openalex-snapshot
Descending chains and narrowing on template abstract domains
inferred← citeshttps://doi.org/10.1007/s10009-013-0288-8openalex-snapshot
Termination proofs for linear simple loops
inferred← citeshttps://doi.org/10.1016/j.cose.2009.09.003openalex-snapshot
Runtime verification of cryptographic protocols
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.1109/tse.2010.13openalex-snapshot
Deriving a Slicing Algorithm via FermaT Transformations
inferred← citeshttps://doi.org/10.1145/1480881.1480899openalex-snapshot
Automatic modular abstractions for linear constraints
inferred← citeshttps://doi.org/10.1145/1594834.1480899openalex-snapshot
Automatic modular abstractions for linear constraints
inferred← citeshttps://doi.org/10.2168/lmcs-8(3:29)2012openalex-snapshot
Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d19openalex-snapshot
Automated Termination Analysis of Polynomial Probabilistic Programs
inferred← citeshttps://doi.org/10.29007/bhwxopenalex-snapshot
ARCH-COMP20 Category Report: Hybrid Systems with Piecewise Constant Dynamics and Bounded Model Checking
inferred← citeshttps://doi.org/10.3844/jcs.2009.163.171openalex-snapshot
Proof-Carrying Code Based Tool for Secure Information Flow of Assembly Programs
inferred← citeshttps://doi.org/10.3844/jcssp.2009.163.171openalex-snapshot
Proof-Carrying Code Based Tool for Secure Information Flow of Assembly Programs
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.