Research

Publications

Compositional systems and methods group

2020

• N. Behr, P. Sobociński. Rule algebras for adhesive categories. Log. Methods Comput. Sci., v. 16, n. 3, art. 2, 38 pp., 2020. doi:10.23638/lmcs-16(3:2)2020 (WOS: 000562627000002, Scopus: 2-s2.0-85088393358)
• F. Bonchi, R. Piedeleu, P. Sobociński, F. Zanasi. Contextual equivalence for signal flow graphs. In J. Goubault-Larrecq, B. König, eds., Proc. of 23rd Int. Conf. on Foundations of Software Science and Computation Structures, FoSSaCS 2020 (Dublin, Apr. 2020), v. 12077 of Lect. Notes in Comput. Sci., pp. 77-96. Springer, 2020. doi:10.1007/978-3-030-45231-5_5 (WOS: 000719283800005, Scopus: 2-s2.0-85084115850)
• N. Haydon, P. Sobociński. Compositional diagrammatic first-order logic. In A.-V. Pietarinen, P. Chapman, L. Bosveld-de Smet, V. Giardino, J. Corter, S. Linker, eds., Proc. of 11th Int. Conf. on Diagrammatic Representation and Inference, Diagrams 2020 (Tallinn, Aug. 2020), v. 12169 of Lect. Notes in Comput. Sci., pp. 402-418. Springer, 2020. doi:10.1007/978-3-030-54249-8_32 (WOS: 000711951500032, Scopus: 2-s2.0-85090039526)
• J. Paixão, P. Sobociński. Calculational proofs in relational graphical linear algebra. In C. Carvalho, V. Stolz, eds., Proc. of 23rd Brazilian Symp. on Formal Methods, SBMF 2020 (Ouro Preto, Nov. 2020), v. 12475 of Lect. Notes in Comput. Sci., pp. 83-100. Springer, 2020. doi:10.1007/978-3-030-63882-5_6 (Scopus: 2-s2.0-85097299136)
• A.-V. Pietarinen, F. Bellucci, A. Bobrova, N. Haydon, M. Shafiel. The blot. In A.-V. Pietarinen, P. Chapman, L. Bosveld-de Smet, V. Giardino, J. Corter, S. Linker, eds., Proc. of 11th Int. Conf. on Diagrammatic Representation and Inference, Diagrams 2020 (Tallinn, Aug. 2020), v. 12169 of Lect. Notes in Comput. Sci., pp. 225-238. Springer, 2020. doi:10.1007/978-3-030-54249-8_18 (WOS: 000711951500018, Scopus: 2-s2.0-85090036559)

2021

• F. Bonchi, A. Di Giorgio, P. Sobociński. Diagrammatic polyhedral algebra. In M. Bojanczyk, C. Chekuri, eds., Proc. of 41st Ann. Conf. on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021 (Virtual Event, Dec. 2021), v. 213 of Leibniz Int. Proc. in Inform, art. 40, 18 pp. Dagstuhl Publishing, 2021. doi:10.4230/lipics.fsttcs.2021.40 (Scopus: 2-s2.0-85122436640)
• F. Bonchi, R. Piedeleu, P. Sobociński, F. Zanasi. Bialgebraic foundations for the operational semantics of string diagrams. Inf. Comput., v. 281, art. 104767, 22 pp., 2021. doi:10.1016/j.ic.2021.104767 (WOS: 000721215200017, Scopus: 2-s2.0-85109004037)
• F. Bonchi, A. Santamaria, J. Seeber, P. Sobociński. On doctrines and Cartesian bicategories. In F. Gadducci, A. Silva, eds., Proc. of 9th Conf. on Algebra and Coalgebra in Computer Science, CALCO 2021 (Salzburg, Aug./Sept. 2021), v. 211 of Leibniz Int. Proc. in Inform., art. 10, 17 pp. Dagstuhl Publishing, 2021. doi:10.4230/lipics.calco.2021.10 (Scopus: 2-s2.0-85120633403)
• F. Bonchi, P. Sobociński, F. Zanasi. A survey of compositional signal flow theory. In M. Goedicke, E. Neuhold, K. Rannenberg, eds., Advancing Research in Information and Communication Technology: IFIP's Exciting First 60 Years, v. 600 of IFIP Advances in Information and Communication Technology, pp. 29-56. Springer, 2021. doi:10.1007/978-3-030-81701-5_2 (Scopus: 2-s2.0-85112539110)
• G. de Felice, E. Di Lavore, M. Román, A. Tuomi. Functorial languages game for question answering. In D. I. Spivak, J. Vicary, eds., Proc. of 3rd Int. Ann. Applied Category Theory Conf., ACT 2020 (Cambridge, MA, July 2020), v. 333 of Electron. Proc. in Theor. Comput. Sci., pp. 311-321. Open Publishing Assoc., 2021. doi:10.4204/eptcs.333.21 (WOS, Scopus: 2-s2.0-85101219248)
• E. Di Lavore, A.Gianola, M. Román, N. Sabadini, P. Sobociński. A canonical algebra of open transition systems. In G. Salaün, A. Wijs, eds., Proc. of 17th Int. Symp. on Formal Aspects of Component Software, FACS 2021 (Virtual Event, Oct. 2021), v. 13077 of Lect. Notes in Comput. Sci., pp. 63-81. Springer, 2021. doi:10.1007/978-3-030-90636-8_4 (Scopus: 2-s2.0-85119830813)
• E. Di Lavore, J. Hedges, P. Sobociński. Compositional modelling of network games. In C. Baier, J. Goubault-Larrecq, eds., Proc. of 29th EACSL Ann. Conf. on Computer Science Logic, CSL 2021 (Ljubljana, Jan. 2021), v. 183 of Leibniz Int. Proc. in Informatics, art. 30, 24 pp.. Dagstuhl Publishing, 2021. doi:10.4230/lipics.csl.2021.30 (Scopus: 2-s2.0-85100912099)
• I. Di Liberti, F. Loregian, C. Nester, P. Sobociński. Functorial semantics for partial theories. Proc. ACM Program. Lang., v. 5, n. POPL, art. 57, 28 pp., 2021. doi:10.1145/3434338 (WOS: 000679806100057, Scopus: 2-s2.0-85099012661)
• F. Genovese, J. Herold, F. Loregian, D. Palombi. A categorical semantics for hierarchical Petri nets. In B. Hoffmann, M. Minas, eds., Proc. of 12th Int. Wksh. on Graph Computation Models, GCM 2021 (Bergen, June 2021), v. 350 of Electron. Proc. in Theor. Comput. Sci., pp. 51-68. Open Publishing Assoc., 2021. doi:10.4204/eptcs.350.4 (WOS, Scopus: 2-s2.0-85122281759)
• F. Genovese, F. Loregian, D. Palombi. Nets with mana: a framework for chemical reaction modelling. In F. Gadducci, T. Kehrer, eds., Proc. of 14th Int. Conf. on Graph Transformation, ICGT 2021 (Bergen, June 2021), v. 12741 of Lect. Notes in Comput. Sci., pp. 185-202. Springer, 2021. doi:10.1007/978-3-030-78946-6_10 (Scopus: 2-s2.0-85111456907)
• N. Haydon, A.-V. Pietarinen. Residuation in Peirce's existential graphs. In A. Basu, G. Stapleton, S. Linker, C. Legg, E. Manalo, P. Viana, eds., Proc. of 12th Int. Conf. on Diagrammatic Representation and Inference, Diagrams 2021 (Virtual Event, Sept. 2021), v. 12909 of Lect. Notes in Comput. Sci., pp. 229-237. Springer, 2021. doi:10.1007/978-3-030-86062-2 (WOS: 000711901600021, Scopus: 2-s2.0-85115852693)
• A. Hadzihasanovic. The smash product of monoidal theories. In Proc. of 36th Ann. ACM/IEEE Symp. on Logic in Computer Science, LICS 2021 (Rome, July 2021), 13 pp. IEEE, 2021. doi:10.1109/lics52264.2021.9470575 (Scopus: 2-s2.0-85113822334)
• F. Loregian. (Co)end calculus, v. 468 of London Math. Soc. Lect. Note Ser., xxii+308 pp. Cambridge Univ. Press, 2021. doi:10.1017/9781108778657 (Scopus)
• C. Nester. A foundation for ledger structures. In Proc. of 2nd Conf. on Blockchain Economics, Security and Protocols, Tokenomics 2020 (Toulouse, Oct. 2020), v. 82 of OpenAccess Series in Informatics, art. 7, 13 pp. Dagstuhl Publishing, 2021. doi:10.4230/oasics.tokenomics.2020.7 (Scopus: 2-s2.0-85108064020)
• C. Nester. A variety theorem for relational universal algebra. In U. Fahrenberg, M. Gehrke, L. Santocanale, M. Winter, eds., Proc. of 19th Int. Conf. on Relational and Algebraic Methods in Computer Science, RAMICS 2021 (Marseille, Nov. 2021), v. 13027 of Lect. Notes in Comput. Sci., pp. 362-377. Springer, 2021. doi:10.1007/978-3-030-88701-8_22 (WOS: 000719390400022, Scopus: 2-s2.0-85118955509)
• C. Nester. The structure of concurrent process histories. In F. Damiani, O. Dardha, eds., Proc. of 23rd IFIP WG 6.1 Int. Conf. on Coordination Models and Languages, COORDINATION 2021 (Valletta, June 2021), v. 12717 of Lect. Notes in Comput. Sci., pp. 209-224. Springer, 2021. doi10.1007/978-3-030-78142-2_13 (Best paper award!) (Scopus: 2-s2.0-85111367635)
• M. Román. Open diagrams via coend calculus. In D. I. Spivak, J. Vicary, eds., Proc. of 3rd Int. Ann. Applied Category Theory Conf., ACT 2020 (Cambridge, MA, July 2020), v. 333 of Electron. Proc. in Theor. Comput. Sci., pp. 65-78. Open Publishing Assoc., 2021. doi:10.4204/eptcs.333.5 (WOS, Scopus: 2-s2.0-85101207257)

2022

• G. Boisseau, P. Sobociński. String diagrammatic electrical circuit theory. In K. Kishida, ed., Proc. of 4th Int. Ann. Applied Category Theory Conf., ACT 2021 (Cambridge, July 2021), Electron. Proc. in Theor. Comput. Sci., Open Publishing Assoc., to appear. article on publisher's website (WOS, Scopus)
• F. Bonchi, F. Gadducci, A. Kissinger, P. Sobociński, F. Zanasi. String diagram rewrite theory I: rewriting with Frobenius structure. J. ACM, v. 69, n. 2, article 14, 58 pp., 2022. doi:10.1145/3502719 (WOS: 000774368700006, Scopus: 2-s2.0-85127614327)
• E. Di Lavore, G. de Felice, M. Román. Monoidal streams for dataflow programming. In Proc. of 37th Ann. ACM/IEEE Symp. on Logic in Computer Science, LICS '22 (Haifa, Aug. 2022), ACM, to appear. (WOS, Scopus)
• F. Genovese, F. Loregian, D. Palombi. A categorical semantics for bounded Petri nets. In K. Kishida, ed., Proc. of 4th Int. Ann. Applied Category Theory Conf., ACT 2021 (Cambridge, July 2021), Electron. Proc. in Theor. Comput. Sci., Open Publishing Assoc., to appear. article on publisher's website (WOS, Scopus)
• F. Loregian, T. de Oliveira Santos. Coends of higher arity. Appl. Categ. Struct., v. 30, n. 1, pp. 173-221, 2022. doi10.1007/s10485-021-09653-x: (WOS: 000691204400001, Scopus: 2-s2.0-85113852400)
• C. Nester. Situated transition systems. In K. Kishida, ed., Proc. of 4th Int. Ann. Applied Category Theory Conf., ACT 2021 (Cambridge, July 2021), Electron. Proc. in Theor. Comput. Sci., Open Publishing Assoc., to appear. article on publisher's website (WOS, Scopus)
• J. Paixão, L. Rufino, P. Sobociński. High-level axioms for graphical linear algebra. Sci. Comput. Program., v. 218, art. 102791, 26 pp., 2022. doi:10.1016/j.scico.2022.102791 (WOS, Scopus: 2-s2.0-85126314085)

High-assurance software lab

2019

• A. Buldas, D. Firsov, R. Laanoja, H. Lakk, A. Truu. A new approach to constructing digital signature schemes. In N. Attrapadung, T. Yagi, eds., Proc. of 14th Int. Wksh. on Security, IWSEC 2019 (Tokyo, Aug. 2019), v. 11689 of Lect. Notes in Comput. Sci., pp. 363-373. Springer, 2019. doi:10.1007/978-3-030-26834-3_21 (WOS: 000612998800021, Scopus: 2-s2.0-85071436047)

2020

• D. Firsov, A. Buldas, A. Truu, R. Laanoja. Verified security of BLT signature scheme. In Proc. of 9th ACM SIGPLAN Int. Conf. on Certified Programs and Proofs, CPP 2020 (New Orleans, LA, Jan. 2020), pp. 244-257. ACM Press, 2020. doi:10.1145/3372885.3373828 (WOS: 000620147900020, Scopus: 2-s2.0-85079442346)
• B. Mannaa, R. E. Møgelberg, N. Veltri. Ticking clocks as dependent right adjoints: Denotational semantics for clocked type theory. Log. Methods Comput. Sci., v. 16, n. 4, art. 17, 31 pp., 2020. doi:10.23638/lmcs-16(4:17)2020 (WOS: 000605983500019, Scopus: 2-s2.0-85101631804)
• T. Uustalu, N. Veltri, N. Zeilberger. Eilenberg-Kelly reloaded. Electron. Notes Theor. Comput. Sci., v. 352, pp. 233-256, 2020. doi:10.1016/j.entcs.2020.09.012 (WOS: 000582228200012, Scopus: 2-s2.0-85101225913)
• T. Uustalu, N. Voorneveld. Algebraic and coalgebraic perspectives on interaction laws. In B. C. d. S. Oliveira, ed., Proc. of 18th Asian Symp. on Programming Languages and Systems, APLAS 2020 (Fukuoka, Nov./Dec. 2020), v. 12470 of Lect. Notes in Comput. Sci., pp. 186-205. Springer, 2020. doi:10.1007/978-3-030-64437-6_10 (Scopus: 2-s2.0-85097654344)
• N. Veltri, A. Vezzosi. Formalizing pi-calculus in guarded cubical Agda. In Proc. of 9th ACM SIGPLAN Int. Conf. on Certified Programs and Proofs, CPP 2020 (New Orleans, LA, Jan. 2020), pp. 270-283. ACM Press, 2020. doi:10.1145/3372885.3373814 (WOS: 000620147900022, Scopus: 2-s2.0-85079443514)
• N. Voorneveld. Combining algebraic effect descriptions using the tensor of complete lattices. Electron. Notes Theor. Comput. Sci., v. 352, pp. 257-281, 2020. doi:10.1016/j.entcs.2020.09.013 (WOS: 000582228200013, Scopus: 2-s2.0-85114396355)
• N. Voorneveld. From equations to distinctions: two interpretations of effectful computations. In M. S. New, S. Lindley, eds., Proc. of 8th Wksh. on Mathematically Structured Functional Programming, MSFP 2020 (Dublin, Apr. 2020), v. 317 of Electron. Proc. in Theor. Comput. Sci., pp. 1-17. Open Publ. Assoc., 2020. doi:10.4204/eptcs.317.1 (WOS, Scopus: 2-s2.0-85085695615)

2021

• D. Firsov, H. Lakk, S. Laur, A. Truu. BLT+L: efficient signatures from timestamping and endorsements. In S. De Capitani di Vimercati, P. Samarati, eds., Proc. of 18th Int. Conf. on Security and Cryptography, SECRYPT 2021 (Milan, July 2021), pp. 75-86. SciTePress, 2021. doi: 10.5220/0010530000750086 (Scopus: 2-s2.0-85111808694)
• D. Firsov, H. Lakk, A. Truu. Verified multiple-time signature scheme from one-time signatures and timestamping. In Proc. of 34th IEEE Computer Security Foundations Symp., CSF 2021 (Dubrovnik, June 2021), pp. 653-665. IEEE, 2021. doi:10.1109/csf51468.2021.00051 (Scopus: 2-s2.0-85124030778)
• T. Uustalu, N. Veltri, N. Zeilberger. Deductive systems and coherence for skew prounital closed categories. In C. Sacerdoti Coen, A. Tiu, eds., Proc. of 15th Int. Wksh. on Logical Frameworks and Metalanguages: Theory and Practice, LFMTP 2020 (Paris, June 2020), v. 332 of Electron. Proc. in Theor. Comput. Sci., pp. 35-53. Open Publishing Assoc., 2021. doi:10.4204/eptcs.332.3 (WOS, Scopus: 2-s2.0-85101209607)
• T. Uustalu, N. Veltri, N. Zeilberger. Proof theory of partially normal skew monoidal categories. In D. I. Spivak, J. Vicary, eds., Proc. of 3rd Int. Ann. Applied Category Theory Conf., ACT 2020 (Cambridge, MA, July 2020), v. 333 of Electron. Proc. in Theor. Comput. Sci., pp. 230-246. Open Publishing Assoc., 2021. doi:10.4204/eptcs.333.16 (WOS, Scopus: 2-s2.0-85101268643)
• T. Uustalu, N. Veltri, N. Zeilberger. The sequent calculus of skew monoidal categories. In C. Casadio, P. J. Scott, eds., Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics, v. 20 of Outstanding Contributions to Logic, pp. 377-406. Springer, 2021. doi:10.1007/978-3-030-66545-6_11 (Scopus: 2-s2.0-85103071845)
• N. Veltri. Coherence via focusing for symmetric skew monoidal categories. In A. Silva, R. Wassermann, R. de Queiroz, eds., Proc. of 27th Int. Wksh. on Logic, Language, Information and Computation, WoLLIC 2021 (Virtual Event, Oct. 2021), v. 13038 of Lect. Notes in Comput. Sci., pp. 184-200. Springer, 2021. doi:10.1007/978-3-030-88853-4_12 (Scopus: 2-s2.0-85117482051)
• N. Veltri. Type-theoretic constructions of the final coalgebra of the finite powerset functor. In N. Kobayashi, ed., Proc. of 6th Int. Conf. on Formal Structures for Computation and Deduction, FSCD 2021 (Buenos Aires, July 2021), v. 195 of Leibniz Int. Proc. in Inform., art. 22, 18 pp. Dagstuhl Publishing, 2021 doi:10.4230/lipics.fscd.2021.22 (Scopus: 2-s2.0-85115213929)
• N. Veltri, N. Benton, S. Ghilezan, eds. Proc. of 23rd Int. Symp. on Principles and Practice of Declarative Programming, PPDP '21 (Tallinn, Sept. 2021), ACM Int. Conf. Proc. Series, vi pp.+23 articles. ACM Press, 2021. doi:10.1145/3479394 (Scopus: 2-s2.0-85117737338)
• N. Veltri, N. van der Weide. Constructing higher inductive types as groupoid quotients. Log. Methods Comput. Sci., v. 16, n. 2, art. 8, 42 pp., 2021. doi:10.23638/lmcs-17(2:8)2021 (WOS:000658731000009, Scopus: 2-s2.0-85105276320)
• N. Veltri, N. Voorneveld. Inductive and coinductive predicate liftings for effectful programs. In A. Sokolova, ed., Proc. of 37th Conf. on Mathematical Foundations of Programming Semantics, MFPS XXXVII (Salzburg, Aug./Sept. 2021), v. 351 of Electron. Proc. in Theor. Comput. Sci., pp. 260-277. Open Publishing Assoc., 2021. doi:10.4204/eptcs.351.16 (WOS, Scopus: 2-s2.0-85122280172)

2022

• B. Ahrens, D. Frumin, M. Maggesi, N. Veltri, N. van der Weide. Bicategories in Univalent Foundations. Math. Struct. Comput. Sci., to appear. doi:10.1017/s0960129522000032 (WOS: 000767071800001, Scopus: 2-s2.0-85126564877)
• D. Firsov, D. Unruh. Reflection, rewinding and coin-toss in Easycrypt. In Proc. of 11th ACM SIGPLAN Int. Conf. on Certified Programs and Proofs, CPP '22 (Philadelphia, PA, Jan. 2022), pp. 166-179. ACM Press, 2022. doi:10.1145/3497775.3503693 (Scopus: 2-s2.0-85124031830)
• T. Uustalu, N. Veltri, C.-S. Wan. Proof theory of skew non-commutative MILL. In A. Indrzejczak, M. Zawidzki, eds., Proc. of 10th Int. Conf. on Non-classical Logics: Theory and Applications, NCL '22 (Łódź, March 2022), v. 358 of Electron. Proc. in Theor. Comput. Sci., pp. 118-135. Open Publishing Assoc., 2022. doi:10.4204/eptcs.358.9 (WOS, Scopus)
• N. Veltri. Normalization by evaluation for the Lambek calculus. In A. Indrzejczak, M. Zawidzki, eds., Proc. of 10th Int. Conf. on Non-classical Logics: Theory and Applications, NCL '22 (Łódź, March 2022), v. 358 of Electron. Proc. in Theor. Comput. Sci., pp. 102-117. Open Publishing Assoc., 2022. doi:10.4204/eptcs.358.8 (WOS, Scopus)
• N. Voorneveld. Runners for concurrent effectful programs. In A. Felty, ed., Proc. of 7th Int. Conf. on Formal Structures for Computation and Deduction, FSCD 2022 (Haifa, Aug. 2022), Leibniz Int. Proc. in Inform., Dagstuhl Publishing, to appear. (Scopus)

Patents

• D. Firsov (inventor), Guardtime (assignee). One-time data signature system and method with untrusted server assistance. USPTO, prelim. application US 2019 62/802,462 P, 7 Feb. 2019, application 16/784,561, 7 Feb. 2020; application published US 2020/0259663 A1, 13 Aug. 2020.
• A. Truu, D. Firsov (inventors), Guardtime (assignee). Delegated signatures for smart devices. USPTO, prelim. application US 2019 62/875,371 P, 17 July 2019; application 16/932,613, 17 July 2020; application published US 2021/0021429 A1, 21 Jan. 2021.

Additional competitive funding won

• Paweł Sobociński, proposer and PI, ETAG team grant PRG1210, Automata in learning, interaction and concurrency, Jan. 2021-Dec. 2025, 476 kEUR for the first two years out of five (expected total grant 1190 kEUR)
• Niccolò Veltri, proposer and PI, ETAG starting grant PSG659, Towards final coalgebras of accessible functors in type theory, Jan.-Dec. 2021, 60 kEUR
  (one out of the only 6 new ETAG starting grants in 2021 in all of physical, life and earth sciences, the only one in math and CS)
• Niccolò Veltri, secondary proposer and MC member for Estonia, EU COST action CA20111 European research network on formal proofs, EuroProofNet, 11 Oct. 2021-10 Oct. 2025, expected total grant to the whole action ~500 kEUR
• Amar Hadzihasanovic, proposer and PI, ETAG starting grant PSG764, Rewriting in directed homotopy theory, Jan. 2022-Dec. 2025, 60 kEUR for the first year out of four (expected total grant 241 kEUR)
• Niccolò Veltri, proposer and PI, ETAG starting grant PSG749, Towards final coalgebras of accessible functors in type theory, Jan. 2022-Dec. 2025, 60 kEUR for the first year out of four (expected total grant 241 kEUR)

Research seminars

• Elena Di Lavore, organizer, TallCat seminar, from Nov. 2019 to spring 2021
• Diana Kessler, organizer, TallCat seminar, autumn 2021
• Amar Hadzihasanovic, organizer, TallCat seminar, from spring 2022
• Niccolò Veltri, organizer, TSEM, from Nov. 2019, incl. UNESCO World Logic Day '21 in Tallinn, 14 Jan. 2021
• Niccolò Veltri, co-organizer, UNESCO World Logic Day '22 in Tallinn, 14 Jan. 2022

Seminars/reading groups

• Chu construction, autumn 2020
• Functorial semantics, spring 2020
• Categorical automata theory, spring 2021

Internal meetings of the groups

• Compositionality group seminar at Paunküla, 22-24 Nov. 2019
• Compositionality group seminar at Lake Peipsi, 7-9 Feb. 2020
• Logic and semantics group seminar at Pillapalu, 9-11 Sept. 2021 (not paid by the measure)
• Compositionality group seminar at Narva-Jõesuu, 8-10 Oct. 2021
• Logic and semantics group seminar at Änkküla, 14-16 Nov. 2021 (not paid by the measure)
• Compositionality group seminar at Uuri, 20-21 Nov. 2021
• Compositionality group seminar at Sõrve, 11-13 Apr. 2022

Research visits

• Renato Neves (U. do Minho), visit to TUT, 23-29 Sept. 2018
• Pierre Guillon (Institut Poncelet), visit to TUT, 11-16 Nov. 2018
• Georg Struth, Simon Doherty (U. of Sheffield), visit to TUT, 17-22 Dec. 2018
• Nicolas Behr (IRIF), visit to TUT, Nov. 2019
• João Paixão (U. Federal do Rio de Janeiro), visit to TUT, Jan. 2020 (not paid by the measure)
• Niels Voorneveld, visit to U. of Ljubljana, 20-31 Jan. 2020
• Chad Nester, visit to U. of Edinburgh, 4-10 Feb. 2020
• Eigil Rischel (U. of Copenhagen), visit to TUT, Feb. 2020 (not paid by the measure)
• Fabio Zanasi (UCL), visit to TUT, Feb. 2020
• Bram Westerbaan (Radboud U.), visit to TUT, Feb. 2020
• Niccolò Veltri, visit to Reykjavik U., 16-21 Feb. 2020
• Niels Voorneveld, visit to Reykjavik U., 10-17 March 2020 (cut shorter to 15 March due to Covid)
• Giovanni de Felice (U. of Oxford), visit to TUT, 6-13 Sept. 2021
• Dylan McDermott (Reykjavik U.), visit to TUT, 30 Aug.-13 Sept. 2021 (not paid by the measure)
• Niels Voorneveld, visit to Reykjavik U., 29 Oct.-12 Nov. 2021 (not paid by the measure)
• Guillaume Boisseau (U. of Oxford), visit to TUT, 6-18 Dec. 2021
• Martti Karvonen (U. of Ottawa), visit to TUT, 13 Dec. 2021-5 Jan. 2022
• Dylan McDermott (Reykjavik U.), visit to TUT, 12-20 Dec. 2021 (not paid by the measure)
• Maaike Zwart (ITU Copenhagen), visit to TUT, 7-20 March 2022
• Davide Castelnovo (U. di Udine), research stay at TUT, 22 Jan.-28 May 2022

Organization of symposia at TUT

• Amar Hadzihasanovic, organizer, SYCO-8, 13-14 Dec. 2021
• Paweł Sobociński, organizer, SYCO-7, 30-31 March 2020 (cancelled because of Covid)
• Paweł Sobociński, organizer, MFCS 2021, 23-27 Aug. 2021
• Paweł Sobociński, organizer, ICALP/LICS 2024, summer 2024
• Niccolò Veltri, organizer, PPDP/LOPSTR 2021, 6-8 Sept. 2021

PC work

• Elena Di Lavore, co-organizer, Adjoint School 2022, Glasgow, 11-15 July 2022
• Elena Di Lavore, PC member, ACT 2022
• Amar Hadzihasanovic, PC member, SYCO-8, MFPS XXXVIII
• Nathan Haydon, PC member, Diagrams '22 (Philosophy track)
• Fosco Loregian, PC member, ACT 2022
• Paweł Sobociński, PC co-chair, STRING '20, Bergen, 23 June 2020 (cancelled because of Covid)
• Paweł Sobociński, co-organizer, OWLS seminars, online, from Apr. 2020 to Dec. 2021
• Paweł Sobociński, PC member, TMPA '19, SYCO-6, SEMSPACE '20, ICGT '20, TTCS '20, SYCO-7, QPL '20, LICS '20, SEMSPACE '21, Diagrams '21, CONCUR '21, SYCO-8, FoSSaCS '22, CSL '22, Diagrams '22, CONCUR '22, FoSSaCS '23
• Paweł Sobociński, SC member, SYCO, from autumn 2018
• Niccolò Veltri, PC member, TYPES '21, NWPT '21, ICFP '22
• Niccolò Veltri, AEC member, ICFP '19, ICFP '20, ICFP '21
• Niccolò Veltri, SC member, PPDP, since 2021

Editorial work

• Paweł Sobociński, associate editor, Math. Struct. in Comput. Sci., Compositionality

Research-related distinctions

• Niccolò Veltri, TUT School of IT 2020 researcher of the year (one out of five), 2021
• Niccolò Veltri, President of Estonia's 2022 young IT scientist award
• Fosco Loregian, TUT School of IT 2021 researcher of the year (one out of five), 2022