On the public citation graph

On Model-Checking Higher-Order Effectful Programs

0 signed · 67 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-36387-4openalex-snapshot
Automata logics, and infinite games: a guide to current research
inferredcites →https://doi.org/10.1007/3-540-45413-6_21openalex-snapshot
Deciding Monadic Theories of Hyperalgebraic Trees
inferredcites →https://doi.org/10.1007/3-540-45931-6_15openalex-snapshot
Higher-Order Pushdown Trees Are Easy
inferredcites →https://doi.org/10.1007/978-3-030-02768-1_22openalex-snapshot
Shallow Effect Handlers
inferredcites →https://doi.org/10.1007/978-3-030-17127-8_22openalex-snapshot
A Sound and Complete Logic for Algebraic Effects
inferredcites →https://doi.org/10.1007/978-3-031-21037-2_5openalex-snapshot
Automated Temporal Verification for Algebraic Effects
inferredcites →https://doi.org/10.1007/978-3-319-10575-8openalex-snapshot
Handbook of Model Checking
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_11openalex-snapshot
Behavioural Equivalence via Modalities for Algebraic Effects
inferredcites →https://doi.org/10.1007/978-3-642-00590-9_7openalex-snapshot
Handlers of Algebraic Effects
inferredcites →https://doi.org/10.1007/978-3-642-19805-2_18openalex-snapshot
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
inferredcites →https://doi.org/10.1007/978-3-642-33512-9_2openalex-snapshot
Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_24openalex-snapshot
Model-Checking Higher-Order Programs with Recursive Types
inferredcites →https://doi.org/10.1007/978-3-642-54830-7_12openalex-snapshot
Complexity of Model-Checking Call-by-Value Programs
inferredcites →https://doi.org/10.1007/bfb0058022openalex-snapshot
Model checking
inferredcites →https://doi.org/10.1016/0304-3975(75)90017-1openalex-snapshot
Call-by-name, call-by-value and the λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(95)00049-3openalex-snapshot
The monadic second-order logic of graphs IX: Machines and their behaviours
inferredcites →https://doi.org/10.1016/j.entcs.2015.12.003openalex-snapshot
An Introduction to Algebraic Effects and Handlers. Invited tutorial paper
inferredcites →https://doi.org/10.1016/j.ic.2014.07.012openalex-snapshot
Krivine machines and higher-order schemes
inferredcites →https://doi.org/10.1017/s095679681300018xopenalex-snapshot
Idris, a general-purpose dependently typed programming language: Design and implementation
inferredcites →https://doi.org/10.1017/s0956796818000151openalex-snapshot
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
inferredcites →https://doi.org/10.1017/s0956796824000054openalex-snapshot
Signature Restriction for Polymorphic Algebraic Effects
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.1993.287593openalex-snapshot
On completeness of the mu -calculus
inferredcites →https://doi.org/10.1109/lics.2006.38openalex-snapshot
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
inferredcites →https://doi.org/10.1109/lics.2008.34openalex-snapshot
Collapsible Pushdown Automata and Recursion Schemes
inferredcites →https://doi.org/10.1109/lics.2008.45openalex-snapshot
A Logic for Algebraic Effects
inferredcites →https://doi.org/10.1109/lics.2009.29openalex-snapshot
A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes
inferredcites →https://doi.org/10.1109/lics.2010.29openalex-snapshot
A Generic Operational Metatheory for Algebraic Effects
inferredcites →https://doi.org/10.1109/lics.2010.40openalex-snapshot
Recursion Schemes and Logical Reflection
inferredcites →https://doi.org/10.1109/lics.2012.73openalex-snapshot
Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection
inferredcites →https://doi.org/10.1109/lics.2015.9openalex-snapshot
Higher-Order Model Checking: An Overview
inferredcites →https://doi.org/10.1109/lics.2017.8005117openalex-snapshot
Effectful applicative bisimilarity: Monads, relators, and Howe's method
inferredcites →https://doi.org/10.1109/lics.2019.8785679openalex-snapshot
On the Termination Problem for Probabilistic Higher-Order Recursive Programs
inferredcites →https://doi.org/10.1109/sfcs.1991.185392openalex-snapshot
Tree automata, mu-calculus and determinacy
inferredcites →https://doi.org/10.1145/113445.113468openalex-snapshot
Refinement types for ML
inferredcites →https://doi.org/10.1145/1480881.1480933openalex-snapshot
Types and higher-order recursion schemes for verification of higher-order programs
inferredcites →https://doi.org/10.1145/1538788.1538814openalex-snapshot
Formal verification of a realistic compiler
inferredcites →https://doi.org/10.1145/1706299.1706355openalex-snapshot
Higher-order multi-parameter tree transducers and recursion schemes for program verification
inferredcites →https://doi.org/10.1145/2364527.2364578openalex-snapshot
A traversal-based algorithm for higher-order model checking
inferredcites →https://doi.org/10.1145/237721.240882openalex-snapshot
Proving the correctness of reactive systems using sized types
inferredcites →https://doi.org/10.1145/2384616.2384655openalex-snapshot
Higher-order symbolic execution via contracts
inferredcites →https://doi.org/10.1145/2426890.2426900openalex-snapshot
Towards a scalable software model checker for higher-order programs
inferredcites →https://doi.org/10.1145/2500365.2500590openalex-snapshot
Handlers in action
inferredcites →https://doi.org/10.1145/2535838.2535873openalex-snapshot
A type-directed abstraction refinement approach to higher-order model checking
inferredcites →https://doi.org/10.1145/3026744.3026745openalex-snapshot
Automata theory and higher-order model-checking
inferredcites →https://doi.org/10.1145/3290319openalex-snapshot
Abstracting algebraic effects
inferredcites →https://doi.org/10.1145/3363518openalex-snapshot
Behavioural Equivalence via Modalities for Algebraic Effects
inferredcites →https://doi.org/10.1145/3408999openalex-snapshot
Signature restriction for polymorphic algebraic effects
inferredcites →https://doi.org/10.1145/351240.351259openalex-snapshot
Intersection types and computational effects
inferredcites →https://doi.org/10.1145/3571264openalex-snapshot
Temporal Verification with Answer-Effect Modification: Dependent Temporal Type-and-Effect System with Delimited Continuations
inferredcites →https://doi.org/10.1145/360248.360252openalex-snapshot
Symbolic execution and program testing
inferredcites →https://doi.org/10.1145/3632929openalex-snapshot
On Model-Checking Higher-Order Effectful Programs
inferredcites →https://doi.org/10.4230/lipics.csl.2013.129openalex-snapshot
Saturation-Based Model Checking of Higher-Order Recursion Schemes
inferredcites →https://doi.org/10.4230/lipics.ecoop.2020.23openalex-snapshot
Lifting Sequential Effects to Control Operators
inferredcites →https://doi.org/10.4230/lipics.fscd.2017.18openalex-snapshot
Continuation Passing Style for Effect Handlers
inferredcites →https://doi.org/10.4230/lipics.fscd.2020.21openalex-snapshot
Average-Case Completeness in Tag Systems

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-981-95-3585-9_4openalex-snapshot
Reachability is Decidable for ATM-Typable Finitary PCF with Effect Handlers
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/3678000.3678202openalex-snapshot
Modal μ-Calculus for Free in Agda
inferred← citeshttps://doi.org/10.1145/3689805openalex-snapshot
Higher-Order Model Checking of Effect-Handling Programs with Answer-Type Modification
inferred← citeshttps://doi.org/10.1145/3704875openalex-snapshot
On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus
inferred← citeshttps://doi.org/10.1145/3763140openalex-snapshot
Abstract Interpretation of Temporal Safety Effects of Higher Order Programs
inferred← citeshttps://doi.org/10.1145/3763184openalex-snapshot
On Higher-Order Model Checking of Effectful Answer-Type-Polymorphic Programs
inferred← citeshttps://doi.org/10.1145/3776643openalex-snapshot
The Complexity of Testing Message-Passing Concurrency
inferred← citeshttps://doi.org/10.1145/3828703openalex-snapshot
HMCFA: A Precise and Practical Big-Step Control Flow Analysis for Effect Handlers
showing the first 9 of 10 · page through all 10
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.