Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publikacje
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 i Lorenzo ClementeFilip Murlak (red.), 200 Problems in Formal Languages and Automata Theory, Uniwersytet Warszawski, Warszawa 2017.zobacz w PBN
- Joshua Moerman, Matteo Sammartino, Alexandra Silva, Bartosz Klin i Michał Szynwelski, Learning nominal automata, w: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017, ACM, 2017, s. 613–625.zobacz w PBN
- Bartosz Klin i Beata Nachyła, Some undecidable properties of SOS specifications, Journal Of Logical And Algebraic Methods In Programming 87 2017, s. 94–109.zobacz w PBN
- Bartosz Klin i Mateusz Łełyk, Modal mu-Calculus with Atoms, w: 26th EACSL Annual Conference on Computer Science Logic (CSL 2017), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2017, r. 30, s. 1–12.zobacz w PBN
- Nathanael Fijalkow, Bartosz Klin i Prakash Panangaden, Expressiveness of Probabilistic Modal Logics, Revisited, w: 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, s. 1–12.zobacz w PBN
2016
- Bartosz Klin i Michał Szynwelski, SMT Solving for Functional Programming over Infinite Structures, w: Proceedings 6th Workshop on Mathematically Structured Functional Programming, 2016, s. 57–75.zobacz w PBN
- Bartosz Klin, Sławomir Lasota, Joanna Ochremiak i Szymon Toruńczyk, Homomorphism Problems for First-Order Definable Structures, w: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016), 2016, r. 14, s. 14:1–14:15.zobacz w PBN
- Bartosz Klin i Jurriaan Rot, Coalgebraic trace semantics via forgetful logics, Logical Methods In Computer Science 12 (4) 2016, s. 1–34.zobacz w PBN
2015
- Bartosz Klin, Eryk Kopczyński, Joanna Ochremiak i Szymon Toruńczyk, Locally Finite Constraint Satisfaction Problems, w: 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, IEEE, 2015, s. 475–486.zobacz w PBN
- Bartek Klin i Jurriaan Rot, Coalgebraic trace semantics via forgetful logics, w: Foundations of Software Science and Computation Structures 18th International Conference, FOSSACS 2015, Springer, 2015, s. 151–166.zobacz w PBN
- Bartek Klin i Beata Nachyła, Presenting Morphisms of Distributive Laws, w: 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), 2015, s. 190–204.zobacz w PBN
2014
- Mikołaj Bojańczyk, Bartosz Klin i Sławomir Lasota, Automata theory in nominal sets, Logical Methods In Computer Science 10 (3:4) 2014.zobacz w PBN
- Bartosz Klin, Sławomir Lasota, Joanna Ochremiak i Szymon Toruńczyk, Turing Machines with Atoms, Constraint Satisfaction Problems, and Descriptive Complexity, w: 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.zobacz w PBN
- Bartosz Klin i Beata Nachyła, Distributive Laws and Decidable Properties of SOS Specifications, w: 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, s. 79–93.zobacz w PBN
2011
- Bartosz Klin, Bialgebras for structural operational semantics: an introduction, Theoretical Computer Science 412 (38) 2011, s. 5043–5069.zobacz w PBN
- H. Hansen i Bartosz Klin, Pointwise extensions of GSOS-defined operations, Mathematical Structures In Computer Science 21 (2) 2011, s. 321–361.zobacz w PBN
- Mikołaj Bojańczyk, Bartosz Klin i Sławomir Lasota, Automata with group actions, w: Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011), IEEE Computer Society, Toronto 2011.zobacz w PBN
- Andrea Corradini, Bartosz Klin i Corina Cirstea (red.), Proceedings of the 4th International Conference on Algebra and Coalgebra in Computer Science (CALCO 2011), Springer, Berlin 2011.zobacz w PBN
2005
- Lutz Schroeder, Till Mossakowski, Andrzej Tarlecki, Piotr Hoffman i Bartosz Klin, Amalgamation in the semantics of CASL, Theoretical Computer Science 331 (1) 2005, s. 215–247.zobacz w PBN
- Bartosz Klin, From bialgebraic semantics to congruence formats, Electronic Notes In Theoretical Computer Science 128 (1) 2005, s. 3–37.zobacz w PBN
- Bartosz Klin, The least fibred lifting and the expressivity of coalgebraic modal logic, Lecture Notes In Computer Science 3629 2005, s. 247–262.zobacz w PBN
- Bartosz Klin, Vladimiro Sassone i Pawel Sobocinski, Labels from reductions, towards a general theory, Lecture Notes In Computer Science 3629 2005, s. 30–50.zobacz w PBN
Nie jesteś zalogowany | zaloguj się
