Publications 2019

  1. L. Aceto. Interview with Murdoch J. Gabbay and Andrew M. Pitts, 2019 Alonzo Church award recipients.
    Bull. EATCS, v. 128, 6 pp., 2019.
    article
  2. L. Aceto, A. Achilleos, A. Francalanza, A. Ingólfsdóttir, K. Lehtinen. Adventures in monitorability: from branching to linear time and back again.
    Proc. ACM Program. Lang., v. 3, n. POPL, pp. 52:1-52:29, 2019.
    doi:10.1145/3290365
  3. L. Aceto, A. Achilleos, A. Francalanza, A. Ingólfsdóttir, K. Lehtinen. An operational guide to monitorability.
    In P. C. Ölveczky, G. Salaün, eds., Software Engineering and Formal Methods: 17th Int. Conf., SEFM 2019 (Oslo, Sept. 2019), Proc., v. 11724 of Lect. Notes in Comput. Sci., pp. 433-453. Springer, 2019.
    doi:10.1007/978-3-030-30446-1_23
  4. L. Aceto, A. Achilleos, A. Francalanza, A. Ingólfsdóttir, K. Lehtinen. Testing equivalence vs. runtime monitoring.
    In M. Boreale, F. Corradini, M. Loreti, R. Pugliese, eds., Models, Languages, and Tools for Concurrent and Distributed Programming: Essays Dedicated to Rocco De Nicola on the Occasion of His 65th Birthday, v. 11665 of Lect. Notes in Comput. Sci., pp. 28-44. Springer, 2019.
    doi:10.1007/978-3-030-21485-2_4
  5. L. Aceto, A. Achilleos, A. Francalanza, A. Ingólfsdóttir, K. Lehtinen. The cost of monitoring alone.
    In E. Bartozzi, R. Cleaveland, R. Grosu, O. Sokolsky, eds., From Reactive Systems to Cyber-Physical Systems: Essays Dedicated to Scott A. Smolka on the Occasion of His 65th Birthday, v. 11500 of Lect. Notes in Comput. Sci., pp. 259-275. Springer, 2019.
    doi:10.1007/978-3-030-31514-6_15
  6. L. Aceto, E. Anastasiadi, V. Castiglioni, A. Ingólfsdóttir, M. R. Pedersen. On the axiomatizability of priority III: the return of sequential composition.
    In A. Cherubini, N. Sabadini, S. Tini, eds., Proc. of 20th Italian Conf. on Theoretical Computer Science, ICTCS 2019 (Como, Sept. 2019) v. 2504 of CEUR Wksh. Proc., pp. 145-157. CEUR-WS.org, 2019.
    article
  7. L. Aceto, I. Cassar, A. Francalanza, A. Ingólfsdóttir. Comparing controlled system synthesis and suppression enforcement.
    In B. Finkbeiner, L. Mariani, eds., Runtime Verification: 19th Int. Conf., RV 2019 (Porto, Oct. 2019), Proc., v. 11757 of Lect. Notes in Comput. Sci., pp. 148-164. Springer, 2019.
    doi:10.1007/978-3-030-32079-9_9
  8. L. Aceto, G. D'Angelo, M. Flammini, O. Inverso, L. Iovino, C. Trubiani. Building international doctoral schools in computer science in Italy, De Nicola's way.
    In M. Boreale, F. Corradini, M. Loreti, R. Pugliese, eds., Models, Languages, and Tools for Concurrent and Distributed Programming: Essays Dedicated to Rocco De Nicola on the Occasion of His 65th Birthday, v. 11665 of Lect. Notes in Comput. Sci., pp. 7-12. Springer, 2019.
    doi:10.1007/978-3-030-21485-2_2
  9. L. Aceto, D. Della Monica, I. Fábregas, A. Ingólfsdóttir. When are prime formulae characteristic?
    Theor. Comput. Sci., v. 777, pp. 3-31, 2019.
    doi:10.1016/j.tcs.2018.12.004
  10. L. Aceto, I. Fábregas, Á. García-Pérez, A. Ingólfsdóttir, Y. Ortega-Mallén. Rule formats for nominal process calculi.
    Log. Methods Comput. Sci., v. 15, n. 4, art. 2, 46 pp., 2019.
    doi:10.23638/lmcs-15(4:2)2019
  11. L. Aceto, I. Fábregas, C. Gregorio-Rodríguez, A. Ingólfsdóttir. Logical characterisations, rule formats and compositionality for input-output conformance simulation.
    J. Log. Algebr. Methods Program., v. 106, pp. 78-106, 2019.
    doi:10.1016/j.jlamp.2019.04.005
  12. L. Aceto, A. Ingólfsdóttir, guest eds.
    J. Log. Algebr. Methods Program., virtual special issue (special issue on 27th Nordic Workshop on Programming Theory, NWPT 2015, Reykjavik, Oct. 2015), preface + 5 articles, 2017-2019.
    volume
  13. D. Ahman, T. Uustalu. Decomposing comonad morphisms.
    In M. Roggenbach, A. Sokolova, eds., 8th Conf. on Algebra and Coalgebra in Computer Science, CALCO 2019 (London, June 2019), v. 139 of Leibniz Int. Proc. in Inform., pp. 14:1-14:19. Dagstuhl Publishing, 2019.
    doi:10.4230/lipics.calco.2019.14
  14. C. Bean, B. Guðmundsson, H. Úlfarsson. Automatic discovery of structural rules of permutation classes.
    Math. Comput., v. 88, n. 318, pp. 1967-1990, 2019.
    doi:10.1090/mcom/3386
  15. V. Castiglioni, R. Lanotte, S. Tini. Fully syntactic uniform continuity formats for bisimulation metrics.
    In M. S. Alvim, K. Chatzikokolakis, C. Olarte, F. Valencia, eds., The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy: Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday, v. 11760 of Lect. Notes in Comput. Sci., pp. 293-312. Springer, 2019.
    doi:10.1007/978-3-030-31175-9_17
  16. J. Chapman, T. Uustalu, N. Veltri. Quotienting the delay monad by weak bisimilarity.
    Math. Struct. Comput. Sci., v. 29, n. 1, pp. 67-92, 2019.
    doi:10.1017/s0960129517000184
  17. M. Dinitz, M. M. Halldórsson, T. Izumi, C. Newport. Distributed minimum degree spanning trees.
    In PODC '19: Proc. of 2019 ACM Symp. on Principles of Distributed Computing (Toronto, ON, July/Aug. 2019), pp. 511-520. ACM, 2019.
    doi:10.1145/3293611.3331604
  18. M. Dinitz, M. M. Halldórsson, C. Newport, A. Weaver. The capacity of smartphone peer-to-peer networks.
    In J. Suomela, ed., 33rd Int. Symp. on Distributed Computing, DISC 2019 (Budapest, Oct. 2019), v. of Leibniz Int. Proc. in Inform., pp. 14:1-14:17. Dagstuhl Publishing, 2019.
    doi:10.4230/lipics.disc.2019.14
  19. J. Espírito Santo, L. Pinto, T. Uustalu. Modal embeddings and calling paradigms.
    In H. Geuvers, ed., Proc. of 4th Int. Conf. on Formal Structures for Computation and Deduction, FSCD 2019 (Dortmund, June 2019), v. 131 of Leibniz Int. Proc. in Inform., pp. 18:1-18:20. Dagstuhl Publishing, 2019.
    doi:10.4230/lipics.fscd.2019.18
  20. M. M. Halldórsson, S. Köhler, D. Rawitz. Distributed approximation of k-service assignment.
    Distrib. Comput., v. 32, n. 1, pp. 27-40, 2019.
    doi:10.1007/s00446-017-0321-3
  21. M. M. Halldórsson, M. Santos de Lima. Query-competitive sorting with uncertainty.
    In P. Rossmanith, P. Heggernes, J.-P. Katoen, eds., 44th Int. Symp. on Mathematical Foundations of Computer Science, MFCS 2019 (Aachen, Aug. 2019), v. 138 of Leibniz Int. Proc. in Inform., pp. 7:1-7:15. Dagstuhl Publishing, 2019.
    doi:10.4230/lipics.mfcs.2019.7
  22. M. M. Halldórsson, T. Tonoyan. Plain SINR is enough!
    In PODC '19: Proc. of 2019 ACM Symp. on Principles of Distributed Computing (Toronto, ON, July/Aug. 2019), pp. 127-136. ACM, 2019.
    doi:10.1145/3293611.3331602
  23. M. M. Halldórsson, T. Tonoyan. Link scheduling under correlated shadowing.
    In 2019 Int. Symp. on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOPT 2019 (Avignon, June 2019), 8 pp. IEEE, 2019.
    doi:10.23919/wiopt7501.2019.9144134
  24. M. M. Halldórsson, Y. Wang, D. Yu. Leveraging multiple channels in ad hoc networks.
    Distrib. Comput., v. 32, n. 2, pp. 159-172, 2019.
    doi:10.1007/s00446-018-0329-3
  25. M. M. Halldórsson, R. Wattenhofer. Wireless network algorithmics.
    In B. Steffen, G. J. Woeginger, eds., Computing and Software Science: State of the Art and Perspectives, v. 10000 of Lect. Notes in Comput. Sci., pp. 141-160. Springer, 2019.
    doi:10.1007/978-3-319-91908-9_9
  26. B. J. Kristinsson, H. Úlfarsson. Occurrence graphs of patterns in permutations.
    Involve, v. 12, n. 6, pp. 901-918, 2019.
    doi:10.2140/involve.2019.12.901
  27. H. Maarand, T. Uustalu. Certified normalization of generalized traces.
    Innov. Syst. Softw. Engin., v. 15, n. 3-4, pp. 253-265, 2019.
    doi:10.1007/s11334-019-00347-1
  28. H. Maarand, T. Uustalu. Reordering derivatives of trace closures of regular languages.
    In W. Fokkink, R. van Glabbeek, eds., 30th Int. Conf. on Concurrency Theory, CONCUR 2019 (Amsterdam, Aug. 2019), v. 140 of Leibniz. Int. Proc. in Inform., pp. 40:1-40:16. Dagstuhl Publishing, 2019.
    doi:10.4230/lipics.concur.2019.40

Publications 2018

Publications 2017

Last update 29 July 2024