Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 8
Number of items: 8
  • Open Access
    ten Cate, B., & Kappé, T. (2025). Algebras for Deterministic Computation Are Inherently Incomplete. Proceedings of the ACM on Programming Languages, 9(POPL), 718-744. Article 25. https://doi.org/10.1145/3704861
  • Open Access
    Kappé, T. (2023). Completeness and the Finite Model Property for Kleene Algebra, Reconsidered. In R. Glück, L. Santocanale, & M. Winter (Eds.), Relational and Algebraic Methods in Computer Science (RAMiCS) 2023: 20th International Conference, RAMiCS 2023, Augsburg, Germany, April 3–6, 2023 : proceedings (pp. 158-175). (Lecture Notes in Computer Science; Vol. 13896). Springer. https://doi.org/10.48550/arXiv.2212.10931, https://doi.org/10.1007/978-3-031-28083-2_10
  • Open Access
    Mohan, A., Liu, Y., Foster, N., Kappé, T., & Kozen, D. (2023). Formal Abstractions for Packet Scheduling. Proceedings of the ACM on Programming Languages, 7(OOPSLA2), Article 269. https://doi.org/10.48550/arXiv.2211.11659, https://doi.org/10.1145/3622845
  • Open Access
    Schmid, T., Kappé, T., & Silva, A. (2023). A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests. In T. Wies (Ed.), Programming Languages and Systems: 32nd European Symposium on Programming, ESOP 2023, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22–27, 2023 : proceedings (pp. 309-226). (Lecture Notes in Computer Science; Vol. 13990). Springer. https://doi.org/10.48550/arXiv.2301.11301, https://doi.org/10.1007/978-3-031-30044-8_12
  • Open Access
    Różowski, W., Kappé, T., Kozen, D., Schmid, T., & Silva, A. (2023). Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity. In K. Etessami, U. Feige, & G. Puppis (Eds.), 50th International Colloquium on Automata, Languages, and Programming: ICALP 2023, July 10-14, 2023, Paderborn, Germany Article 136 (Leibniz International Proceedings in Informatics; Vol. 261). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.136, https://doi.org/10.48550/arXiv.2305.01755
  • Open Access
    van Heerdt, G., Kappé, T., Rot, J., Sammartino, M., & Silva, A. (2022). A Categorical Framework for Learning Generalised Tree Automata. In H. H. Hansen, & F. Zanasi (Eds.), Coalgebraic Methods in Computer Science: 16th IFIP WG 1.3 International Workshop, CMCS 2022, colocated with ETAPS 2022, Munich, Germany, April 2-3, 2022 : proceedings (pp. 67-87). (Lecture Notes in Computer Science; Vol. 13225). Springer. https://doi.org/10.1007/978-3-031-10736-8_4
  • Open Access
    Doenges, R., Kappé, T., Sarracino, J., Foster, N., & Morrisett, G. (2022). Leapfrog: certified equivalence for protocol parsers. In R. Jhala, & I. Dillig (Eds.), PLDI '22: proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation : June 13-17, 2022, San DIego, CA, USA (pp. 950-965). Association for Computing Machinery. https://doi.org/10.48550/arXiv.2205.08762, https://doi.org/10.1145/3519939.3523715
  • Open Access
    Wagemaker, J., Foster, N., Kappé, T., Kozen, D., Rot, J., & Silva, A. (2022). Concurrent NetKAT: Modeling and analyzing stateful, concurrent networks. In I. Sergey (Ed.), Programming Languages and Systems : 31st European Symposium on Programming, ESOP 2022, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022 : proceedings (pp. 575-602). (Lecture Notes in Computer Science; Vol. 13240), (Advanced Research in Computing and Software Science). Springer. https://doi.org/10.48550/arXiv.2201.10485, https://doi.org/10.1007/978-3-030-99336-82_1
Page of