| Publication | Date of Publication | Type |
|---|
| Explorations in Subexponential Non-associative Non-commutative Linear Logic | 2024-03-14 | Paper |
| Undecidability of a newly proposed calculus for CatLog3 | 2024-02-06 | Paper |
| On the formalization and computational complexity of resilience problems for cyber-physical systems | 2023-07-28 | Paper |
| Explorations in Subexponential non-associative non-commutative Linear Logic (extended version) | 2023-07-06 | Paper |
| Bracket induction for Lambek calculus with bracket modalities | 2023-06-12 | Paper |
| Non-associative, non-commutative multi-modal linear logic | 2022-12-07 | Paper |
| Soft subexponentials and multiplexing | 2022-11-09 | Paper |
| An extension of system F with subtyping | 2022-08-16 | Paper |
| On the complexity of verification of time-sensitive distributed systems | 2022-07-13 | Paper |
| Language models for some extensions of the Lambek calculus | 2022-06-13 | Paper |
| Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos | 2022-03-09 | Paper |
| Soundness of Formal Encryption in the Presence of Key-Cycles | 2022-03-09 | Paper |
| The multiplicative-additive Lambek calculus with subexponential and bracket modalities | 2021-06-25 | Paper |
| Language Models for Some Extensions of the Lambek Calculus | 2020-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111913 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111318 | 2020-05-26 | Paper |
| Reconciling Lambek’s restriction, cut-elimination and substitution in the presence of exponential modalities | 2020-04-29 | Paper |
| The complexity of multiplicative-additive Lambek calculus: 25 years later | 2020-03-04 | Paper |
| L-models and R-models for Lambek calculus enriched with additives and the multiplicative unit | 2020-03-04 | Paper |
| A multiset rewriting model for specifying and verifying timing aspects of security protocols | 2020-03-03 | Paper |
| Subexponentials in non-commutative linear logic | 2019-10-09 | Paper |
| Automated analysis of cryptographic assumptions in generic group models | 2019-06-20 | Paper |
| A logical framework with commutative and non-commutative subexponentials | 2018-10-18 | Paper |
| Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems | 2018-02-16 | Paper |
| Undecidability of the Lambek calculus with subexponential and bracket modalities | 2017-11-22 | Paper |
| On Lambek’s Restriction in the Presence of Exponential Modalities | 2017-07-21 | Paper |
| A rewriting framework and logic for activities subject to regulations | 2017-04-03 | Paper |
| Undecidability of the Lambek Calculus with a Relevant Modality | 2016-12-01 | Paper |
| Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities | 2016-08-07 | Paper |
| Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds | 2015-08-27 | Paper |
| Bounded memory protocols | 2015-03-31 | Paper |
| Brief announcement | 2014-12-05 | Paper |
| Bounded memory Dolev-Yao adversaries in collaborative systems | 2014-10-20 | Paper |
| Automated Analysis of Cryptographic Assumptions in Generic Group Models | 2014-08-07 | Paper |
| Relating State-Based and Process-Based Concurrency through Linear Logic | 2013-05-03 | Paper |
| A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols | 2013-04-26 | Paper |
| Maintaining distributed logic programs incrementally | 2012-10-25 | Paper |
| Reduction-Based Formal Analysis of BGP Instances | 2012-06-29 | Paper |
| CONCUR 2003 - Concurrency Theory | 2010-03-30 | Paper |
| Relating state-based and process-based concurrency through linear logic (full-version) | 2009-10-09 | Paper |
| Breaking and fixing public-key Kerberos | 2008-04-16 | Paper |
| Foundations of Software Science and Computation Structures | 2007-09-28 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| Formal analysis of multiparty contract signing | 2007-01-30 | Paper |
| Formal analysis of Kerberos 5 | 2007-01-09 | Paper |
| A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols | 2006-04-28 | Paper |
| Contract signing, optimism, and advantage | 2005-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418589 | 2003-08-11 | Paper |
| Phase semantics for light linear logic | 2003-07-29 | Paper |
| Optimization complexity of linear logic proof games | 2000-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222893 | 1998-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222837 | 1998-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395614 | 1998-11-01 | Paper |
| Linear Logic Proof Games and Optimization | 1997-05-25 | Paper |
| Moez Alimohamed, 1967--1994 | 1997-02-28 | Paper |
| The undecidability of second order multiplicative linear logic | 1996-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4855339 | 1996-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4842972 | 1996-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4842540 | 1995-08-14 | Paper |
| First-order linear logic without modalities is NEXPTIME-hard | 1995-01-11 | Paper |
| An extension of system \(F\) with subtyping | 1994-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4283246 | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035310 | 1993-05-18 | Paper |
| Linearizing intuitionistic implication | 1993-05-16 | Paper |
| Complete topoi representing models of set theory | 1992-09-27 | Paper |
| Decision problems for propositional linear logic | 1992-09-27 | Paper |
| Bounded linear logic: A modular approach to polynomial-time computability | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010357 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3995720 | 1992-09-17 | Paper |
| Inheritance as implicit coercion | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4712651 | 1992-06-25 | Paper |
| Uniform proofs as a foundation for logic programming | 1991-01-01 | Paper |
| Functorial polymorphism | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3486543 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3035254 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3204024 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3204445 | 1989-01-01 | Paper |
| Freyd’s models for the independence of the axiom of choice | 1989-01-01 | Paper |
| Kleene computable functionals and the higher order existence property | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795831 | 1988-01-01 | Paper |
| Decompositions of finitely generated modules over C(X): sheaf semantics and a decision procedure | 1988-01-01 | Paper |
| Lindenbaum algebras of intuitionistic theories and free categories | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3816073 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3826551 | 1987-01-01 | Paper |
| Diagonalization of continuous matrices as a representation of intuitionistic reals | 1986-01-01 | Paper |
| Embedding sheaf models for set theory into Boolean-valued permutation models with an interior operator | 1986-01-01 | Paper |
| On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis | 1986-01-01 | Paper |
| Intuitionistically provable recursive well-orderings | 1986-01-01 | Paper |
| On the quantificational logic of intuitionistic set theory | 1986-01-01 | Paper |
| Some properties of epistemic set theory with collection | 1986-01-01 | Paper |
| Small decidable sheaves | 1986-01-01 | Paper |
| The lack of definable witnesses and provably recursive functions in intuitionistic set theories | 1985-01-01 | Paper |
| Arithmetic transfinite induction and recursive well-orderings | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686710 | 1985-01-01 | Paper |
| Corrigendum to ``Set existence property for intuitionistic theories with dependent choice | 1984-01-01 | Paper |
| Differential equations in constructive analysis and in the recursive realizability topos | 1984-01-01 | Paper |
| Large sets in intuitionistic set theory | 1984-01-01 | Paper |
| On some non-classical extensions of second-order intuitionistic propositional calculus | 1984-01-01 | Paper |
| Forcing and classifying topoi | 1984-01-01 | Paper |
| Church's thesis, continuity, and set theory | 1984-01-01 | Paper |
| Set existence property for intuitionistic theories with dependent choice | 1983-01-01 | Paper |
| Classifying topoi and finite forcing | 1983-01-01 | Paper |
| Boolean classifying topoi | 1983-01-01 | Paper |
| On a weakening of Markov's Principle | 1983-01-01 | Paper |
| The World's simplest axiom of choice fails | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3310619 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3310620 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912576 | 1981-01-01 | Paper |
