Logic, Language, Information, and Computation: 29th International Workshop, WoLLIC 2023, Halifax, NS, Canada, July 11-14, 2023, Proceedings von Hansen, Helle Hvid, Scedrov, Andre, de Queiroz, Ruy J. G. B

Volltext

Automated Analysis of Cryptographic Assumptions in Generic Group Models von Barthe, Gilles, Fagerholm, Edvard, Fiore, Dario, Mitchell, John, Scedrov, Andre, Schmidt, Benedikt

Volltext

A Multiset Rewriting Model for Specifying and Verifying Timing Aspects of Security Protocols von Alturki, Musab A., Ban Kirigin, Tajana, Kanovich, Max, Nigam, Vivek, Scedrov, Andre, Talcott, Carolyn

Volltext

Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds von Barthe, Gilles, Fagerholm, Edvard, Fiore, Dario, Scedrov, Andre, Schmidt, Benedikt, Tibouchi, Mehdi

Volltext

Automated Analysis of Cryptographic Assumptions in Generic Group Models von Barthe, Gilles, Fagerholm, Edvard, Fiore, Dario, Mitchell, John, Scedrov, Andre, Schmidt, Benedikt

Volltext

A rewriting framework and logic for activities subject to regulations von KANOVICH, MAX, BAN KIRIGIN, TAJANA, NIGAM, VIVEK, SCEDROV, ANDRE, TALCOTT, CAROLYN, PEROVIC, RANKO

Volltext

Soundness of Formal Encryption in the Presence of Key-Cycles von Adão, Pedro, Bana, Gergei, Herzog, Jonathan, Scedrov, Andre

Volltext

Discrete vs. Dense Times in the Analysis of Cyber-Physical Security Protocols von Kanovich, Max, Kirigin, Tajana Ban, Nigam, Vivek, Scedrov, Andre, Talcott, Carolyn

Volltext

Software Security -- Theories and Systems: Mext-NSF-JSPS International Symposium, ISSS 2002, Tokyo, Japan, November 8-10, 2002, Revised Papers von Okada, Mitsuhiro, Pierce, Benjamin, Scedrov, Andre, Tokuda, Hideyuki, Yonezawa, Akinori

Volltext

A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols von Mitchell, John C., Ramanathan, Ajith, Scedrov, Andre, Teague, Vanessa

Volltext

Language models for some extensions of the Lambek calculus von Kanovich, Max, Kuznetsov, Stepan, Scedrov, Andre

Volltext

Relating state-based and process-based concurrency through linear logic (full-version) von Cervesato, Iliano, Scedrov, Andre

Volltext

Reconciling Lambek’s restriction, cut-elimination and substitution in the presence of exponential modalities von Kanovich, Max, Kuznetsov, Stepan, Scedrov, Andre

Volltext

The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities von Kanovich, Max, Kuznetsov, Stepan, Scedrov, Andre

Volltext

Subexponentials in non-commutative linear logic von KANOVICH, MAX, KUZNETSOV, STEPAN, NIGAM, VIVEK, SCEDROV, ANDRE

Volltext

Soundness and completeness of formal encryption: The cases of key cycles and partial information leakage von Adão, Pedro, Bana, Gergei, Herzog, Jonathan, Scedrov, Andre

Volltext

Correction to: The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities von Kanovich, Max, Kuznetsov, Stepan, Scedrov, Andre

Volltext

Validity in Choice Logics: A Game-Theoretic Investigation von Freiman, Robert, Bernreiter, Michael

Volltext

Explorations in Subexponential Non-associative Non-commutative Linear Logic von Blaisdell, Eben, Kanovich, Max, Kuznetsov, Stepan L., Pimentel, Elaine, Scedrov, Andre

Volltext

Logic, Language, Information, and Computation: 29th International Workshop, WoLLIC 2023, Halifax, NS, Canada, July 11–14, 2023, Proceedings

Volltext