| Publication | Date of Publication | Type |
|---|
| Linear-algebraic models of linear logic as categories of modules over \(\Sigma \)-semirings | 2024-12-06 | Paper |
Signature restriction for polymorphic algebraic effects
Journal of Functional Programming | 2024-08-28 | Paper |
| A temporal logic for higher-order functional programs | 2024-04-19 | Paper |
| A type-based HFL model checking algorithm | 2024-04-19 | Paper |
A categorical model of an \textbf{i/o}-typed \(\pi \)-calculus
Programming Languages and Systems | 2023-11-24 | Paper |
Automated synthesis of functional programs with auxiliary functions
Programming Languages and Systems | 2023-08-02 | Paper |
| Output Without Delay: A π-Calculus Compatible with Categorical Semantics | 2023-06-23 | Paper |
| Termination Analysis for the $$\pi $$-Calculus by Reduction to Sequential Program Termination | 2023-03-29 | Paper |
RustHorn: CHC-based verification for Rust programs
Programming Languages and Systems | 2022-10-13 | Paper |
scientific article; zbMATH DE number 7471675 (Why is no real title available?)
(available as arXiv preprint) | 2022-02-09 | Paper |
| scientific article; zbMATH DE number 7471675 (Why is no real title available?) | 2022-02-09 | Paper |
| Predicate abstraction and CEGAR for \(\nu \mathrm{HFL}_\mathbb{Z}\) validity checking | 2021-10-18 | Paper |
| A new refinement type system for automated \(\nu\text{HFL}_\mathbb{Z}\) validity checking | 2021-07-08 | Paper |
On Computability of Logical Approaches to Branching-Time Property Verification of Programs
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
| Streett Automata Model Checking of Higher-Order Recursion Schemes | 2020-05-26 | Paper |
Higher-order program verification via HFL model checking
(available as arXiv preprint) | 2019-09-13 | Paper |
scientific article; zbMATH DE number 7029315 (Why is no real title available?)
(available as arXiv preprint) | 2019-02-25 | Paper |
A truly concurrent game model of the asynchronous \(\pi\)-calculus
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Almost every simply typed \(\lambda\)-term has a long \(\beta\)-reduction sequence
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Automatically disproving fair termination of higher-order functional programs
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming | 2017-05-10 | Paper |
Higher-order model checking in direct style
Programming Languages and Systems | 2016-12-21 | Paper |
Verification of higher-order concurrent programs with dynamic resource creation
Programming Languages and Systems | 2016-12-21 | Paper |
Complexity of model-checking call-by-value programs
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Unsafe order-2 tree languages are context-sensitive
Lecture Notes in Computer Science | 2014-04-16 | Paper |
An intersection type system for deterministic pushdown automata
Lecture Notes in Computer Science | 2012-09-21 | Paper |
Exact flow analysis by higher-order model checking
Functional and Logic Programming | 2012-07-20 | Paper |
A Logical Foundation for Environment Classifiers
Logical Methods in Computer Science | 2010-12-20 | Paper |
Untyped Recursion Schemes and Infinite Intersection Types
Foundations of Software Science and Computational Structures | 2010-04-27 | Paper |
A Logical Foundation for Environment Classifiers
Lecture Notes in Computer Science | 2009-07-07 | Paper |
