Published in: LIPIcs, Volume 288, 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)
Maribel Fernández, Jean Goubault-Larrecq, and Delia Kesner. The Ackermann Award 2023. In 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 288, pp. 1:1-1:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{fernandez_et_al:LIPIcs.CSL.2024.1, author = {Fern\'{a}ndez, Maribel and Goubault-Larrecq, Jean and Kesner, Delia}, title = {{The Ackermann Award 2023}}, booktitle = {32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)}, pages = {1:1--1:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-310-2}, ISSN = {1868-8969}, year = {2024}, volume = {288}, editor = {Murano, Aniello and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.1}, URN = {urn:nbn:de:0030-drops-196446}, doi = {10.4230/LIPIcs.CSL.2024.1}, annote = {Keywords: lambda-calculus, computational complexity, geometry of interaction, abstract machines, intersection types} }
Published in: LIPIcs, Volume 260, 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023)
Maribel Fernández. Nominal Techniques for Software Specification and Verification (Invited Talk). In 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 260, pp. 1:1-1:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{fernandez:LIPIcs.FSCD.2023.1, author = {Fern\'{a}ndez, Maribel}, title = {{Nominal Techniques for Software Specification and Verification}}, booktitle = {8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023)}, pages = {1:1--1:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-277-8}, ISSN = {1868-8969}, year = {2023}, volume = {260}, editor = {Gaboardi, Marco and van Raamsdonk, Femke}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2023.1}, URN = {urn:nbn:de:0030-drops-179855}, doi = {10.4230/LIPIcs.FSCD.2023.1}, annote = {Keywords: Binding operator, Nominal Logic, Nominal Rewriting, Unification, Equational Theories, Type Systems} }
Published in: LIPIcs, Volume 228, 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022)
Mauricio Ayala-Rincón, Maribel Fernández, Gabriel Ferreira Silva, and Daniele Nantes Sobrinho. A Certified Algorithm for AC-Unification. In 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 228, pp. 8:1-8:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ayalarincon_et_al:LIPIcs.FSCD.2022.8, author = {Ayala-Rinc\'{o}n, Mauricio and Fern\'{a}ndez, Maribel and Silva, Gabriel Ferreira and Sobrinho, Daniele Nantes}, title = {{A Certified Algorithm for AC-Unification}}, booktitle = {7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022)}, pages = {8:1--8:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-233-4}, ISSN = {1868-8969}, year = {2022}, volume = {228}, editor = {Felty, Amy P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2022.8}, URN = {urn:nbn:de:0030-drops-162894}, doi = {10.4230/LIPIcs.FSCD.2022.8}, annote = {Keywords: AC-Unification, PVS, Certified Algorithms, Formal Methods, Interactive Theorem Proving} }
Published in: LIPIcs, Volume 152, 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@Proceedings{fernandez_et_al:LIPIcs.CSL.2020, title = {{LIPIcs, Volume 152, CSL'20, Complete Volume}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020}, URN = {urn:nbn:de:0030-drops-117841}, doi = {10.4230/LIPIcs.CSL.2020}, annote = {Keywords: Theory of computation, Logic} }
Published in: LIPIcs, Volume 152, 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 0:i-0:xviii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{fernandez_et_al:LIPIcs.CSL.2020.0, author = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {0:i--0:xviii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.0}, URN = {urn:nbn:de:0030-drops-116431}, doi = {10.4230/LIPIcs.CSL.2020.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Published in: LIPIcs, Volume 152, 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
Véronique Cortier. Verification of Security Protocols (Invited Talk). In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 1:1-1:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cortier:LIPIcs.CSL.2020.1, author = {Cortier, V\'{e}ronique}, title = {{Verification of Security Protocols}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {1:1--1:2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.1}, URN = {urn:nbn:de:0030-drops-116447}, doi = {10.4230/LIPIcs.CSL.2020.1}, annote = {Keywords: Security protocols, automated deduction, security} }
Published in: LIPIcs, Volume 152, 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
Anuj Dawar. Symmetric Computation (Invited Talk). In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 2:1-2:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{dawar:LIPIcs.CSL.2020.2, author = {Dawar, Anuj}, title = {{Symmetric Computation}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {2:1--2:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.2}, URN = {urn:nbn:de:0030-drops-116455}, doi = {10.4230/LIPIcs.CSL.2020.2}, annote = {Keywords: Descriptive Complexity, Fixed-point Logic with Counting, Circuit Complexity, Linear Programming, Hardness of Approximation, Arithmetic Circuits} }
Published in: LIPIcs, Volume 152, 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
Artur Jeż. Solving Word Equations (And Other Unification Problems) by Recompression (Invited Talk). In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 3:1-3:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{jez:LIPIcs.CSL.2020.3, author = {Je\.{z}, Artur}, title = {{Solving Word Equations (And Other Unification Problems) by Recompression}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {3:1--3:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.3}, URN = {urn:nbn:de:0030-drops-116468}, doi = {10.4230/LIPIcs.CSL.2020.3}, annote = {Keywords: word equation, context unification, equations in groups, compression} }
Published in: LIPIcs, Volume 152, 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
Delia Kesner, Eduardo Bonelli, and Andrés Viso. Strong Bisimulation for Control Operators (Invited Talk). In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 4:1-4:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kesner_et_al:LIPIcs.CSL.2020.4, author = {Kesner, Delia and Bonelli, Eduardo and Viso, Andr\'{e}s}, title = {{Strong Bisimulation for Control Operators}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {4:1--4:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.4}, URN = {urn:nbn:de:0030-drops-116473}, doi = {10.4230/LIPIcs.CSL.2020.4}, annote = {Keywords: Lambda-mu calculus, proof-nets, strong bisimulation} }
Published in: LIPIcs, Volume 152, 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
Iddo Tzameret. From Classical Proof Theory to P versus NP: a Guide to Bounded Theories (Invited Talk). In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 5:1-5:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{tzameret:LIPIcs.CSL.2020.5, author = {Tzameret, Iddo}, title = {{From Classical Proof Theory to P versus NP: a Guide to Bounded Theories}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {5:1--5:2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.5}, URN = {urn:nbn:de:0030-drops-116482}, doi = {10.4230/LIPIcs.CSL.2020.5}, annote = {Keywords: Bounded arithmetic, complexity class separations, circuit complexity, proof complexity, weak theories of arithmetic, feasible mathematics} }
Published in: LIPIcs, Volume 152, 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
Matteo Acclavio and Roberto Maieli. Generalized Connectives for Multiplicative Linear Logic. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 6:1-6:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{acclavio_et_al:LIPIcs.CSL.2020.6, author = {Acclavio, Matteo and Maieli, Roberto}, title = {{Generalized Connectives for Multiplicative Linear Logic}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {6:1--6:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.6}, URN = {urn:nbn:de:0030-drops-116490}, doi = {10.4230/LIPIcs.CSL.2020.6}, annote = {Keywords: Linear Logic, Partitions Sets, Proof Nets, Sequent Calculus} }
Published in: LIPIcs, Volume 152, 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
Jiří Adámek. On Free Completely Iterative Algebras. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 7:1-7:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{adamek:LIPIcs.CSL.2020.7, author = {Ad\'{a}mek, Ji\v{r}{\'\i}}, title = {{On Free Completely Iterative Algebras}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {7:1--7:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.7}, URN = {urn:nbn:de:0030-drops-116503}, doi = {10.4230/LIPIcs.CSL.2020.7}, annote = {Keywords: free algebra, completely iterative algebra, terminal coalgebra, initial algebra, finitary functor} }
Published in: LIPIcs, Volume 152, 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
Dana Angluin, Timos Antonopoulos, and Dana Fisman. Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 8:1-8:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{angluin_et_al:LIPIcs.CSL.2020.8, author = {Angluin, Dana and Antonopoulos, Timos and Fisman, Dana}, title = {{Strongly Unambiguous B\"{u}chi Automata Are Polynomially Predictable With Membership Queries}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {8:1--8:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.8}, URN = {urn:nbn:de:0030-drops-116519}, doi = {10.4230/LIPIcs.CSL.2020.8}, annote = {Keywords: Polynomially predictable languages, Automata learning, Strongly unambiguous B\"{u}chi automata, Automata succinctness, Regular \omega-languages, Grammatical inference} }
Published in: LIPIcs, Volume 152, 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, and Filip Mazowiecki. A Robust Class of Linear Recurrence Sequences. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{barloy_et_al:LIPIcs.CSL.2020.9, author = {Barloy, Corentin and Fijalkow, Nathana\"{e}l and Lhote, Nathan and Mazowiecki, Filip}, title = {{A Robust Class of Linear Recurrence Sequences}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {9:1--9:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.9}, URN = {urn:nbn:de:0030-drops-116521}, doi = {10.4230/LIPIcs.CSL.2020.9}, annote = {Keywords: linear recurrence sequences, weighted automata, cost-register automata} }
Published in: LIPIcs, Volume 152, 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
Gili Bielous and Orna Kupferman. Coverage and Vacuity in Network Formation Games. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 10:1-10:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bielous_et_al:LIPIcs.CSL.2020.10, author = {Bielous, Gili and Kupferman, Orna}, title = {{Coverage and Vacuity in Network Formation Games}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {10:1--10:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.10}, URN = {urn:nbn:de:0030-drops-116532}, doi = {10.4230/LIPIcs.CSL.2020.10}, annote = {Keywords: Network Formation Games, Vacuity, Coverage} }
Feedback for Dagstuhl Publishing