Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publications
Bartosz Klin
2017
- Mikołaj Bojańczyk, Wojciech Czerwiński, Piotr Hofman, Szczepan Hummel, Bartosz Klin, Eryk Kopczyński, Sławomir Lasota, Filip Aleksander Mazowiecki, Henryk Michalewski, Damian Niwiński, Joanna Ochremiak, Paweł Parys, Michał Pilipczuk, Wojciech Rytter, Michał Paweł Skrzypczak, Szymon Toruńczyk, Igor Walukiewicz, Joost Winter and Lorenzo ClementeFilip Murlak (ed.), 200 Problems in Formal Languages and Automata Theory, Uniwersytet Warszawski, Warszawa 2017.see in PBN
- Joshua Moerman, Matteo Sammartino, Alexandra Silva, Bartosz Klin and Michał Szynwelski, Learning nominal automata, in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017, ACM, 2017, p. 613–625.see in PBN
- Bartosz Klin and Beata Nachyła, Some undecidable properties of SOS specifications, Journal Of Logical And Algebraic Methods In Programming 87 2017, p. 94–109.see in PBN
- Bartosz Klin and Mateusz Łełyk, Modal mu-Calculus with Atoms, in: 26th EACSL Annual Conference on Computer Science Logic (CSL 2017), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2017, r. 30, p. 1–12.see in PBN
- Nathanael Fijalkow, Bartosz Klin and Prakash Panangaden, Expressiveness of Probabilistic Modal Logics, Revisited, in: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, r. 105, p. 1–12.see in PBN
2016
- Bartosz Klin and Michał Szynwelski, SMT Solving for Functional Programming over Infinite Structures, in: Proceedings 6th Workshop on Mathematically Structured Functional Programming, 2016, p. 57–75.see in PBN
- Bartosz Klin, Sławomir Lasota, Joanna Ochremiak and Szymon Toruńczyk, Homomorphism Problems for First-Order Definable Structures, in: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016), 2016, r. 14, p. 14:1–14:15.see in PBN
- Bartosz Klin and Jurriaan Rot, Coalgebraic trace semantics via forgetful logics, Logical Methods In Computer Science 12 (4) 2016, p. 1–34.see in PBN
2015
- Bartosz Klin, Eryk Kopczyński, Joanna Ochremiak and Szymon Toruńczyk, Locally Finite Constraint Satisfaction Problems, in: 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, IEEE, 2015, p. 475–486.see in PBN
- Bartek Klin and Jurriaan Rot, Coalgebraic trace semantics via forgetful logics, in: Foundations of Software Science and Computation Structures 18th International Conference, FOSSACS 2015, Springer, 2015, p. 151–166.see in PBN
- Bartek Klin and Beata Nachyła, Presenting Morphisms of Distributive Laws, in: 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), 2015, p. 190–204.see in PBN
2014
- Mikołaj Bojańczyk, Bartosz Klin and Sławomir Lasota, Automata theory in nominal sets, Logical Methods In Computer Science 10 (3:4) 2014.see in PBN
- Bartosz Klin, Sławomir Lasota, Joanna Ochremiak and Szymon Toruńczyk, Turing Machines with Atoms, Constraint Satisfaction Problems, and Descriptive Complexity, in: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014, 2014.see in PBN
- Bartosz Klin and Beata Nachyła, Distributive Laws and Decidable Properties of SOS Specifications, in: Proceedings Combined 21st International Workshop on Expressiveness in Concurrency and 11th Workshop on Structural Operational Semantics, EXPRESS 2014, and 11th Workshop on Structural Operational Semantics, SOS 2014, Rome, Italy, 1st September 2014., 2014, p. 79–93.see in PBN
2011
- Bartosz Klin, Bialgebras for structural operational semantics: an introduction, Theoretical Computer Science 412 (38) 2011, p. 5043–5069.see in PBN
- H. Hansen and Bartosz Klin, Pointwise extensions of GSOS-defined operations, Mathematical Structures In Computer Science 21 (2) 2011, p. 321–361.see in PBN
- Mikołaj Bojańczyk, Bartosz Klin and Sławomir Lasota, Automata with group actions, in: Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011), IEEE Computer Society, Toronto 2011.see in PBN
- Andrea Corradini, Bartosz Klin and Corina Cirstea (eds.), Proceedings of the 4th International Conference on Algebra and Coalgebra in Computer Science (CALCO 2011), Springer, Berlin 2011.see in PBN
2010
- Bartosz Klin and Paweł Sobociński (eds.), Proc. 6th Int. Workshop on Structural Operational Semantics, EPTCS, Australia 2010.see in PBN
- Bartosz Klin, Structural operational semantics and modal logic, revisited, in: CMCS, 2010.see in PBN
2005
- Lutz Schroeder, Till Mossakowski, Andrzej Tarlecki, Piotr Hoffman and Bartosz Klin, Amalgamation in the semantics of CASL, Theoretical Computer Science 331 (1) 2005, p. 215–247.see in PBN
- Bartosz Klin, From bialgebraic semantics to congruence formats, Electronic Notes In Theoretical Computer Science 128 (1) 2005, p. 3–37.see in PBN
- Bartosz Klin, The least fibred lifting and the expressivity of coalgebraic modal logic, Lecture Notes In Computer Science 3629 2005, p. 247–262.see in PBN
- Bartosz Klin, Vladimiro Sassone and Pawel Sobocinski, Labels from reductions, towards a general theory, Lecture Notes In Computer Science 3629 2005, p. 30–50.see in PBN
You are not logged in | log in
