On the public citation graph
Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '91
0 signed · 54 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sec.882openalex-snapshot
Typing secure implementation of authentication protocols in environments with compromised principals
inferred← citeshttps://doi.org/10.1007/978-3-319-10398-3_9openalex-snapshot
50 Shades of Rule Composition
inferred← citeshttps://doi.org/10.1007/978-3-642-27694-1_5openalex-snapshot
The Environment as an Argument
inferred← citeshttps://doi.org/10.1007/978-3-642-35371-0_3openalex-snapshot
Secure Implementation of Asynchronous Method Calls and Futures
inferred← citeshttps://doi.org/10.1007/s00224-014-9533-0openalex-snapshot
On First-Order Logic and CPDA Graphs
inferred← citeshttps://doi.org/10.1007/s10009-025-00787-0openalex-snapshot
CFL-based methods for approximating interleaved Dyck reachability
inferred← citeshttps://doi.org/10.1016/j.bcra.2024.100253openalex-snapshot
Unveiling smart contract vulnerabilities: Toward profiling smart contract vulnerabilities using enhanced genetic algorithm and generating benchmark dataset
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.ic.2023.105077openalex-snapshot
Abstract interpretation, Hoare logic, and incorrectness logic for quantum programs
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.07.023openalex-snapshot
An alternative characterization of weak order dependence
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.07.002openalex-snapshot
Concurrent weighted logic
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.10.010openalex-snapshot
LCTD: Test-guided proofs for C programs on LLVM
inferred← citeshttps://doi.org/10.1016/j.jvlc.2018.10.006openalex-snapshot
Refining semantics for multi-stage programming
inferred← citeshttps://doi.org/10.1016/j.scico.2017.11.003openalex-snapshot
Mining inline cache data to order inferred types in dynamic languages
inferred← citeshttps://doi.org/10.1016/j.scico.2017.12.006openalex-snapshot
Some trade-offs in reducing the overhead of assertion run-time checks via static analysis
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102746openalex-snapshot
Hermes: A reversible language for lightweight encryption
inferred← citeshttps://doi.org/10.1016/j.suscom.2012.02.002openalex-snapshot
Automatic memoization for energy efficiency in financial applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.02.010openalex-snapshot
On the boundary between decidability and undecidability of asynchronous session subtyping
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.01.010openalex-snapshot
Formalising and implementing Boost POSIX regular expression matching
inferred← citeshttps://doi.org/10.1017/s0956796809990268openalex-snapshot
Linear type theory for asynchronous session types
inferred← citeshttps://doi.org/10.1017/s0956796817000053openalex-snapshot
The calculus of dependent lambda eliminations
inferred← citeshttps://doi.org/10.1109/csf64896.2025.00032openalex-snapshot
A Graded Modal Approach to Relaxed Semantic Declassification
inferred← citeshttps://doi.org/10.1145/2048066.2048076openalex-snapshot
Synthesis of first-order dynamic programming algorithms
inferred← citeshttps://doi.org/10.1145/3136040.3136060openalex-snapshot
Staging for generic programming in space and time
inferred← citeshttps://doi.org/10.1145/3170492.3136060openalex-snapshot
Staging for generic programming in space and time
inferred← citeshttps://doi.org/10.1145/3192366.3192405openalex-snapshot
Advanced automata-based algorithms for program termination checking
inferred← citeshttps://doi.org/10.1145/3276945.3276949openalex-snapshot
Query-based object-oriented programming: a declarative web of objects
inferred← citeshttps://doi.org/10.1145/3314221.3314586openalex-snapshot
Ignis: scaling distribution-oblivious systems with light-touch distribution
inferred← citeshttps://doi.org/10.1145/3314221.3314599openalex-snapshot
Co-optimizing memory-level parallelism and cache-level parallelism
inferred← citeshttps://doi.org/10.1145/3428296openalex-snapshot
Gradual verification of recursive heap data structures
inferred← citeshttps://doi.org/10.1145/3460120.3484588openalex-snapshot
An In-Depth Symbolic Security Analysis of the ACME Standard
inferred← citeshttps://doi.org/10.1145/3571211openalex-snapshot
A Bowtie for a Beast: Overloading, Eta Expansion, and Extensible Data Types in F⋈
inferred← citeshttps://doi.org/10.1145/3574137openalex-snapshot
Compositional Reasoning for Non-multicopy Atomic Architectures
inferred← citeshttps://doi.org/10.1145/3578360.3580267openalex-snapshot
HyBF: A Hybrid Branch Fusion Strategy for Code Size Reduction
inferred← citeshttps://doi.org/10.1145/3579834openalex-snapshot
Omnisemantics: Smooth Handling of Nondeterminism
inferred← citeshttps://doi.org/10.1145/3600160.3605081openalex-snapshot
Towards Obfuscation of Programmable Logic Controllers
inferred← citeshttps://doi.org/10.1145/3622781.3674174openalex-snapshot
Towards Unified Analysis of GPU Consistency
inferred← citeshttps://doi.org/10.1145/3622781.3674177openalex-snapshot
Manta: Hybrid-Sensitive Type Inference Toward Type-Assisted Bug Detection for Stripped Binaries
inferred← citeshttps://doi.org/10.1145/3632886openalex-snapshot
Internalizing Indistinguishability with Dependent Types
inferred← citeshttps://doi.org/10.1145/3704808openalex-snapshot
Gradual C0: Symbolic Execution for Gradual Verification
inferred← citeshttps://doi.org/10.1145/3704839openalex-snapshot
Maximal Simplification of Polyhedral Reductions
inferred← citeshttps://doi.org/10.1145/3704875openalex-snapshot
On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus
inferred← citeshttps://doi.org/10.1145/3707203openalex-snapshot
A Layered Approach to Intensional Analysis in Type Theory
inferred← citeshttps://doi.org/10.1145/3708519openalex-snapshot
Automatic Programming: Large Language Models and Beyond
inferred← citeshttps://doi.org/10.1145/3720427openalex-snapshot
Carapace: Static–Dynamic Information Flow Control in Rust
inferred← citeshttps://doi.org/10.1145/3759538.3759651openalex-snapshot
Unification Modulo Isomorphisms between Dependent Types for Type-Based Library Search
inferred← citeshttps://doi.org/10.1145/3764861openalex-snapshot
Contract System Metatheories a la Carte: A Transition-System View of Contracts
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.