Publications 2022

  1. L. Aceto, A. Achilleos, D. P. Attard, L. Exibard, A. Francalanza, A. Ingólfsdóttir. A monitoring tool for linear-time μHML.
    In M. H. ter Beek, M. Sirjani, eds., Coordination Models and Languages: 24th IFIP WG 6.1 Int. Conf., COORDINATION 2022 (Lucca, June 2022), Proc., v. 13271 of Lect. Notes in Comput. Sci., pp. 200-219. Springer, 2022.
    doi:10.1007/978-3-031-08143-9_12
  2. L. Aceto, A. Achilleos, E. Anastasiadi, A. Francalanza. Monitoring hyperproperties with circuits.
    In M. R. Mousavi, A. Philippou, eds., Formal Techniques for Distributed Objects, Components, and Systems: 42nd IFIP WG 6.1 Int. Conf., FORTE 2022 (Lucca, June 2022), Proc., v. 13273 of Lect. Notes in Comput. Sci., pp. 1-10. Springer, 2022.
    doi:10.1007/978-3-031-08679-3_1
  3. L. Aceto, A. Achilleos, E. Anastasiadi, A. Francalanza, A. Ingólfsdóttir. Complexity through translations for modal logic with recursion.
    In P. Ganty, D. Della Monica, eds., Proc. of 13th Int. Symp. on Games, Automata, Logics and Formal Verification, GandALF 2022 (Madrid, Sept. 2022), v. 370 of Electron. Proc. in Theor. Comput. Sci., pp. 34-48. Open Publishing Assoc., 2022.
    doi:10.4204/eptcs.370.3
  4. L. Aceto, A. Achilleos, E. Anastasiadi, A. Francalanza, A. Ingólfsdóttir, K. Lehtinen, M. R. Pedersen. On probabilistic monitorability.
    In J.-F. Raskin, K. Chatterjee, L. Doyen, R. Majumdar, eds., Principles of Systems Design: Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday, v. 13660 of Lect. Notes in Comput. Sci., pp. 325-342. Springer, 2022.
    doi:10.1007/978-3-031-22337-2_16
  5. L. Aceto, A. Achilleos, E. Anastasiadi, A. Ingólfsdóttir. Axiomatizing recursion-free, regular monitors.
    J. Log. Algebr. Methods Program., v. 127, art. 100778, 32 pp., 2022.
    doi:10.1016/j.jlamp.2022.100778
  6. L. Aceto, E. Anastasiadi, V. Castiglioni, A. Ingólfsdóttir. Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction.
    In N. Jansen, M. Stoelinga, P. van den Bos, eds., A Journey from Process Algebra via Timed Automata to Model Learning: Essays Dedicated to Frits Vaandrager on the Occasion of His 60th Birthday, v. 13560 of Lect. Notes in Comput. Sci. pp. 1-26. Springer, 2022.
    doi:10.1007/978-3-031-15629-8_1
  7. L. Aceto, V. Castiglioni, W. Fokkink, A. Ingólfsdóttir, B. Luttik. Are two binary operators necessary to obtain a finite axiomatisation of parallel composition?
    ACM Trans. Comput. Log., v. 23, n. 4, art. 22, 56 pp., 2022.
    doi:10.1145/3529535
  8. L. Aceto, V. Castiglioni, A. Ingólfsdóttir, B. Luttik. On the axiomatisation of branching bisimulation congruence over CCS.
    In B. Klin, S. Lasota, A. Muscholl, eds., 33rd Int. Conf. on Concurrency Theory, CONCUR 2022 (Warsaw, Sept. 2022), v. 243 of Leibniz Int. Proc. in Inform., pp. 6:1-6:18. Dagstuhl Publishing, 2022.
    doi:10.4230/lipics.concur.2022.6
  9. L. Aceto, V. Castiglioni, A. Ingólfsdóttir, B. Luttik, M. R. Pedersen. On the axiomatisability of parallel composition.
    Log. Methods Comput. Sci., v. 18, n. 1, art. 15, 51 pp., 2022.
    doi:10.46298/lmcs-18(1:15)2022
  10. L. Aceto, P. Crescenzi. CONCUR through time.
    Bull. EATCS, v. 138, 9 pp., 2022.
    article
  11. L. Aceto, O. Kupferman, M. Randour, D. Sangiorgi. Interviews with the 2022 CONCUR test-of-time award recipients.
    Bull. EATCS, v. 138, 18 pp., 2022.
    article
  12. A. Achilleos, L. Exibard, A. Francalanza, K. Lehtinen, J. Xuereb. A synthesis tool for optimal monitors in a branching-time setting.
    In M. H. ter Beek, M. Sirjani, eds., Coordination Models and Languages: 24th IFIP WG 6.1 Int. Conf., COORDINATION 2022 (Lucca, June 2022), Proc., v. 13271 of Lect. Notes in Comput. Sci., pp. 181-199. Springer, 2022.
    doi:10.1007/978-3-031-08143-9_11
  13. D. Adamson. Ranking binary unlabelled necklaces in polynomial time.
    In Y.-S. Han, G. Vaszil, eds., Descriptional Complexity of Formal Systems: 24th IFIP WG 1.2 Int. Conf., DCFS 2022 (Debrecen, Aug. 2022), Proc., v. 13439 of Lect. Notes in Comput. Sci., pp. 15-29. Springer, 2022.
    doi:10.1007/978-3-031-13257-5_2
  14. D. Adamson, A. Deligkas, V. V. Gusev, I. Potapov. The complexity of periodic energy minimisation.
    In S. Szeider, R. Ganian, A. Silva, eds., 47th Int. Symp. on Mathematical Foundations of Computer Science, MFCS 2022 (Vienna, Aug. 2022), v. 241 of Leibniz Int. Proc. in Inform., pp. 8:1-8:15. Dagstuhl Publishing, 2022.
    doi:10.4230/lipics.mfcs.2022.8
  15. D. Adamson, V. V. Gusev, D. S. Malyshev, V. Zamaraev. Faster exploration of some temporal graphs.
    In J. Aspnes, O. Michail, eds., 1st Symp. on Algorithmic Foundations of Dynamic Networks, SAND 2022 (Virtual Conf., March 2022), v. 221 of Leibniz Int. Proc. in Inform., pp. 5:1-5:10, Dagstuhl Publishing, 2022.
    doi:10.4230/lipics.sand.2022.5
  16. M. Albert, B. Guðmundsson, H. Úlfarsson. Collatz meets Fibonacci.
    Math. Mag., v. 95, n. 2, pp. 130-136, 2022.
    doi:10.1080/0025570x.2022.2023307
  17. C. Bean, A. Bernini, M. Cervetti, L. S. Ferrari. On the generating functions of pattern-avoiding Motzkin paths.
    J. Symb. Comput., v. 113, pp. 126-138, 2022.
    doi:10.1016/j.jsc.2022.02.006
  18. C. Bean, É. Nadeau, J. Pantone, H. Úlfarsson. Using large random permutations to partition permutation classes.
    Pure Math. Appl., v. 30, v. 1, pp. 31-36, 2022.
    article
  19. A. R. Bendixen, B. B. Bojesen, H. Hüttel, S. Lybech. A generic type system for higher-order Ψ-calculi.
    In V. Castiglioni, C. A. Mezzina, eds., Proc. of Combined 29th Int. Wksh. on Expressiveness in Concurrency and 19th Wksh. on Structural Operational Semantics, EXPRESS/SOS 2022 (Warsaw, Sept. 2022), v. 368 of Electron. Proc. in Theor. Comput. Sci., pp. 43-59. Open Publishing Assoc., 2022.
    doi:10.4204/eptcs.368.3
  20. V. Castiglioni, C. A. Mezzina, eds.
    Proc. of Combined 29th Int. Wksh. on Expressiveness in Concurrency and 19th Wksh. on Structural Operational Semantics, EXPRESS/SOS 2022 (Warsaw, Sept. 2022), v. 368 of Electron. Proc. in Theor. Comput. Sci., 150 pp. Open Publishing Assoc., 2022.
    doi:10.4204/eptcs.368
  21. L. Exibard, E. Filiot, A. Khalimov. A generic solution to register-bounded synthesis with an application to discrete orders.
    In M. Bojanczyk, E. Merelli, D. P. Woodruff, eds., 49th Int. Coll. on Automata, Languages, and Programming, ICALP 2022 (Paris, July 2022), v. 229 of Leibniz Int. Proc. in Inform., pp. 122:1-122:19. Dagstuhl Publishing, 2022.
    doi:10.4230/lipics.icalp.2022.122
  22. M. M. Halldórsson, T. Ishii, K. Makino, K. Takazawa. Posimodular function optimization.
    Algorithmica, v. 84, n. 4, pp. 1107-1131, 2022.
    doi:10.1007/s00453-021-00910-y
  23. M. M. Halldórsson, F. Kuhn, A. Nolin, T. Tonoyan. Near-optimal distributed degree+1 coloring.
    In S. Leonardi, A. Gupta, eds., STOC '22: Proc. of 54th Ann. ACM SIGACT Symp. on Theory of Computing (Rome, June 2022), pp. 450-463. ACM, 2022.
    doi:10.1145/3519935.3520023
  24. M. M. Halldórsson, Y. Maus, A. Nolin. Fast distributed vertex splitting with applications.
    In C. Scheideler, ed., 36th Int. Symp. on Distributed Computing, DISC 2022 (Augusta, GA, Oct. 2022), v. 246 of Leibniz Int. Proc. in Inform., pp. 26:1-26:24. Dagstuhl Publishing, 2022.
    doi:10.4230/lipics.disc.2022.26
  25. M. M. Halldórsson, A. Nolin, T. Tonoyan. Overcoming congestion in distributed coloring.
    In A. Milani, P. Woelfel, eds., PODC '22: Proc. of 2022 ACM Symp. on Principles of Distributed Computing (Salerno, July 2022), pp. 26-36. ACM, 2022.
    doi:10.1145/3519270.3538438
  26. S. Katsumata, D. McDermott, T. Uustalu, N. Wu. Flexible presentations of graded monads.
    Proc. ACM Program. Lang., v. 6, n. ICFP, art. 123, 29 pp., 2022.
    doi:10.1145/3547654
  27. S. Lybech. Encodability and separation for a reflective higher-order calculus.
    In V. Castiglioni, C. A. Mezzina, eds., Proc. of Combined 29th Int. Wksh. on Expressiveness in Concurrency and 19th Wksh. on Structural Operational Semantics, EXPRESS/SOS 2022 (Warsaw, Sept. 2022), v. 368 of Electron. Proc. in Theor. Comput. Sci., pp. 95-112. Open Publishing Assoc., 2022.
    doi:10.4204/eptcs.368.6
  28. D. McDermott, Y. Morita, T. Uustalu. A type system with subtyping for WebAssembly's stack polymorphism.
    In H. Seidl, Z. Liu, C. S. Pasareanu, eds., Theoretical Aspects of Computing, 19th Int. Coll., ICTAC 2022 (Tbilisi, Sept. 2022), Proc., v. 13572 of Lect. Notes in Comput. Sci., pp. 305-323. Springer, 2022.
    doi:10.1007/978-3-031-17715-6_20
  29. D. McDermott, A. Mycroft. Galois connecting call-by-value and call-by-name.
    In A. Felty, ed., 7th Int. Conf. on Formal Structures for Computation and Deduction, FSCD 2022 (Haifa, Aug. 2022), v. 228 of Leibniz Int. Proc. in Inform., pp. 32:1-32:19. Dagstuhl Publishing, 2022.
    doi:10.4230/lipics.fscd.2022.32
  30. D. McDermott, E. Rivas, T. Uustalu. Sweedler theory of monads.
    In P. Bouyer, L. Schröder, eds., Foundations of Software Science and Computation Structures: 25th Int. Conf., FoSSaCS 2022 (Munich, Apr. 2022), Proc., v. 13242 of Lect. Notes in Comput. Sci., pp. 428-448. Springer, 2022.
    doi:10.1007/978-3-030-99253-8_22
  31. D. McDermott, T. Uustalu. Flexibly graded monads and graded algebras.
    In E. Komendantskaya, ed., Mathematics of Program Construction: 14th Int. Conf., MPC 2022 (Tbilisi, Sept. 2022), Proc., v. 13544 of Lect. Notes in Comput. Sci., pp. 102-128. Springer, 2022.
    doi:10.1007/978-3-031-16912-0_4
  32. D. McDermott, T. Uustalu. What makes a strong monad?
    In J. Gibbons, M. S. New, eds., Proc. of 9th Wksh. on Mathematically Structured Functional Programming, MSFP 2022 (Munich, Apr. 2022), v. 360 of Electron Proc. in Theor. Comput. Sci., pp. 113-133. Open Publishing Assoc., 2022.
    doi:10.4204/eptcs.360.6

Publications 2021

Publications 2020

Publications 2019

Publications 2018

Publications 2017

Last update 5 May 2024