On the public citation graph

Interaction trees: representing recursive and impure programs in Coq

0 signed · 205 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-44622-2_21openalex-snapshot
Interactive Programs in Dependent Type Theory
inferredcites →https://doi.org/10.1007/3-540-45315-6_1openalex-snapshot
Adequacy for Algebraic Effects
inferredcites →https://doi.org/10.1007/3-540-45931-6openalex-snapshot
Foundations of Software Science and Computation Structures
inferredcites →https://doi.org/10.1007/3-540-45931-6_24openalex-snapshot
Notions of Computation Determine Monads
inferredcites →https://doi.org/10.1007/3-540-45949-9openalex-snapshot
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
inferredcites →https://doi.org/10.1007/3-540-48256-3openalex-snapshot
Theorem Proving in Higher Order Logics
inferredcites →https://doi.org/10.1007/3-540-57887-0_99openalex-snapshot
Extensible denotational language specifications
inferredcites →https://doi.org/10.1007/3-540-60579-7_3openalex-snapshot
Codifying guarded definitions with recursive schemes
inferredcites →https://doi.org/10.1007/3-540-62688-3_37openalex-snapshot
Recursion from cyclic sharing: Traced monoidal categories and models of cyclic lambda calculi
inferredcites →https://doi.org/10.1007/978-1-4471-0865-8_7openalex-snapshot
Recursion from Cyclic Sharing
inferredcites →https://doi.org/10.1007/978-3-319-19797-5_13openalex-snapshot
Turing-Completeness Totally Free
inferredcites →https://doi.org/10.1007/978-3-319-21401-6_26openalex-snapshot
The Lean Theorem Prover (System Description)
inferredcites →https://doi.org/10.1007/978-3-319-25150-9_8openalex-snapshot
Quotienting the Delay Monad by Weak Bisimilarity
inferredcites →https://doi.org/10.1007/978-3-319-67729-3_3openalex-snapshot
The Delay Monad and Restriction Categories
inferredcites →https://doi.org/10.1007/978-3-319-95582-7_20openalex-snapshot
Modular Verification of Programs with Effects and Effect Handlers in Coq
inferredcites →https://doi.org/10.1007/978-3-642-03359-9_10openalex-snapshot
Some Domain Theory and Denotational Semantics in Coq
inferredcites →https://doi.org/10.1007/978-3-642-19718-5_1openalex-snapshot
Verified Software Toolchain
inferredcites →https://doi.org/10.1007/978-3-642-22953-4_24openalex-snapshot
A Coinductive Calculus for Asynchronous Side-Effecting Processes
inferredcites →https://doi.org/10.1007/978-3-642-28891-3_2openalex-snapshot
Verified Software Toolchain
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_3openalex-snapshot
Pretty-Big-Step Semantics
inferredcites →https://doi.org/10.1007/978-3-642-78034-9openalex-snapshot
Iteration Theories
inferredcites →https://doi.org/10.1007/978-3-662-02880-3_8openalex-snapshot
Monads for functional programming
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_23openalex-snapshot
Functional Big-Step Semantics
inferredcites →https://doi.org/10.1007/978-3-662-54458-7_30openalex-snapshot
Unifying Guarded and Unguarded Iteration
inferredcites →https://doi.org/10.1007/978-3-662-54458-7_31openalex-snapshot
Partiality, Revisited
inferredcites →https://doi.org/10.1016/0890-5401(91)90052-4openalex-snapshot
Notions of computation and monads
inferredcites →https://doi.org/10.1016/j.entcs.2014.10.015openalex-snapshot
The Coinductive Resumption Monad
inferredcites →https://doi.org/10.1016/j.ic.2004.05.003openalex-snapshot
Completely iterative algebras and completely iterative monads
inferredcites →https://doi.org/10.1016/j.ic.2007.12.004openalex-snapshot
Coinductive big-step operational semantics
inferredcites →https://doi.org/10.1016/j.ic.2013.08.012openalex-snapshot
A coinductive calculus for asynchronous side-effecting processes
inferredcites →https://doi.org/10.1016/j.jlamp.2014.02.001openalex-snapshot
Programming with algebraic effects and handlers
inferredcites →https://doi.org/10.1016/j.jlap.2004.03.009openalex-snapshot
The origins of structural operational semantics
inferredcites →https://doi.org/10.1016/j.tcs.2006.03.013openalex-snapshot
Combining effects: Sum and tensor
inferredcites →https://doi.org/10.1016/s0049-237x(08)71948-7openalex-snapshot
Processes: A Mathematical Model of Computing Agents
inferredcites →https://doi.org/10.1016/s0304-3975(02)00728-4openalex-snapshot
Infinite trees and completely iterative theories: a coalgebraic view
inferredcites →https://doi.org/10.1016/s0747-7171(89)80065-3openalex-snapshot
Codatatypes in ML
inferredcites →https://doi.org/10.1017/cbo9781107256552openalex-snapshot
Program Logics for Certified Compilers
inferredcites →https://doi.org/10.1017/s0305004100074338openalex-snapshot
Traced monoidal categories
inferredcites →https://doi.org/10.1017/s0956796808006758openalex-snapshot
Data types à la carte
inferredcites →https://doi.org/10.1017/s0956796816000319openalex-snapshot
Interactive programming in Agda – Objects and graphical user interfaces
inferredcites →https://doi.org/10.1023/a:1023064908962openalex-snapshot
Algebraic Operations and Generic Effects
inferredcites →https://doi.org/10.1109/lics.1989.39155openalex-snapshot
Computational lambda-calculus and monads
inferredcites →https://doi.org/10.1109/lics.2010.29openalex-snapshot
A Generic Operational Metatheory for Algebraic Effects
inferredcites →https://doi.org/10.1145/1250734.1250742openalex-snapshot
A certified type-preserving compiler from lambda calculus to assembly language
inferredcites →https://doi.org/10.1145/1538788.1538814openalex-snapshot
Formal verification of a realistic compiler
inferredcites →https://doi.org/10.1145/158511.158524openalex-snapshot
Imperative functional programming
inferredcites →https://doi.org/10.1145/1629575.1629596openalex-snapshot
seL4
inferredcites →https://doi.org/10.1145/1706299.1706312openalex-snapshot
A verified compiler for an impure functional language
inferredcites →https://doi.org/10.1145/1706299.1706329openalex-snapshot
Toward a verified relational database management system
inferredcites →https://doi.org/10.1145/174675.178068openalex-snapshot
Building interpreters by composing monads
inferredcites →https://doi.org/10.1145/199448.199528openalex-snapshot
Monad transformers and modular interpreters
inferredcites →https://doi.org/10.1145/2364527.2364546openalex-snapshot
Operational semantics using the partiality monad
inferredcites →https://doi.org/10.1145/2398856.2364546openalex-snapshot
Operational semantics using the partiality monad
inferredcites →https://doi.org/10.1145/2429069.2429093openalex-snapshot
The power of parameterization in coinductive proof
inferredcites →https://doi.org/10.1145/2429069.2429094openalex-snapshot
Meta-theory à la carte
inferredcites →https://doi.org/10.1145/2503778.2503791openalex-snapshot
Extensible effects
inferredcites →https://doi.org/10.1145/2535838.2535841openalex-snapshot
CakeML
inferredcites →https://doi.org/10.1145/2676726.2676975openalex-snapshot
Deep Specifications and Certified Abstraction Layers
inferredcites →https://doi.org/10.1145/2737924.2737958openalex-snapshot
Verdi: a framework for implementing and formally verifying distributed systems
inferredcites →https://doi.org/10.1145/2804302.2804319openalex-snapshot
Freer monads, more extensible effects
inferredcites →https://doi.org/10.1145/2813885.2737958openalex-snapshot
Verdi: a framework for implementing and formally verifying distributed systems
inferredcites →https://doi.org/10.1145/2815400.2815428openalex-snapshot
IronFleet
inferredcites →https://doi.org/10.1145/3192366.3192381openalex-snapshot
Certified concurrent abstraction layers
inferredcites →https://doi.org/10.1145/3293880.3294106openalex-snapshot
From C to interaction trees: specifying, verifying, and testing a networked server
inferredcites →https://doi.org/10.2168/lmcs-1(2:1)2005openalex-snapshot
General Recursion via Coinductive Types
inferredcites →https://doi.org/10.2168/lmcs-9(4:23)2013openalex-snapshot
Handling Algebraic Effects
inferredcites →https://doi.org/10.2307/j.ctv36xvknz.9openalex-snapshot
Object-Oriented Programming in Dependent Type Theory
inferredcites →https://doi.org/10.4204/eptcs.32.5openalex-snapshot
Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction
inferredcites →https://doi.org/10.5555/3026877.3026928openalex-snapshot
CertiKOS: an extensible architecture for building certified concurrent OS kernels
inferredcites →https://doi.org/10.7551/mitpress/9153.001.0001openalex-snapshot
Certified Programming with Dependent Types
inferredcites →https://doi.org/10.7551/mitpress/9153.003.0007openalex-snapshot
Infinite Data and Proofs

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-44914-8_1openalex-snapshot
Trace-Relating Compiler Correctness and Secure Compilation
inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_20openalex-snapshot
Temporal Refinements for Guarded Recursive Types
inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_5openalex-snapshot
Verified Software Units
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_1openalex-snapshot
Non-well-founded Deduction for Induction and Coinduction
inferred← citeshttps://doi.org/10.1007/978-3-031-17244-1_24openalex-snapshot
Formally Verified Animation for RoboChart Using Interaction Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-60698-4_6openalex-snapshot
Verifying a C Implementation of Derecho’s Coordination Mechanism Using VST and Coq
inferred← citeshttps://doi.org/10.1007/978-3-031-62697-5_9openalex-snapshot
The Concurrent Calculi Formalisation Benchmark
inferred← citeshttps://doi.org/10.1007/978-3-031-67114-2_11openalex-snapshot
A Tour Through the Programming Choices: Semantics and Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-77382-2_3openalex-snapshot
User-Guided Verification of Security Protocols via Sound Animation
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_7openalex-snapshot
An abstract, certified account of operational game semantics
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_8openalex-snapshot
Artifact Report: an Abstract, Certified Account of Operational Game Semantics
inferred← citeshttps://doi.org/10.1007/978-3-031-91121-7_12openalex-snapshot
Context-Dependent Effects in Guarded Interaction Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-91121-7_16openalex-snapshot
On the Relationship between Dijkstra Monads and Higher-Order Fixpoint Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-93706-4_6openalex-snapshot
Vellvm: Formalizing the Informal LLVM
inferred← citeshttps://doi.org/10.1007/978-3-032-11176-0_7openalex-snapshot
A Rely-Guarantee-Based Simulation for Cooperative Semantics
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_4openalex-snapshot
In Cantor Space No One Can Hear You Stream
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_9openalex-snapshot
Rely-Guarantee Is Coinductive
inferred← citeshttps://doi.org/10.1007/978-981-95-4213-0_1openalex-snapshot
Formal Verification of Physical Layer Security Protocols for Next-Generation Communication Networks
inferred← citeshttps://doi.org/10.1007/s00165-020-00523-2openalex-snapshot
Modular verification of programs with effectsand effects handlers
inferred← citeshttps://doi.org/10.1007/s10703-020-00353-1openalex-snapshot
Abstraction and subsumption in modular verification of C programs
inferred← citeshttps://doi.org/10.1016/j.jlamp.2023.100940openalex-snapshot
Formally verified animation for RoboChart using interaction trees
inferred← citeshttps://doi.org/10.1016/j.scico.2020.102492openalex-snapshot
A big step from finite to infinite computations
inferred← citeshttps://doi.org/10.1017/s0956796825100105openalex-snapshot
Choice trees: Representing and reasoning about nondeterministic, recursive, and impure programs in Rocq
inferred← citeshttps://doi.org/10.1109/access.2025.3539584openalex-snapshot
A Formal Verification Library Design for Behavioral Refinement of CompCert Clight
inferred← citeshttps://doi.org/10.1109/cscs66924.2025.00090openalex-snapshot
Formal Modeling of Distributed Architectures with FreeSpec: A Cloud-Based MTD Use Case
inferred← citeshttps://doi.org/10.1109/csf51468.2021.00005openalex-snapshot
Dynamic IFC Theorems for Free!
inferred← citeshttps://doi.org/10.1109/csf51468.2021.00048openalex-snapshot
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq
inferred← citeshttps://doi.org/10.1109/indin58382.2024.10774532openalex-snapshot
ST-Petri: A Visual Executable Semantic Model for PLC Structured Text Language
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470641openalex-snapshot
Smart Choices and the Selection Monad
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00052openalex-snapshot
Functional Stream Semantics for a Synchronous Block-Diagram Compiler
inferred← citeshttps://doi.org/10.1145/3373718.3394799openalex-snapshot
Refinement-Based Game Semantics for Certified Abstraction Layers
inferred← citeshttps://doi.org/10.1145/3409003openalex-snapshot
SteelCore: an extensible concurrent separation logic for effectful dependently typed programs
inferred← citeshttps://doi.org/10.1145/3428220openalex-snapshot
Igloo: soundly linking compositional refinement and separation logic for distributed system verification
inferred← citeshttps://doi.org/10.1145/3453483.3454041openalex-snapshot
Zooid: a DSL for certified multiparty computation: from mechanised metatheory to certified multiparty processes
inferred← citeshttps://doi.org/10.1145/3460319.3464798openalex-snapshot
Model-based testing of networked applications
inferred← citeshttps://doi.org/10.1145/3460860openalex-snapshot
An Extended Account of Trace-relating Compiler Correctness and Secure Compilation
inferred← citeshttps://doi.org/10.1145/3473572openalex-snapshot
Modular, compositional, and executable formal semantics for LLVM IR
inferred← citeshttps://doi.org/10.1145/3473586openalex-snapshot
Theorems for free from separation logic specifications
inferred← citeshttps://doi.org/10.1145/3473599openalex-snapshot
Skipping the binder bureaucracy with mixed embeddings in a semantics course (functional pearl)
inferred← citeshttps://doi.org/10.1145/3498685openalex-snapshot
Certifying derivation of state machines from coroutines
inferred← citeshttps://doi.org/10.1145/3498689openalex-snapshot
Simuliris: a separation logic framework for verifying concurrent program optimizations
inferred← citeshttps://doi.org/10.1145/3519939.3523718openalex-snapshot
Sequential reasoning for optimizing compilers under weak memory concurrency
inferred← citeshttps://doi.org/10.1145/3522729openalex-snapshot
A Meta-theory for Big-step Semantics
inferred← citeshttps://doi.org/10.1145/3527324openalex-snapshot
C4: verified transactional objects
inferred← citeshttps://doi.org/10.1145/3546189.3549919openalex-snapshot
How to safely use extensionality in Liquid Haskell
inferred← citeshttps://doi.org/10.1145/3547624openalex-snapshot
Monadic compiler calculation (functional pearl)
inferred← citeshttps://doi.org/10.1145/3547630openalex-snapshot
Formal reasoning about layered monadic interpreters
inferred← citeshttps://doi.org/10.1145/3547632openalex-snapshot
Program adverbs and Tlön embeddings
inferred← citeshttps://doi.org/10.1145/3563355openalex-snapshot
Intrinsically-typed definitional interpreters à la carte
inferred← citeshttps://doi.org/10.1145/3571202openalex-snapshot
Formally Verified Native Code Generation in an Effectful JIT: Turning the CompCert Backend into a Formally Verified JIT Compiler
inferred← citeshttps://doi.org/10.1145/3571220openalex-snapshot
DimSum: A Decentralized Approach to Multi-language Semantics and Verification
inferred← citeshttps://doi.org/10.1145/3571232openalex-snapshot
Conditional Contextual Refinement
inferred← citeshttps://doi.org/10.1145/3571254openalex-snapshot
Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq
inferred← citeshttps://doi.org/10.1145/3579834openalex-snapshot
Omnisemantics: Smooth Handling of Nondeterminism
inferred← citeshttps://doi.org/10.1145/3591220openalex-snapshot
Formally Verified Samplers from Probabilistic Programs with Loops and Conditioning
inferred← citeshttps://doi.org/10.1145/3591253openalex-snapshot
Fair Operational Semantics
inferred← citeshttps://doi.org/10.1145/3591259openalex-snapshot
PureCake: A Verified Compiler for a Lazy Functional Language
inferred← citeshttps://doi.org/10.1145/3591266openalex-snapshot
Cakes That Bake Cakes: Dynamic Computation in CakeML
inferred← citeshttps://doi.org/10.1145/3607833openalex-snapshot
Flexible Instruction-Set Semantics via Abstract Monads (Experience Report)
inferred← citeshttps://doi.org/10.1145/3607852openalex-snapshot
Dependently-Typed Programming with Logical Equality Reflection
inferred← citeshttps://doi.org/10.1145/3607854openalex-snapshot
Intrinsically Typed Sessions with Callbacks (Functional Pearl)
inferred← citeshttps://doi.org/10.1145/3622857openalex-snapshot
Stuttering for Free
inferred← citeshttps://doi.org/10.1145/3623759.3624544openalex-snapshot
Pancake
inferred← citeshttps://doi.org/10.1145/3632854openalex-snapshot
Modular Denotational Semantics for Effects with Guarded Interaction Trees
inferred← citeshttps://doi.org/10.1145/3632898openalex-snapshot
Algebraic Effects Meet Hoare Logic in Cubical Agda
inferred← citeshttps://doi.org/10.1145/3632914openalex-snapshot
Fully Composable and Adequate Verified Compilation with Direct Refinements between Open Modules
inferred← citeshttps://doi.org/10.1145/3632916openalex-snapshot
Securing Verified IO Programs Against Unverified Code in F*
inferred← citeshttps://doi.org/10.1145/3648439openalex-snapshot
Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages
inferred← citeshttps://doi.org/10.1145/3656433openalex-snapshot
A HAT Trick: Automatically Verifying Representation Invariants using Symbolic Finite Automata
inferred← citeshttps://doi.org/10.1145/3674645openalex-snapshot
Refinement Composition Logic
inferred← citeshttps://doi.org/10.1145/3674652openalex-snapshot
A Two-Phase Infinite/Finite Low-Level Memory Model: Reconciling Integer–Pointer Casts, Finite Space, and undef at the LLVM IR Level of Abstraction
inferred← citeshttps://doi.org/10.1145/3678000openalex-snapshot
Proceedings of the 9th ACM SIGPLAN International Workshop on Type-Driven Development
inferred← citeshttps://doi.org/10.1145/3702981openalex-snapshot
Unifying Model Execution and Deductive Verification with Interaction Trees in Isabelle/HOL
inferred← citeshttps://doi.org/10.1145/3703595.3705878openalex-snapshot
A CHERI C Memory Model for Verified Temporal Safety
inferred← citeshttps://doi.org/10.1145/3703595.3705890openalex-snapshot
Monadic Interpreters for Concurrent Memory Models
inferred← citeshttps://doi.org/10.1145/3704847openalex-snapshot
Program Logics à la Carte
inferred← citeshttps://doi.org/10.1145/3704860openalex-snapshot
A Verified Foreign Function Interface between Coq and C
inferred← citeshttps://doi.org/10.1145/3704880openalex-snapshot
Preservation of Speculative Constant-Time by Compilation
inferred← citeshttps://doi.org/10.1145/3704881openalex-snapshot
Archmage and CompCertCast: End-to-End Verification Supporting Integer-Pointer Casting
inferred← citeshttps://doi.org/10.1145/3704884openalex-snapshot
Modelling Recursion and Probabilistic Choice in Guarded Type Theory
inferred← citeshttps://doi.org/10.1145/3704889openalex-snapshot
Coinductive Proofs for Temporal Hyperliveness
inferred← citeshttps://doi.org/10.1145/3705593openalex-snapshot
Formal Verification of Just-in-Time Compilation
inferred← citeshttps://doi.org/10.1145/3705593.3705594openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1145/3705593.3705595openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1145/3705593.3705596openalex-snapshot
Background on Just-in-Time Compilation
inferred← citeshttps://doi.org/10.1145/3705593.3705597openalex-snapshot
Background on the CompCert Compiler
inferred← citeshttps://doi.org/10.1145/3705593.3705598openalex-snapshot
Designing Formally Verified JITs
inferred← citeshttps://doi.org/10.1145/3705593.3705599openalex-snapshot
Formally Verified Speculative Optimizations
inferred← citeshttps://doi.org/10.1145/3705593.3705600openalex-snapshot
Formal Verification of Impure Coq JITs
inferred← citeshttps://doi.org/10.1145/3705593.3705601openalex-snapshot
Formal Verification of a JIT Backend Compiler
inferred← citeshttps://doi.org/10.1145/3705593.3705602openalex-snapshot
Assessment
inferred← citeshttps://doi.org/10.1145/3705593.3705603openalex-snapshot
Conclusion
inferred← citeshttps://doi.org/10.1145/3705593.3705604openalex-snapshot
Relating the Developments to the Book
inferred← citeshttps://doi.org/10.1145/3705593.3705605openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1145/3705593.3705606openalex-snapshot
Authors’ Biography/Index
inferred← citeshttps://doi.org/10.1145/3720457openalex-snapshot
Adequacy for Algebraic Effects Revisited
inferred← citeshttps://doi.org/10.1145/3729311openalex-snapshot
PulseCore: An Impredicative Concurrent Separation Logic for Dependently Typed Programs
inferred← citeshttps://doi.org/10.1145/3729321openalex-snapshot
Handling the Selection Monad
inferred← citeshttps://doi.org/10.1145/3747512openalex-snapshot
Almost Fair Simulations
inferred← citeshttps://doi.org/10.1145/3747522openalex-snapshot
SecRef*: Securely Sharing Mutable References between Verified and Unverified Code in F*
inferred← citeshttps://doi.org/10.1145/3759164.3759352openalex-snapshot
Freer Arrows and Why You Need Them in Haskell
inferred← citeshttps://doi.org/10.1145/3759425.3763391openalex-snapshot
A Case Study on the Effectiveness of LLMs in Verification with Proof Assistants
inferred← citeshttps://doi.org/10.1145/3763091openalex-snapshot
Structural Temporal Logic for Mechanized Program Verification
inferred← citeshttps://doi.org/10.1145/3763119openalex-snapshot
A Refinement Methodology for Distributed Programs in Rust
inferred← citeshttps://doi.org/10.1145/3776650openalex-snapshot
ArchSem: Reusable Rigorous Semantics of Relaxed Architectures
inferred← citeshttps://doi.org/10.1145/3776682openalex-snapshot
Endangered by the Language But Saved by the Compiler: Robust Safety via Semantic Back-Translation
inferred← citeshttps://doi.org/10.1145/3776714openalex-snapshot
A Family of Sims with Diverging Interests
inferred← citeshttps://doi.org/10.1145/3776719openalex-snapshot
Foundational Multi-Modal Program Verifiers
inferred← citeshttps://doi.org/10.1145/3776733openalex-snapshot
Coco: Corecursion with Compositional Heterogeneous Productivity
inferred← citeshttps://doi.org/10.1145/3779031.3779088openalex-snapshot
Foundational Verification of Running-Time Bounds for Interactive Programs
inferred← citeshttps://doi.org/10.1145/3786762openalex-snapshot
An Axiomatic Basis for Computer Programming on Relaxed Hardware Architectures: The AxSL Logics
inferred← citeshttps://doi.org/10.1145/3797874openalex-snapshot
Denotation-based Compositional Compiler Verification
inferred← citeshttps://doi.org/10.1145/3808251openalex-snapshot
A Deductive System for Contract Satisfaction Proofs
inferred← citeshttps://doi.org/10.1145/3808263openalex-snapshot
Let It Flow: A Formally Verified Compilation Framework for Asynchronous Dataflow
inferred← citeshttps://doi.org/10.1145/3808317openalex-snapshot
CRIS: The Power of Imagination in Hybrid Verification
inferred← citeshttps://doi.org/10.1145/3838790.3838793openalex-snapshot
Effects with Variable Binding
inferred← citeshttps://doi.org/10.1145/3839460openalex-snapshot
Incremental Program Synthesis from Event Logs
inferred← citeshttps://doi.org/10.15514/ispras-2021-33(3)-11openalex-snapshot
Mechanized Theory of Event Structures: A Case of Parallel Register Machine
inferred← citeshttps://doi.org/10.17760/d20618640openalex-snapshot
Towards compositional probabilistic programming
inferred← citeshttps://doi.org/10.2991/978-94-6463-684-0_11openalex-snapshot
Formalizing Resource Ownership Semantics of Spinlocks with the Coq Proof Assistant
inferred← citeshttps://doi.org/10.4204/eptcs.337.6openalex-snapshot
SMLtoCoq: Automated Generation of Coq Specifications and Proof Obligations from SML Programs with Contracts
inferred← citeshttps://doi.org/10.4204/eptcs.351.13openalex-snapshot
Two Guarded Recursive Powerdomains for Applicative Simulation
inferred← citeshttps://doi.org/10.4204/eptcs.351.16openalex-snapshot
Inductive and Coinductive Predicate Liftings for Effectful Programs
inferred← citeshttps://doi.org/10.4230/lipics.concur.2021.20openalex-snapshot
Formally Verified Simulations of State-Rich Processes Using Interaction Trees in Isabelle/HOL
inferred← citeshttps://doi.org/10.46298/entics.12232openalex-snapshot
A denotationally-based program logic for higher-order store
inferred← citeshttps://doi.org/10.46298/lmcs-19(2:3)2023openalex-snapshot
Smart Choices and the Selection Monad
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:5)2023openalex-snapshot
Verifying an Effect-Handler-Based Define-By-Run Reverse-Mode AD Library
inferred← citeshttps://doi.org/10.48550/arxiv.2006.01531openalex-snapshot
Effectful Programming in Declarative Languages with an Emphasis on Non-Determinism: Applications and Formal Reasoning
inferred← citeshttps://doi.org/10.48550/arxiv.2103.10269openalex-snapshot
Zooid: a DSL for Certified Multiparty Computation
inferred← citeshttps://doi.org/10.48550/arxiv.2109.02991openalex-snapshot
Abstraction Logic: The Marriage of Contextual Refinement and Separation Logic
inferred← citeshttps://doi.org/10.48550/arxiv.2110.13559openalex-snapshot
Flexible Refinement Proofs in Separation Logic
inferred← citeshttps://doi.org/10.70675/95fceee8z06bbz48ccz8b06z87fb9e672ea8openalex-snapshot
Proof-oriented domain-specific language design for high-assurance software
inferred← citeshttps://doi.org/10.70675/bfb1bf73z45cez4651z9900z881984e8c420openalex-snapshot
Formal Verification of Just-in-Time Compilation
inferred← citeshttps://doi.org/10.70675/c1efe9f4z1500z4e67zaad4zcb5531cce150openalex-snapshot
Continuité en théorie des types
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.