Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Should your specification language be typed | ACM Transactions on Programming Languages and Systems |
| 21 | 1999 |
Categorical models for local names | 1996 | |||
Mobile ambients | Theoretical Computer Science |
| 2000 | |
Elementary structures in process theory (1): Sets with renaming | 2000 | |||
A Calculus for Cryptographic Protocols: The Spi Calculus | Information and Computation |
| 171 | 1999 |
Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
The reflective higher-order calculus: Encodability, typability and separation | Information and Computation |
| 2024 | |
When privacy fails, a formula describes an attack: A complete and compositional verification method for the applied π-calculus | Theoretical Computer Science |
| 2023 | |
Locally Nameless Sets | Proceedings of the ACM on Programming Languages |
| 2 | 2023 |
Nominal Sets in Agda - A Fresh and Immature Mechanization | Electronic Proceedings in Theoretical Computer Science |
| 2023 | |
A Formalized Extension of the Substitution Lemma in Coq | Electronic Proceedings in Theoretical Computer Science |
| 2023 |