On the public citation graph
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
0 signed · 270 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 this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.2000.2917openalex-snapshot
On Full Abstraction for PCF: I, II, and III
inferredcites →https://doi.org/10.1007/11417170_5openalex-snapshot
The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable
inferredcites →https://doi.org/10.1007/11523468_117openalex-snapshot
Unsafe Grammars and Panic Automata
inferredcites →https://doi.org/10.1007/11549345_16openalex-snapshot
Regular Sets of Higher-Order Pushdown Stacks
inferredcites →https://doi.org/10.1007/11787006_30openalex-snapshot
A Game-Theoretic Approach to Deciding Higher-Order Matching
inferredcites →https://doi.org/10.1007/11874683_7openalex-snapshot
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
inferredcites →https://doi.org/10.1007/3-540-45061-0_45openalex-snapshot
Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games
inferredcites →https://doi.org/10.1007/3-540-45687-2_13openalex-snapshot
On Infinite Terms Having a Decidable Monadic Theory
inferredcites →https://doi.org/10.1007/3-540-45931-6_15openalex-snapshot
Higher-Order Pushdown Trees Are Easy
inferredcites →https://doi.org/10.1007/3-540-46541-3_24openalex-snapshot
Small Progress Measures for Solving Parity Games
inferredcites →https://doi.org/10.1007/3-540-61440-0_128openalex-snapshot
On infinite transition graphs having a decidable monadic theory
inferredcites →https://doi.org/10.1007/3-540-61604-7_60openalex-snapshot
On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_30openalex-snapshot
Global Model-Checking of Infinite-State Systems
inferredcites →https://doi.org/10.1007/978-3-540-31982-5_31openalex-snapshot
Safety Is not a Restriction at Level 2 for String Languages
inferredcites →https://doi.org/10.1016/0304-3975(82)90009-3openalex-snapshot
The IO- and OI-hierarchies
inferredcites →https://doi.org/10.1016/0304-3975(85)90087-8openalex-snapshot
The theory of ends, pushdown automata, and second-order logic
inferredcites →https://doi.org/10.1016/0304-3975(87)90133-2openalex-snapshot
Alternating automata on infinite trees
inferredcites →https://doi.org/10.1016/0890-5401(91)90052-4openalex-snapshot
Notions of computation and monads
inferredcites →https://doi.org/10.1016/b978-044482830-9/50022-9openalex-snapshot
Modal Logics and mu-Calculi: An Introduction
inferredcites →https://doi.org/10.1016/s0020-0190(02)00445-3openalex-snapshot
Note on winning positions on pushdown games with ω-regular conditions
inferredcites →https://doi.org/10.1016/s1571-0661(04)80534-6openalex-snapshot
Uniform Solution of Parity Games on Prefix-Recognizable Graphs
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot
Decidability of second-order theories and automata on infinite trees.
inferredcites →https://doi.org/10.1109/sfcs.1991.185392openalex-snapshot
Tree automata, mu-calculus and determinacy
inferredcites →https://doi.org/10.1145/333623.333624openalex-snapshot
Decidability of bisimulation equivalence for normed pushdown processes
inferredcites →https://doi.org/10.1145/800061.808767openalex-snapshot
Iterated pushdown automata and complexity classes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11787006_30openalex-snapshot
A Game-Theoretic Approach to Deciding Higher-Order Matching
inferred← citeshttps://doi.org/10.1007/11874683_2openalex-snapshot
Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/11874683_7openalex-snapshot
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-00250-3_4openalex-snapshot
Constrained Dynamic Tree Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-13435-8_27openalex-snapshot
Extensions of the Caucal Hierarchy?
inferred← citeshttps://doi.org/10.1007/978-3-030-32304-2_21openalex-snapshot
A Temporal Logic for Higher-Order Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-34175-6_8openalex-snapshot
A Type-Based HFL Model Checking Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-35540-1_1openalex-snapshot
A Bounded Model Checking Technique for Higher-Order Programs
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-77448-6_11openalex-snapshot
A New Approach to Modelling and Verification of Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-79416-3_24openalex-snapshot
Shelah-Stupp’s and Muchnik’s Iterations Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_2openalex-snapshot
Monadic Intersection Types, Relationally
inferred← citeshttps://doi.org/10.1007/978-3-031-82700-6_2openalex-snapshot
Space-Efficient Model-Checking of Higher-Order Recursion Schemes
inferred← citeshttps://doi.org/10.1007/978-3-319-03542-0_2openalex-snapshot
Practical Alternating Parity Tree Automata Model Checking of Higher-Order Recursion Schemes
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_26openalex-snapshot
The mu-calculus and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_19openalex-snapshot
A ZDD-Based Efficient Higher-Order Model Checking Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-17524-9_17openalex-snapshot
A Falsification View of Success Typing
inferred← citeshttps://doi.org/10.1007/978-3-319-21668-3_17openalex-snapshot
Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-26529-2_16openalex-snapshot
Automata-Based Abstraction for Automated Verification of Higher-Order Tree-Processing Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-26529-2_17openalex-snapshot
Decision Algorithms for Checking Definability of Order-2 Finitary PCF
inferred← citeshttps://doi.org/10.1007/978-3-319-46520-3_20openalex-snapshot
Equivalence-Based Abstraction Refinement for $$\mu $$ HORS Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-47958-3_16openalex-snapshot
Higher-Order Model Checking in Direct Style
inferred← citeshttps://doi.org/10.1007/978-3-319-47958-3_18openalex-snapshot
Verification of Higher-Order Concurrent Programs with Dynamic Resource Creation
inferred← citeshttps://doi.org/10.1007/978-3-319-52234-0_23openalex-snapshot
Reachability for Dynamic Parametric Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-53946-1openalex-snapshot
Formal Techniques for Safety-Critical Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-89366-2_31openalex-snapshot
Verifying Higher-Order Functions with Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_25openalex-snapshot
Higher-Order Program Verification via HFL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-96145-3_6openalex-snapshot
Propositional Dynamic Logic for Higher-Order Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-71389-0_16openalex-snapshot
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_1openalex-snapshot
Games, Automata and Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_4openalex-snapshot
Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-78739-6_23openalex-snapshot
Verification of Higher-Order Computation: A Game-Semantic Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_9openalex-snapshot
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-02261-6_5openalex-snapshot
Recognizability in the Simply Typed Lambda-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_19openalex-snapshot
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-10622-4_2openalex-snapshot
Higher-Order Program Verification and Language-Based Security
inferred← citeshttps://doi.org/10.1007/978-3-642-10672-9_2openalex-snapshot
Types and Recursion Schemes for Higher-Order Program Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-11319-2_10openalex-snapshot
Complexity Bounds for the Verification of Real-Time Software
inferred← citeshttps://doi.org/10.1007/978-3-642-11881-4openalex-snapshot
Automata for Branching and Layered Temporal Structures : An Investigation into Regularities of Infinite Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_1openalex-snapshot
Introduction to Decidability of Higher-Order Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_24openalex-snapshot
Untyped Recursion Schemes and Infinite Intersection Types
inferred← citeshttps://doi.org/10.1007/978-3-642-13754-9_11openalex-snapshot
An Automata-Theoretic Approach to Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_22openalex-snapshot
Verification of Tree-Processing Programs via Higher-Order Model Checking
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_12openalex-snapshot
Krivine Machines and Higher-Order Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_38openalex-snapshot
HMC: Verifying Functional Programs Using Abstract Interpreters
inferred← citeshttps://doi.org/10.1007/978-3-642-29822-6_22openalex-snapshot
Exact Flow Analysis by Higher-Order Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_18openalex-snapshot
A Saturation Method for Collapsible Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_31openalex-snapshot
Two-Level Game Semantics, Intersection Types, and Recursion Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_6openalex-snapshot
Simple Models for Recursive Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_25openalex-snapshot
An Intersection Type System for Deterministic Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_8openalex-snapshot
A Context-Free Linear Ordering with an Undecidable First-Order Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-33512-9_2openalex-snapshot
Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-35308-6_4openalex-snapshot
Program Certification by Higher-Order Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-37036-6_24openalex-snapshot
Model-Checking Higher-Order Programs with Recursive Types
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_3openalex-snapshot
Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-38946-7_15openalex-snapshot
Using Models to Model-Check Recursive Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_31openalex-snapshot
The IO and OI Hierarchies Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_36openalex-snapshot
Proof Systems for Retracts in Simply Typed Lambda Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-54830-7_10openalex-snapshot
Unsafe Order-2 Tree Languages Are Context-Sensitive
inferred← citeshttps://doi.org/10.1007/978-3-642-54830-7_12openalex-snapshot
Complexity of Model-Checking Call-by-Value Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-54833-8_21openalex-snapshot
Automatic Termination Verification for Higher-Order Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-662-44471-9_6openalex-snapshot
From Linear Types to Behavioural Types and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_22openalex-snapshot
Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-662-46678-0_22openalex-snapshot
Typing Weak MSOL Properties
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_20openalex-snapshot
Finitary Semantics of Linear Logic and Higher-Order Model-Checking
inferred← citeshttps://doi.org/10.1007/978-3-662-54069-5_3openalex-snapshot
Automata, Logic and Games for the $$\lambda $$ -Calculus
inferred← citeshttps://doi.org/10.1007/978-3-662-54458-7_4openalex-snapshot
Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence
inferred← citeshttps://doi.org/10.1007/978-3-662-58771-3_5openalex-snapshot
Specifying Program Properties Using Modal Fixpoint Logics: A Survey of Results
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.1007/s10990-013-9093-zopenalex-snapshot
Functional programs as compressed data
inferred← citeshttps://doi.org/10.1007/s40687-018-0163-zopenalex-snapshot
A game-semantic model of computation
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102792openalex-snapshot
Herbrand's theorem as higher order recursion
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.021openalex-snapshot
Model-Checking Games for Typed λ-Calculi
inferred← citeshttps://doi.org/10.1016/j.future.2016.06.014openalex-snapshot
Automatic security verification of mobile app configurations
inferred← citeshttps://doi.org/10.1016/j.ic.2014.07.012openalex-snapshot
Krivine machines and higher-order schemes
inferred← citeshttps://doi.org/10.1016/j.ic.2014.12.015openalex-snapshot
The IO and OI hierarchies revisited
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104782openalex-snapshot
The Caucal hierarchy: Interpretations in the (W)MSO+U logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.09.035openalex-snapshot
Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.08.035openalex-snapshot
Evaluating lambda terms with traversals
inferred← citeshttps://doi.org/10.1017/cbo9780511974960.002openalex-snapshot
Automata-based presentations of infinite structures
inferred← citeshttps://doi.org/10.1017/s0956796814000100openalex-snapshot
Pushdown flow analysis with abstract garbage collection
inferred← citeshttps://doi.org/10.1017/s0956796816000216openalex-snapshot
Higher order symbolic execution for contract verification and refutation
inferred← citeshttps://doi.org/10.1017/s0960129513000054openalex-snapshot
Verification of tree-processing programs via higher-order mode checking
inferred← citeshttps://doi.org/10.1017/s0960129514000590openalex-snapshot
Simply typed fixpoint calculus and collapsible pushdown automata
inferred← citeshttps://doi.org/10.1017/s0960129519000173openalex-snapshot
Monoidal-closed categories of tree automata
inferred← citeshttps://doi.org/10.1109/cts.2010.5478517openalex-snapshot
Dynamic Networks of Timed Automata for collaborative systems: A network monitoring case study
inferred← citeshttps://doi.org/10.1109/lics.2007.14openalex-snapshot
Categorical Combinatorics for Innocent Strategies
inferred← citeshttps://doi.org/10.1109/lics.2007.6openalex-snapshot
A Contraction Method to Decide MSO Theories of Deterministic Trees
inferred← citeshttps://doi.org/10.1109/lics.2008.24openalex-snapshot
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
inferred← citeshttps://doi.org/10.1109/lics.2008.34openalex-snapshot
Collapsible Pushdown Automata and Recursion Schemes
inferred← citeshttps://doi.org/10.1109/lics.2009.26openalex-snapshot
Applications of Game Semantics: From Program Analysis to Hardware Synthesis
inferred← citeshttps://doi.org/10.1109/lics.2009.29openalex-snapshot
A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes
inferred← citeshttps://doi.org/10.1109/lics.2010.40openalex-snapshot
Recursion Schemes and Logical Reflection
inferred← citeshttps://doi.org/10.1109/lics.2011.15openalex-snapshot
Higher-Order Model Checking: From Theory to Practice
inferred← citeshttps://doi.org/10.1109/lics.2012.62openalex-snapshot
On the Significance of the Collapse Operation
inferred← citeshttps://doi.org/10.1109/lics.2012.73openalex-snapshot
Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection
inferred← citeshttps://doi.org/10.1109/lics.2015.71openalex-snapshot
Automata-Based Abstraction Refinement for µHORS Model Checking
inferred← citeshttps://doi.org/10.1109/lics.2015.9openalex-snapshot
Higher-Order Model Checking: An Overview
inferred← citeshttps://doi.org/10.1109/lics.2017.8005064openalex-snapshot
Quantitative semantics of the lambda calculus: Some generalisations of the relational model
inferred← citeshttps://doi.org/10.1109/lics.2017.8005077openalex-snapshot
Higher-order parity automata
inferred← citeshttps://doi.org/10.1109/lics.2019.8785674openalex-snapshot
Lambda Y-Calculus With Priorities
inferred← citeshttps://doi.org/10.1109/lics.2019.8785679openalex-snapshot
On the Termination Problem for Probabilistic Higher-Order Recursive Programs
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00045openalex-snapshot
The Qualitative Collapse of Concurrent Games
inferred← citeshttps://doi.org/10.1145/1480881.1480933openalex-snapshot
Types and higher-order recursion schemes for verification of higher-order programs
inferred← citeshttps://doi.org/10.1145/1594834.1480933openalex-snapshot
Types and higher-order recursion schemes for verification of higher-order programs
inferred← citeshttps://doi.org/10.1145/1599410.1599415openalex-snapshot
Model-checking higher-order functions
inferred← citeshttps://doi.org/10.1145/1706299.1706315openalex-snapshot
Dependent types from counterexamples
inferred← citeshttps://doi.org/10.1145/1706299.1706355openalex-snapshot
Higher-order multi-parameter tree transducers and recursion schemes for program verification
inferred← citeshttps://doi.org/10.1145/1707801.1706315openalex-snapshot
Dependent types from counterexamples
inferred← citeshttps://doi.org/10.1145/1707801.1706355openalex-snapshot
Higher-order multi-parameter tree transducers and recursion schemes for program verification
inferred← citeshttps://doi.org/10.1145/1890028.1890030openalex-snapshot
Automated termination proofs for haskell by term rewriting
inferred← citeshttps://doi.org/10.1145/1925844.1926453openalex-snapshot
Verifying higher-order functional programs with pattern-matching algebraic data types
inferred← citeshttps://doi.org/10.1145/1926385.1926453openalex-snapshot
Verifying higher-order functional programs with pattern-matching algebraic data types
inferred← citeshttps://doi.org/10.1145/1993316.1993525openalex-snapshot
Predicate abstraction and CEGAR for higher-order model checking
inferred← citeshttps://doi.org/10.1145/1993498.1993525openalex-snapshot
Predicate abstraction and CEGAR for higher-order model checking
inferred← citeshttps://doi.org/10.1145/2103746.2103767openalex-snapshot
Hybrid contract checking via symbolic simplification
inferred← citeshttps://doi.org/10.1145/2103746.2103770openalex-snapshot
Functional programs as compressed data
inferred← citeshttps://doi.org/10.1145/2364527.2364576openalex-snapshot
Introspective pushdown analysis of higher-order programs
inferred← citeshttps://doi.org/10.1145/2364527.2364578openalex-snapshot
A traversal-based algorithm for higher-order model checking
inferred← citeshttps://doi.org/10.1145/2398856.2364576openalex-snapshot
Introspective pushdown analysis of higher-order programs
inferred← citeshttps://doi.org/10.1145/2398856.2364578openalex-snapshot
A traversal-based algorithm for higher-order model checking
inferred← citeshttps://doi.org/10.1145/2426890.2426900openalex-snapshot
Towards a scalable software model checker for higher-order programs
inferred← citeshttps://doi.org/10.1145/2487241.2487246openalex-snapshot
Model Checking Higher-Order Programs
inferred← citeshttps://doi.org/10.1145/2535838.2535873openalex-snapshot
A type-directed abstraction refinement approach to higher-order model checking
inferred← citeshttps://doi.org/10.1145/2578855.2535873openalex-snapshot
A type-directed abstraction refinement approach to higher-order model checking
inferred← citeshttps://doi.org/10.1145/2603088.2603133openalex-snapshot
Compositional higher-order model checking via ω -regular games over Böhm trees
inferred← citeshttps://doi.org/10.1145/2603088.2603152openalex-snapshot
On periodically iterated morphisms
inferred← citeshttps://doi.org/10.1145/2632362.2632381openalex-snapshot
TravMC2: higher-order model checking for alternating parity tree automata
inferred← citeshttps://doi.org/10.1145/2643135.2643142openalex-snapshot
Exact Intersection Type Abstractions for Safety Checking of Recursion Schemes
inferred← citeshttps://doi.org/10.1145/2837614.2837667openalex-snapshot
Temporal verification of higher-order functional programs
inferred← citeshttps://doi.org/10.1145/2837614.2837673openalex-snapshot
Lattice-theoretic progress measures and coalgebraic model checking
inferred← citeshttps://doi.org/10.1145/2914770.2837667openalex-snapshot
Temporal verification of higher-order functional programs
inferred← citeshttps://doi.org/10.1145/2914770.2837673openalex-snapshot
Lattice-theoretic progress measures and coalgebraic model checking
inferred← citeshttps://doi.org/10.1145/2933575.2934527openalex-snapshot
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable
inferred← citeshttps://doi.org/10.1145/2933575.2934552openalex-snapshot
First-order logic with reachability for infinite-state systems
inferred← citeshttps://doi.org/10.1145/2948896.2948902openalex-snapshot
An invitation to game semantics
inferred← citeshttps://doi.org/10.1145/2951913.2951919openalex-snapshot
Automatically disproving fair termination of higher-order functional programs
inferred← citeshttps://doi.org/10.1145/2955811.2955815openalex-snapshot
Generating Concurrency Checks Automatically
inferred← citeshttps://doi.org/10.1145/3009837openalex-snapshot
POPL 2017: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages
inferred← citeshttps://doi.org/10.1145/3009837.3009854openalex-snapshot
On the relationship between higher-order recursion schemes and higher-order fixpoint logic
inferred← citeshttps://doi.org/10.1145/3018882.3018886openalex-snapshot
Verification of code generators via higher-order model checking
inferred← citeshttps://doi.org/10.1145/3018882.3020004openalex-snapshot
Compiling untyped lambda calculus to lower-level code by game semantics and partial evaluation (invited paper)
inferred← citeshttps://doi.org/10.1145/3022670.2951919openalex-snapshot
Automatically disproving fair termination of higher-order functional programs
inferred← citeshttps://doi.org/10.1145/3026744.3026745openalex-snapshot
Automata theory and higher-order model-checking
inferred← citeshttps://doi.org/10.1145/3093333.3009854openalex-snapshot
On the relationship between higher-order recursion schemes and higher-order fixpoint logic
inferred← citeshttps://doi.org/10.1145/3158099openalex-snapshot
Higher-order constrained horn clauses for verification
inferred← citeshttps://doi.org/10.1145/3158100openalex-snapshot
Relatively complete refinement type system for verification of higher-order non-deterministic programs
inferred← citeshttps://doi.org/10.1145/3158127openalex-snapshot
Linearity in higher-order recursion schemes
inferred← citeshttps://doi.org/10.1145/3209108.3209204openalex-snapshot
A Fixpoint Logic and Dependent Effects for Temporal Property Verification
inferred← citeshttps://doi.org/10.1145/3236950.3236969openalex-snapshot
Lazy Abstraction for Higher-Order Program Verification
inferred← citeshttps://doi.org/10.1145/3294032.3294077openalex-snapshot
Reduction from branching-time property verification of higher-order programs to HFL validity checking
inferred← citeshttps://doi.org/10.1145/3294032.3294081openalex-snapshot
Combining higher-order model checking with refinement type inference
inferred← citeshttps://doi.org/10.1145/3408994openalex-snapshot
Regular language type inference with term rewriting
inferred← citeshttps://doi.org/10.1145/3434313openalex-snapshot
Intersection types and (positive) almost-sure termination
inferred← citeshttps://doi.org/10.1145/3434336openalex-snapshot
Intensional datatype refinement: with application to scalable verification of pattern-match safety
inferred← citeshttps://doi.org/10.1145/3452917openalex-snapshot
Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties
inferred← citeshttps://doi.org/10.1145/3531130.3533351openalex-snapshot
Probabilistic Verification Beyond Context-Freeness
inferred← citeshttps://doi.org/10.1145/3632929openalex-snapshot
On Model-Checking Higher-Order Effectful Programs
inferred← citeshttps://doi.org/10.1145/3661814.3662134openalex-snapshot
Slice closures of indexed languages and word equations with counting constraints
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/3763184openalex-snapshot
On Higher-Order Model Checking of Effectful Answer-Type-Polymorphic Programs
inferred← citeshttps://doi.org/10.2168/lmcs-3(3:1)2007openalex-snapshot
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
inferred← citeshttps://doi.org/10.2168/lmcs-4(4:14)2008openalex-snapshot
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
inferred← citeshttps://doi.org/10.2168/lmcs-5(3:2)2009openalex-snapshot
Decidability of higher-order matching
inferred← citeshttps://doi.org/10.2168/lmcs-7(4:9)2011openalex-snapshot
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
inferred← citeshttps://doi.org/10.2168/lmcs-8(4:11)2012openalex-snapshot
Linear Dependent Types and Relative Completeness
inferred← citeshttps://doi.org/10.2197/ipsjjip.31.708openalex-snapshot
Refinement Types for Call-by-name Programs
inferred← citeshttps://doi.org/10.23638/lmcs-13(1:14)2017openalex-snapshot
Typing weak MSOL properties
inferred← citeshttps://doi.org/10.23638/lmcs-13(3:35)2017openalex-snapshot
Games and Strategies as Event Structures
inferred← citeshttps://doi.org/10.23638/lmcs-14(3:8)2018openalex-snapshot
The recursion hierarchy for PCF is strict
inferred← citeshttps://doi.org/10.23638/lmcs-15(1:16)2019openalex-snapshot
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence
inferred← citeshttps://doi.org/10.23638/lmcs-16(1:20)2020openalex-snapshot
Recursion Schemes, the MSO Logic, and the U quantifier
inferred← citeshttps://doi.org/10.23638/lmcs-16(3:11)2020openalex-snapshot
On the Expressive Power of Higher-Order Pushdown Systems
inferred← citeshttps://doi.org/10.26053/0h-qyge-1xg0openalex-snapshot
Introspective pushdown analysis and nebo
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d14openalex-snapshot
Temporal Refinements for Guarded Recursive Types
inferred← citeshttps://doi.org/10.3233/fi-2018-1667openalex-snapshot
Shelah-Stupp’s Iteration and Muchnik’s Iteration
inferred← citeshttps://doi.org/10.3233/fi-222145openalex-snapshot
Cost Automata, Safe Schemes, and Downward Closures
inferred← citeshttps://doi.org/10.4204/eptcs.177.4openalex-snapshot
Indexed linear logic and higher-order model checking
inferred← citeshttps://doi.org/10.4204/eptcs.199.3openalex-snapshot
Verifying Temporal Properties of Reactive Systems by Transformation
inferred← citeshttps://doi.org/10.4204/eptcs.216openalex-snapshot
Generating counterexamples for model checking by transformation
showing the first 200 of 244 · page through all 244
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.