On the public citation graph

Assumptions and Guarantees for Compositional Noninterference

0 signed · 123 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/3-540-16042-6_21openalex-snapshot
A proof technique for rely/guarantee properties
inferredcites →https://doi.org/10.1007/3-540-44618-4_29openalex-snapshot
Secure Information Flow for Concurrent Processes
inferredcites →https://doi.org/10.1007/3-540-44898-5_4openalex-snapshot
Checking Interference with Fractional Permissions
inferredcites →https://doi.org/10.1007/3-540-45575-2_22openalex-snapshot
The Impact of Synchronisation on Secure Information Flow in Concurrent Programs
inferredcites →https://doi.org/10.1007/3-540-48166-4_21openalex-snapshot
An Efficient Algorithm for Computing MHP Information for Concurrent Java Programs
inferredcites →https://doi.org/10.1007/3-540-48234-2_14openalex-snapshot
Assume-Guarantee Model Checking of Software: A Comparative Case Study
inferredcites →https://doi.org/10.1007/3-540-49099-x_4openalex-snapshot
A Per Model of Secure Information Flow in Sequential Programs
inferredcites →https://doi.org/10.1007/978-3-540-24725-8_23openalex-snapshot
Trust Management in Strand Spaces: A Rely-Guarantee Method
inferredcites →https://doi.org/10.1007/978-3-540-28644-8_4openalex-snapshot
Resources, Concurrency and Local Reasoning
inferredcites →https://doi.org/10.1007/978-3-540-30477-7_9openalex-snapshot
Controlled Declassification Based on Intransitive Noninterference
inferredcites →https://doi.org/10.1007/978-3-540-70881-0_43openalex-snapshot
Security for Multithreaded Programs Under Cooperative Scheduling
inferredcites →https://doi.org/10.1007/978-3-540-71316-6_11openalex-snapshot
Controlling the What and Where of Declassification in Language-Based Security
inferredcites →https://doi.org/10.1007/978-3-540-71410-1_8openalex-snapshot
Combining Different Proof Techniques for Verifying Information Flow Security
inferredcites →https://doi.org/10.1007/978-3-642-00590-9_26openalex-snapshot
Deny-Guarantee Reasoning
inferredcites →https://doi.org/10.1007/978-3-642-00590-9_27openalex-snapshot
A Basis for Verifying Multi-threaded Programs
inferredcites →https://doi.org/10.1007/978-3-642-04444-1_5openalex-snapshot
Declassification with Explicit Reference Points
inferredcites →https://doi.org/10.1007/978-3-642-15497-3_8openalex-snapshot
Flexible Scheduler-Independent Security
inferredcites →https://doi.org/10.1007/978-3-642-19718-5_15openalex-snapshot
Barriers in Concurrent Separation Logic
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1007/bfb0028765openalex-snapshot
You assume, we guarantee: Methodology and case studies
inferredcites →https://doi.org/10.1007/s10207-009-0086-1openalex-snapshot
Flow-sensitive, context-sensitive, and object-sensitive information flow control based on program dependence graphs
inferredcites →https://doi.org/10.1016/0020-0190(81)90106-xopenalex-snapshot
Myths about the mutual exclusion problem
inferredcites →https://doi.org/10.1016/j.entcs.2010.08.005openalex-snapshot
Compositional System Security with Interface-Confined Adversaries
inferredcites →https://doi.org/10.1016/j.jlap.2008.09.003openalex-snapshot
Securing interaction between threads and the scheduler in the presence of synchronization
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.035openalex-snapshot
Resources, concurrency, and local reasoning
inferredcites →https://doi.org/10.1016/s0304-3975(02)00010-5openalex-snapshot
Noninterference for concurrent programs and thread systems
inferredcites →https://doi.org/10.1109/csf.2007.10openalex-snapshot
Automaton-based Confidentiality Monitoring of Concurrent Programs
inferredcites →https://doi.org/10.1109/csf.2007.6openalex-snapshot
A Library for Secure Multi-threaded Information Flow in Haskell
inferredcites →https://doi.org/10.1109/csf.2008.9openalex-snapshot
A Type System for Observational Determinism
inferredcites →https://doi.org/10.1109/csfw.1993.246640openalex-snapshot
Information flow control in a parallel language framework
inferredcites →https://doi.org/10.1109/csfw.1998.683153openalex-snapshot
Probabilistic noninterference in a concurrent language
inferredcites →https://doi.org/10.1109/csfw.2000.856937openalex-snapshot
Probabilistic noninterference for multi-threaded programs
inferredcites →https://doi.org/10.1109/csfw.2001.930141openalex-snapshot
A new type system for secure information flow
inferredcites →https://doi.org/10.1109/csfw.2003.1212703openalex-snapshot
Observational determinism for concurrent program security
inferredcites →https://doi.org/10.1109/csfw.2005.21openalex-snapshot
On Declassification and the Non-Disclosure Policy
inferredcites →https://doi.org/10.1109/csfw.2006.29openalex-snapshot
Securing Interaction between Threads and the Scheduler
inferredcites →https://doi.org/10.1109/csfw.2006.6openalex-snapshot
A Temporal Logic Characterisation of Oservational Determinism
inferredcites →https://doi.org/10.1109/icse.2003.1201195openalex-snapshot
Computer-assisted assume/guarantee reasoning with VeriSoft
inferredcites →https://doi.org/10.1109/lics.1995.523248openalex-snapshot
On the complexity of modular model checking
inferredcites →https://doi.org/10.1109/risp.1994.296590openalex-snapshot
A general theory of composition for trace sets closed under selective interleaving functions
inferredcites →https://doi.org/10.1109/secpri.2002.1004364openalex-snapshot
On the composition of secure systems
inferredcites →https://doi.org/10.1109/sp.1982.10014openalex-snapshot
Security Policies and Security Models
inferredcites →https://doi.org/10.1145/1103576.1103584openalex-snapshot
The framework of selective interleaving functions and the modular assembly kit
inferredcites →https://doi.org/10.1145/1111037.1111045openalex-snapshot
On flow-sensitive security types
inferredcites →https://doi.org/10.1145/1190215.1190261openalex-snapshot
Modular verification of a non-blocking stack
inferredcites →https://doi.org/10.1145/1190216.1190261openalex-snapshot
Modular verification of a non-blocking stack
inferredcites →https://doi.org/10.1145/1542476.1542488openalex-snapshot
Lightweight annotations for controlling sharing in concurrent data structures
inferredcites →https://doi.org/10.1145/155332.155346openalex-snapshot
Non-concurrency analysis
inferredcites →https://doi.org/10.1145/1706299.1706351openalex-snapshot
Dynamically checking ownership policies in concurrent c/c++ programs
inferredcites →https://doi.org/10.1145/185403.185412openalex-snapshot
A taxonomy of computer program security flaws
inferredcites →https://doi.org/10.1145/288195.288213openalex-snapshot
A conservative data flow algorithm for detecting all pairs of statements that may happen in parallel
inferredcites →https://doi.org/10.1145/318774.319252openalex-snapshot
An efficient algorithm for computing MHP information for concurrent Java programs
inferredcites →https://doi.org/10.1145/357084.357088openalex-snapshot
An Axiomatic Approach to Information Flow in Programs
inferredcites →https://doi.org/10.1145/567752.567779openalex-snapshot
Certifying information flow properties of programs
inferredcites →https://doi.org/10.3233/jcs-1999-72-305openalex-snapshot
Probabilistic noninterference in a concurrent language1
inferredcites →https://doi.org/10.3233/jcs-2009-0355openalex-snapshot
On declassification and the non-disclosure policy
inferredcites →https://doi.org/10.5555/776816.776834openalex-snapshot
Computer-assisted assume/guarantee reasoning with VeriSoft

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-17138-4_1openalex-snapshot
Foundations for Parallel Information Flow Control Runtime Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_13openalex-snapshot
SecCSL: Security Concurrent Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-30942-8_11openalex-snapshot
A Parametric Rely-Guarantee Reasoning Framework for Concurrent Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-30942-8_32openalex-snapshot
Value-Dependent Information-Flow Security on Weak Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-030-99429-7_1openalex-snapshot
Information-flow Interfaces
inferred← citeshttps://doi.org/10.1007/978-3-031-17244-1_18openalex-snapshot
Declassification Predicates for Controlled Information Release
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_25openalex-snapshot
Detecting Speculative Execution Vulnerabilities on Weak Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-031-77382-2_7openalex-snapshot
Symbolic Execution for Precise Information Flow Analysis of Timed Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-27436-2_12openalex-snapshot
Using Dynamic Pushdown Networks to Automate a Modular Information-Flow Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-47072-6_17openalex-snapshot
Refactoring Preserves Security
inferred← citeshttps://doi.org/10.1007/978-3-319-66197-1_19openalex-snapshot
Modular Verification of Information Flow Security in Component-Based Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-71237-6_3openalex-snapshot
Taming Message-Passing Communication in Compositional Reasoning About Confidentiality
inferred← citeshttps://doi.org/10.1007/978-3-319-89722-6openalex-snapshot
Principles of Security and Trust
inferred← citeshttps://doi.org/10.1007/978-3-319-89722-6_3openalex-snapshot
Compositional Non-interference for Concurrent Programs via Separation and Framing
inferred← citeshttps://doi.org/10.1007/978-3-642-35308-6_11openalex-snapshot
Proving Concurrent Noninterference
inferred← citeshttps://doi.org/10.1007/978-3-642-36563-8_8openalex-snapshot
Confidentiality for Probabilistic Multi-threaded Programs and Its Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-38197-3_8openalex-snapshot
Types vs. PDGs in Information Flow Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-39698-4_18openalex-snapshot
Safety versus Security in the Quality Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-40206-7_18openalex-snapshot
Noninterfering Schedulers
inferred← citeshttps://doi.org/10.1007/978-3-662-54455-6_1openalex-snapshot
Timing-Sensitive Noninterference through Composition
inferred← citeshttps://doi.org/10.1007/978-981-13-7561-3_3openalex-snapshot
A Semantic Notion of Secure Information-Flow
inferred← citeshttps://doi.org/10.1007/s10207-014-0257-6openalex-snapshot
A new algorithm for low-deterministic security
inferred← citeshttps://doi.org/10.1007/s10703-021-00376-2openalex-snapshot
Information-flow control on ARM and POWER multicore processors
inferred← citeshttps://doi.org/10.1007/s10703-024-00447-0openalex-snapshot
Information-flow interfaces
inferred← citeshttps://doi.org/10.1007/s11390-019-1949-1openalex-snapshot
A Lightweight Dynamic Enforcement of Privacy Protection for Android
inferred← citeshttps://doi.org/10.1007/s44443-025-00010-9openalex-snapshot
Perspectives of semantic modeling in categories
inferred← citeshttps://doi.org/10.1016/j.cl.2016.05.003openalex-snapshot
Specification and static enforcement of scheduler-independent noninterference in a middleweight Java
inferred← citeshttps://doi.org/10.1016/j.cola.2019.100904openalex-snapshot
Enforcing globally dependent flow policies in message-passing systems
inferred← citeshttps://doi.org/10.1016/j.scico.2013.11.008openalex-snapshot
Understanding probabilistic software leaks
inferred← citeshttps://doi.org/10.1017/s0956796821000162openalex-snapshot
Verified secure compilation for mixed-sensitivity concurrent programs
inferred← citeshttps://doi.org/10.1109/access.2024.3487852openalex-snapshot
TySA: Enforcing Security Policies for Safeguarding Against Permission-Induced Attacks in Android Applications
inferred← citeshttps://doi.org/10.1109/apsec51365.2020.00013openalex-snapshot
A Generalized Notion of Non-interference for Flow Security of Sequential and Concurrent Programs
inferred← citeshttps://doi.org/10.1109/csf.2014.14openalex-snapshot
Noninterference under Weak Memory Models
inferred← citeshttps://doi.org/10.1109/csf.2015.15openalex-snapshot
A Cut Principle for Information Flow
inferred← citeshttps://doi.org/10.1109/csf.2015.17openalex-snapshot
Hybrid Monitors for Concurrent Noninterference
inferred← citeshttps://doi.org/10.1109/csf.2016.36openalex-snapshot
Compositional Verification and Refinement of Concurrent Value-Dependent Noninterference
inferred← citeshttps://doi.org/10.1109/csf.2018.00023openalex-snapshot
A Permission-Dependent Type System for Secure Information Flow Analysis
inferred← citeshttps://doi.org/10.1109/csf.2018.00024openalex-snapshot
Types for Information Flow Control: Labeling Granularity and Semantic Models
inferred← citeshttps://doi.org/10.1109/csf49147.2020.00014openalex-snapshot
VERONICA: Expressive and Precise Concurrent Information Flow Security
inferred← citeshttps://doi.org/10.1109/csf49147.2020.00034openalex-snapshot
Rely/Guarantee Reasoning for Noninterference in Non-Blocking Algorithms
inferred← citeshttps://doi.org/10.1109/csf51468.2021.00017openalex-snapshot
Backwards-directed information flow analysis for concurrent programs
inferred← citeshttps://doi.org/10.1109/csf54842.2022.9919668openalex-snapshot
Privacy as Reachability
inferred← citeshttps://doi.org/10.1109/eurosp.2018.00010openalex-snapshot
COVERN: A Logic for Compositional Verification of Information Flow Control
inferred← citeshttps://doi.org/10.1109/eurosp53844.2022.00036openalex-snapshot
Compositional Information Flow Monitoring for Reactive Programs
inferred← citeshttps://doi.org/10.1109/formalise58978.2023.00017openalex-snapshot
A Dafny-based approach to thread-local information flow analysis
inferred← citeshttps://doi.org/10.1109/sp40001.2021.00003openalex-snapshot
Compositional Non-Interference for Fine-Grained Concurrent Programs
inferred← citeshttps://doi.org/10.1109/spw63631.2024.00020openalex-snapshot
Vulnerability Flow Type Systems
inferred← citeshttps://doi.org/10.1145/2384616.2384621openalex-snapshot
Towards a practical secure concurrent language
inferred← citeshttps://doi.org/10.1145/2398857.2384621openalex-snapshot
Towards a practical secure concurrent language
inferred← citeshttps://doi.org/10.1145/2465106.2465122openalex-snapshot
Security completeness
inferred← citeshttps://doi.org/10.1145/2786558.2786561openalex-snapshot
Short Paper
inferred← citeshttps://doi.org/10.1145/2993600.2993603openalex-snapshot
Future-dependent Flow Policies with Prophetic Variables
inferred← citeshttps://doi.org/10.1145/3264820.3264824openalex-snapshot
Prudent Design Principles for Information Flow Control
inferred← citeshttps://doi.org/10.1145/3289255openalex-snapshot
Alpha-Beta Privacy
inferred← citeshttps://doi.org/10.1145/3576915.3623141openalex-snapshot
Assume but Verify: Deductive Verification of Leaked Information in Concurrent Applications
inferred← citeshttps://doi.org/10.1145/3658644.3690303openalex-snapshot
Verifiable Security Policies for Distributed Systems
inferred← citeshttps://doi.org/10.3233/jcs-17984openalex-snapshot
Low-deterministic security for low-nondeterministic programs
inferred← citeshttps://doi.org/10.3233/jcs-191382openalex-snapshot
On the expressiveness and semantics of information flow types
inferred← citeshttps://doi.org/10.3233/jcs-200036openalex-snapshot
A permission-dependent type system for secure information flow analysis
inferred← citeshttps://doi.org/10.32657/10356/136764openalex-snapshot
Securing software systems via fuzz testing and verification
inferred← citeshttps://doi.org/10.4230/lipics.itp.2019.27openalex-snapshot
Verifying That a Compiler Preserves Concurrent Value-Dependent Information-Flow Security
inferred← citeshttps://doi.org/10.48550/arxiv.1701.01535openalex-snapshot
High-Assurance Separation Kernels: A Survey on Formal Methods
inferred← citeshttps://doi.org/10.48550/arxiv.2001.11142openalex-snapshot
VERONICA: Expressive and Precise Concurrent Information Flow Security (Extended Version with Technical Appendices)
inferred← citeshttps://doi.org/10.5204/thesis.eprints.226908openalex-snapshot
Static analysis of software components for information flow security
inferred← citeshttps://doi.org/10.5282/edoc.14274openalex-snapshot
Information flow analysis for mobile code in dynamic security environments
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/3690openalex-snapshot
Formal Verification of Language-Based Concurrent Noninterference
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.