Publication | Date of Publication | Type |
---|
Operations on records | 2023-04-12 | Paper |
A delegation-based object calculus with subtyping | 2022-12-09 | Paper |
On abstraction and the expressive power of programming languages | 2022-08-16 | Paper |
An extension of system F with subtyping | 2022-08-16 | Paper |
Operations on records | 2022-08-16 | Paper |
Automated analysis of cryptographic assumptions in generic group models | 2019-06-20 | Paper |
Connecting formal semantics to constructive intuitions | 2017-11-17 | Paper |
Flexible dynamic information flow control in the presence of exceptions | 2017-10-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q2965516 | 2017-03-03 | Paper |
Secure protocol composition | 2016-05-03 | Paper |
Automated Analysis of Cryptographic Assumptions in Generic Group Models | 2014-08-07 | Paper |
Addressing covert termination and timing channels in concurrent information flow systems | 2014-07-21 | Paper |
Protocol Composition Logic (PCL) | 2013-12-06 | Paper |
A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols | 2013-04-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q2911606 | 2012-08-31 | Paper |
Using Strategy Objectives for Network Security Analysis | 2010-11-23 | Paper |
CONCUR 2003 - Concurrency Theory | 2010-03-30 | Paper |
On the relationships between notions of simulation-based security | 2009-06-08 | Paper |
Beyond proof-of-compliance: security analysis in trust management | 2008-12-21 | Paper |
Inductive Proofs of Computational Secrecy | 2008-08-21 | Paper |
Foundations of Software Science and Computation Structures | 2007-09-28 | Paper |
Theory of Cryptography | 2007-02-12 | Paper |
Compositional analysis of contract-signing protocols | 2007-01-09 | Paper |
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols | 2006-04-28 | Paper |
Automata, Languages and Programming | 2006-01-10 | Paper |
Theory of Cryptography | 2005-12-07 | Paper |
Contract signing, optimism, and advantage | 2005-08-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4818833 | 2004-09-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q4808734 | 2004-08-12 | Paper |
A type system for the Java bytecode language and verifier | 2003-09-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4418564 | 2003-08-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4418589 | 2003-08-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4415096 | 2003-07-28 | Paper |
Concepts in Programming Languages | 2003-06-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4536296 | 2002-11-28 | Paper |
Parametricity and variants of Girard's \(J\) operator | 2002-07-25 | Paper |
Finite-state analysis of two contract signing protocols | 2002-07-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q4535056 | 2002-06-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q2763664 | 2002-01-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q2704326 | 2001-10-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q4934628 | 2000-10-03 | Paper |
Optimization complexity of linear logic proof games | 2000-08-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q4490764 | 2000-07-20 | Paper |
Type inference with simple subtypes | 2000-02-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4261073 | 1999-09-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q4222945 | 1999-01-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4222837 | 1998-12-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4385534 | 1998-05-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4364534 | 1997-11-17 | Paper |
Linear Logic Proof Games and Optimization | 1997-05-25 | Paper |
Standard ML-NJ weak polymorphism and imperative constructs | 1997-02-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q4322072 | 1996-06-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4855349 | 1996-04-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4842972 | 1996-01-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4855341 | 1995-11-09 | Paper |
On abstraction and the expressive power of programming languages | 1994-07-21 | 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/Q3142165 | 1993-12-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q4016557 | 1993-01-16 | Paper |
Decision problems for propositional linear logic | 1992-09-27 | Paper |
Kripke-style models for typed lambda calculus | 1991-01-01 | Paper |
Operations on records | 1991-01-01 | Paper |
The semantics of second-order lambda calculus | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3827990 | 1989-01-01 | Paper |
Polymorphic type inference and containment | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3680264 | 1985-01-01 | Paper |
On the sequential nature of unification | 1984-01-01 | Paper |
Termination assertions for recursive programs: Completeness and axiomatic definability | 1983-01-01 | Paper |
The implication problem for functional and inclusion dependencies | 1983-01-01 | Paper |