On the public citation graph

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

0 signed · 33 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.1007/11547662_18openalex-snapshot
Finding Basic Block and Variable Correspondence
inferred← citeshttps://doi.org/10.1007/11560326_16openalex-snapshot
A Probabilistic Property-Specific Approach to Information Flow
inferred← citeshttps://doi.org/10.1007/978-3-030-25540-4_35openalex-snapshot
Temporal Stream Logic: Synthesis Beyond the Bools
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_14openalex-snapshot
Symbolic Visibly Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_25openalex-snapshot
From Separation Logic to First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-70594-9_16openalex-snapshot
Safe Modification of Pointer Programs in Refinement Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-85289-6_16openalex-snapshot
A Specification Language for Distributed Components Implemented in GCM/ProActive
inferred← citeshttps://doi.org/10.1007/978-3-540-92188-2_6openalex-snapshot
Active Objects and Distributed Components: Theory and Implementation
inferred← citeshttps://doi.org/10.1007/978-3-642-00955-6_48openalex-snapshot
ProActive Parallel Suite: From Active Objects-Skeletons-Components to Environment and Deployment
inferred← citeshttps://doi.org/10.1007/978-3-642-03034-5_3openalex-snapshot
A MuDDy Experience–ML Bindings to a BDD Library
inferred← citeshttps://doi.org/10.1007/978-3-642-03237-0_23openalex-snapshot
Inter-program Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-03459-6_1openalex-snapshot
A Policy Model for Secure Information Flow
inferred← citeshttps://doi.org/10.1007/s12243-008-0069-7openalex-snapshot
Behavioural models for distributed Fractal components
inferred← citeshttps://doi.org/10.1016/j.artint.2015.04.002openalex-snapshot
Structured learning modulo theories
inferred← citeshttps://doi.org/10.1016/j.cose.2022.102683openalex-snapshot
Can my firewall system enforce this policy?
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.038openalex-snapshot
Initializing Mutually Referential Abstract Objects: The Value Recursion Challenge
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.06.002openalex-snapshot
Automated type-based analysis of injective agreement in the presence of compromised principals
inferred← citeshttps://doi.org/10.1016/j.jlamp.2018.06.002openalex-snapshot
Best-by-simulations: A framework for comparing efficiency of reconfigurable architectures on workloads with deadlines
inferred← citeshttps://doi.org/10.1016/j.scico.2005.03.001openalex-snapshot
A transactional object calculus
inferred← citeshttps://doi.org/10.1016/j.scico.2006.03.003openalex-snapshot
Automatic generation of polynomial invariants of bounded degree using abstract interpretation
inferred← citeshttps://doi.org/10.1016/j.scico.2008.06.005openalex-snapshot
On the reification of Java wildcards
inferred← citeshttps://doi.org/10.1016/j.scico.2010.12.008openalex-snapshot
ASPfun : A typed functional active object calculus
inferred← citeshttps://doi.org/10.1016/j.scico.2017.10.004openalex-snapshot
Counterexample guided inductive optimization based on satisfiability modulo theories
inferred← citeshttps://doi.org/10.1093/nsr/nwv042openalex-snapshot
How functional programming mattered
inferred← citeshttps://doi.org/10.1145/2603088.2603165openalex-snapshot
Abstract interpretation
inferred← citeshttps://doi.org/10.1145/3184558.3185953openalex-snapshot
Tierless Web Programming in the Large
inferred← citeshttps://doi.org/10.1145/3656296openalex-snapshot
NetConfEval: Can LLMs Facilitate Network Configuration?
inferred← citeshttps://doi.org/10.1145/3716505openalex-snapshot
Validation of CHC Satisfiability with ATHENA
inferred← citeshttps://doi.org/10.1145/3763134openalex-snapshot
Modal Abstractions for Virtualizing Memory Addresses
inferred← citeshttps://doi.org/10.17771/pucrio.acad.56519openalex-snapshot
A FOREIGN FUNCTION INTERFACE FOR PALLENE
inferred← citeshttps://doi.org/10.17771/pucrio.acad.71084openalex-snapshot
FORMALIZATION OF KEY ALGORITHMS FROM LPEGN
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:23)2023openalex-snapshot
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
inferred← citeshttps://doi.org/10.7561/sacs.2017.1.19openalex-snapshot
A Provably Correct Compilation of Functional Languages into Scripting Languages
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.