On the public citation graph

Modular Product Programs

https://doi.org/10.1145/3324783
0 signed · 68 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/11547662_24openalex-snapshot
Secure Information Flow as a Safety Problem
inferredcites →https://doi.org/10.1007/11804192_17openalex-snapshot
Boogie: A Modular Reusable Verifier for Object-Oriented Programs
inferredcites →https://doi.org/10.1007/978-0-387-44599-1_13openalex-snapshot
Principles of Secure Information Flow Analysis
inferredcites →https://doi.org/10.1007/978-3-319-12154-3_1openalex-snapshot
A Logical Analysis of Framing for Specifications with Pure Method Calls
inferredcites →https://doi.org/10.1007/978-3-319-41528-4_22openalex-snapshot
Automatic Verification of Iterated Separating Conjunctions Using Symbolic Execution
inferredcites →https://doi.org/10.1007/978-3-319-73721-8_20openalex-snapshot
A Logical System for Modular Information Flow Verification
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_18openalex-snapshot
Modular Product Programs
inferredcites →https://doi.org/10.1007/978-3-319-96145-3_9openalex-snapshot
Exploiting Synchrony and Symmetry in Relational Verification
inferredcites →https://doi.org/10.1007/978-3-540-32004-3_20openalex-snapshot
A Theorem Proving Approach to Analysis of Secure Information Flow
inferredcites →https://doi.org/10.1007/978-3-540-37621-7_9openalex-snapshot
A Model for Delimited Information Release
inferredcites →https://doi.org/10.1007/978-3-540-78739-6_24openalex-snapshot
Verification of Equivalent-Results Methods
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-21437-0_17openalex-snapshot
Relational Verification Using Product Programs
inferredcites →https://doi.org/10.1007/978-3-642-31762-0_15openalex-snapshot
Verification of Information Flow Properties of Java Programs without Approximations
inferredcites →https://doi.org/10.1007/978-3-642-35722-0_3openalex-snapshot
Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_16openalex-snapshot
Interleaving and Lock-Step Semantics for Analysis and Verification of GPU Kernels
inferredcites →https://doi.org/10.1007/978-3-642-38574-2_20openalex-snapshot
Towards Modularly Comparing Programs Using Automated Theorem Provers
inferredcites →https://doi.org/10.1007/978-3-642-54792-8_10openalex-snapshot
A Separation Logic for Enforcing Declarative Information Flow Control Policies
inferredcites →https://doi.org/10.1007/978-3-662-49122-5_2openalex-snapshot
Viper: A Verification Infrastructure for Permission-Based Reasoning
inferredcites →https://doi.org/10.1007/s10207-014-0257-6openalex-snapshot
A new algorithm for low-deterministic security
inferredcites →https://doi.org/10.1007/s10703-015-0234-3openalex-snapshot
Proving mutual termination
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.036openalex-snapshot
Relational separation logic
inferredcites →https://doi.org/10.1017/s0960129511000193openalex-snapshot
Secure information flow by self-composition
inferredcites →https://doi.org/10.1109/csf.2015.28openalex-snapshot
A Hybrid Approach for Proving Noninterference of Java Programs
inferredcites →https://doi.org/10.1109/csfw.2002.1021820openalex-snapshot
Secure information flow and pointer con .nement in a java-like language
inferredcites →https://doi.org/10.1109/csfw.2004.13openalex-snapshot
Lenient array operations for practical secure information flow
inferredcites →https://doi.org/10.1109/csfw.2004.1310736openalex-snapshot
Lenient array operations for practical secure information flow
inferredcites →https://doi.org/10.1109/csfw.2005.15openalex-snapshot
Dimensions and Principles of Declassification
inferredcites →https://doi.org/10.1109/csfw10691.2005openalex-snapshot
18th IEEE Computer Security Foundations Workshop (CSFW'05)
inferredcites →https://doi.org/10.1109/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferredcites →https://doi.org/10.1145/1040305.1040319openalex-snapshot
Downgrading policies and relaxed noninterference
inferredcites →https://doi.org/10.1145/1480881.1480894openalex-snapshot
Formal certification of code-based cryptographic proofs
inferredcites →https://doi.org/10.1145/2160910.2160911openalex-snapshot
Implicit dynamic frames
inferredcites →https://doi.org/10.1145/2384616.2384625openalex-snapshot
GPUVerify
inferredcites →https://doi.org/10.1145/2491411.2491452openalex-snapshot
Differential assertion checking
inferredcites →https://doi.org/10.1145/2642937.2642987openalex-snapshot
Automating regression verification
inferredcites →https://doi.org/10.1145/2908080.2908092openalex-snapshot
Cartesian hoare logic for verifying k-safety properties
inferredcites →https://doi.org/10.1145/3062341.3062378openalex-snapshot
Decomposition instead of self-composition for proving the absence of timing channels
inferredcites →https://doi.org/10.1145/3110265openalex-snapshot
A relational logic for higher-order programs
inferredcites →https://doi.org/10.1145/3162070openalex-snapshot
A guess-and-assume approach to loop fusion for program verification
inferredcites →https://doi.org/10.1145/964001.964003openalex-snapshot
Simple relational correctness proofs for static analyses and program transformations
inferredcites →https://doi.org/10.3233/jcs-2009-0393openalex-snapshot
Hyperproperties
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2016.11openalex-snapshot
Relational Logic with Framing and Hypotheses

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-61470-6_7openalex-snapshot
Thirty-Seven Years of Relational Hoare Logic: Remarks on Its Principles and History
inferred← citeshttps://doi.org/10.1007/978-3-030-67067-2_5openalex-snapshot
Decomposing Data Structure Commutativity Proofs with $$m\!n$$-Differencing
inferred← citeshttps://doi.org/10.1007/978-3-030-81685-8_35openalex-snapshot
Constraint-Based Relational Verification
inferred← citeshttps://doi.org/10.1007/978-3-030-94583-1_17openalex-snapshot
Generalized Arrays for Stainless Frames
inferred← citeshttps://doi.org/10.1007/978-3-031-13185-1_17openalex-snapshot
Software Verification of Hyperproperties Beyond k-Safety
inferred← citeshttps://doi.org/10.1007/978-3-031-30820-8_11openalex-snapshot
The WhyRel Prototype for Modular Relational Verification of Pointer Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-33170-1_22openalex-snapshot
Automata-Based Software Model Checking of Hyperproperties
inferred← citeshttps://doi.org/10.1007/978-3-031-57249-4_10openalex-snapshot
Automated Software Verification of Hyperliveness
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-65627-9_18openalex-snapshot
Verification Algorithms for Automated Separation Logic Verifiers
inferred← citeshttps://doi.org/10.1007/978-3-031-98668-0_5openalex-snapshot
Fifteen Years of Viper
inferred← citeshttps://doi.org/10.1007/s10009-024-00756-zopenalex-snapshot
Axiomatising an information flow logic based on partial equivalence relations
inferred← citeshttps://doi.org/10.1007/s10009-025-00786-1openalex-snapshot
WhyRel: an auto-active relational verifier
inferred← citeshttps://doi.org/10.1007/s10703-025-00482-5openalex-snapshot
Predicate abstraction for hyperliveness verification
inferred← citeshttps://doi.org/10.1109/csf68417.2026.00026openalex-snapshot
Dolev-Yao Information Flow
inferred← citeshttps://doi.org/10.1109/formalise58978.2023.00012openalex-snapshot
Patch Specifications via Product Programs
inferred← citeshttps://doi.org/10.1109/icse-companion52605.2021.00095openalex-snapshot
Verifying Determinism in Sequential Programs
inferred← citeshttps://doi.org/10.1109/icse43902.2021.00017openalex-snapshot
Verifying Determinism in Sequential Programs
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470690openalex-snapshot
Alignment Completeness for Relational Hoare Logics
inferred← citeshttps://doi.org/10.1145/3551497openalex-snapshot
A Relational Program Logic with Data Abstraction and Dynamic Framing
inferred← citeshttps://doi.org/10.1145/3563298openalex-snapshot
Proving hypersafety compositionally
inferred← citeshttps://doi.org/10.1145/3656437openalex-snapshot
Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties
inferred← citeshttps://doi.org/10.1145/3689756openalex-snapshot
Hypra: A Deductive Program Verifier for Hyper Hoare Logic
inferred← citeshttps://doi.org/10.1145/3763130openalex-snapshot
Verifying Asynchronous Hyperproperties in Reactive Systems
inferred← citeshttps://doi.org/10.1145/3763145openalex-snapshot
P³: Reasoning about Patches via Product 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.