| Publication | Date of Publication | Type |
|---|
| Combining quantum and classical control: syntax, semantics and adequacy | 2025-12-04 | Paper |
| Quantum expectation transformers for cost analysis | 2024-12-06 | Paper |
Complete and tractable machine-independent characterizations of second-order polytime
Lecture Notes in Computer Science | 2024-01-23 | Paper |
A tier-based typed programming language characterizing feasible functionals
(available as arXiv preprint) | 2022-08-02 | Paper |
| A tier-based typed programming language characterizing feasible functionals | 2022-08-02 | Paper |
| \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs | 2022-03-31 | Paper |
| Polynomial time over the reals with parsimony | 2021-07-06 | Paper |
A tier-based typed programming language characterizing Feasible Functionals
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
A tier-based typed programming language characterizing Feasible Functionals
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
| On the complexity of minimizing median normal forms of monotone Boolean functions and lattice polynomials | 2021-01-15 | Paper |
Theory of higher order interpretations and application to basic feasible functions
(available as arXiv preprint) | 2020-12-18 | Paper |
| Theory of higher order interpretations and application to basic feasible functions | 2020-12-18 | Paper |
Quantum programming with inductive datatypes: causality and affine type theory
(available as arXiv preprint) | 2020-09-23 | Paper |
On the efficiency of normal form systems for representing Boolean functions
Theoretical Computer Science | 2020-04-21 | Paper |
Higher order interpretation for higher order complexity
EPiC Series in Computing | 2019-01-10 | Paper |
A type-based complexity analysis of object oriented programs
Information and Computation | 2018-06-14 | Paper |
Algebras and coalgebras in the light affine lambda calculus
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming | 2017-05-10 | Paper |
Objects in polynomial time
Programming Languages and Systems | 2016-01-08 | Paper |
Sup-interpretations, a semantic method for static analysis of program resources
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Characterizing polynomial time complexity of stream programs using interpretations
Theoretical Computer Science | 2015-05-26 | Paper |
Complexity information flow in a multi-threaded imperative language
Lecture Notes in Computer Science | 2014-04-16 | Paper |
A categorical treatment of malicious behavioral obfuscation
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Type-Based Complexity Analysis for Fork Processes
Lecture Notes in Computer Science | 2013-03-18 | Paper |
Synthesis of sup-interpretations: a survey
Theoretical Computer Science | 2013-02-19 | Paper |
| Analyzing the implicit computational complexity of object-oriented programs | 2012-10-19 | Paper |
Interpretation of stream programs: characterizing type 2 polynomial time complexity
Algorithms and Computation | 2010-12-09 | Paper |
Global and local space properties of stream programs
Foundational and Practical Aspects of Resource Analysis | 2010-09-14 | Paper |
Upper Bounds on Stream I/O Using Semantic Interpretations
Computer Science Logic | 2009-11-12 | Paper |
Quasi-interpretation Synthesis by Decomposition
Theoretical Aspects of Computing – ICTAC 2007 | 2008-09-17 | Paper |
A Characterization of Alternating Log Time by First Order Functional Programs
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
A Characterization of NC k by First Order Functional Programs
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Resource Analysis by Sup-interpretation
Functional and Logic Programming | 2007-05-02 | Paper |
