Bartek Klin

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 29

Top Topics

Constraint Satisfaction

Picture Languages

Unordered Trees

Functional Programming

Top Venues

Log. Methods Comput. Sci.

Publications

Mikolaj Bojanczyk, Bartek Klin
Polyregular Functions on Unordered Trees of Bounded Height. Proc. ACM Program. Lang. 8 (POPL) (2024)
Mikolaj Bojanczyk, Bartek Klin
Polyregular functions on unordered trees of bounded height. CoRR (2023)
Jedrzej Kolodziejski, Bartek Klin
Countdown μ-calculus. CoRR (2022)
Yuichi Komorida, Shin-ya Katsumata, Nick Hu, Bartek Klin, Samuel Humeau, Clovis Eberhart, Ichiro Hasuo
Codensity Games for Bisimilarity. New Gener. Comput. 40 (2) (2022)
Mikolaj Bojanczyk, Bartek Klin, Julian Salamanca
Monadic Monadic Second Order Logic. CoRR (2022)
Jedrzej Kolodziejski, Bartek Klin
Countdown μ-Calculus. MFCS (2022)
Mikolaj Bojanczyk, Bartek Klin, Joshua Moerman
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata. CoRR (2021)
Bartek Klin, Slawomir Lasota, Szymon Torunczyk
Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages. FoSSaCS (2021)
Bartek Klin
μ-Calculi with Atoms (Invited Talk). CSL (2021)
Mikolaj Bojanczyk, Bartek Klin, Joshua Moerman
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata. LICS (2021)
Yuichi Komorida, Shin-ya Katsumata, Nick Hu, Bartek Klin, Ichiro Hasuo
Codensity Games for Bisimilarity. CoRR (2019)
Clovis Eberhart, Bartek Klin
History-Dependent Nominal μ-Calculus. LICS (2019)
Bartek Klin, Mateusz Lelyk
Scalar and Vectorial mu-calculus with Atoms. Log. Methods Comput. Sci. 15 (4) (2019)
Mikolaj Bojanczyk, Bartek Klin
A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra. Log. Methods Comput. Sci. 15 (4) (2019)
Khadijeh Keshvardoost, Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
Definable isomorphism problem. Log. Methods Comput. Sci. 15 (4) (2019)
Florence Clerc, Nathanaël Fijalkow, Bartek Klin, Prakash Panangaden
Expressiveness of probabilistic modal logics: A gradual approach. Inf. Comput. 267 (2019)
Yuichi Komorida, Shin-ya Katsumata, Nick Hu, Bartek Klin, Ichiro Hasuo
Codensity Games for Bisimilarity. LICS (2019)
Khadijeh Keshvardoost, Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
Definable isomorphism problem. CoRR (2018)
Bartek Klin, Julian Salamanca
Iterated Covariant Powerset is not a Monad. MFPS (2018)
Bartek Klin, Mateusz Lelyk
Scalar and Vectorial mu-calculus with Atoms. CoRR (2018)
Mikolaj Bojanczyk, Bartek Klin
A non-regular language of infinite trees that is recognizable by a finite algebra. CoRR (2018)
Nathanaël Fijalkow, Bartek Klin, Prakash Panangaden
Expressiveness of Probabilistic Modal Logics, Revisited. ICALP (2017)
Bartek Klin, Beata Nachyla
Some undecidable properties of SOS specifications. J. Log. Algebraic Methods Program. 87 (2017)
Joshua Moerman, Matteo Sammartino, Alexandra Silva, Bartek Klin, Michal Szynwelski
Learning nominal automata. POPL (2017)
Bartek Klin, Mateusz Lelyk
Modal mu-Calculus with Atoms. CSL (2017)
Bartek Klin, Jurriaan Rot
Coalgebraic trace semantics via forgetful logics. Log. Methods Comput. Sci. 12 (4) (2016)
Bartek Klin, Michal Szynwelski
SMT Solving for Functional Programming over Infinite Structures. MSFP (2016)
Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
Homomorphism Problems for First-Order Definable Structures. FSTTCS (2016)
Joshua Moerman, Matteo Sammartino, Alexandra Silva, Bartek Klin, Michal Szynwelski
Learning Nominal Automata. CoRR (2016)
Bartek Klin, Eryk Kopczynski, Joanna Ochremiak, Szymon Torunczyk
Locally Finite Constraint Satisfaction Problems. LICS (2015)
Bartek Klin, Beata Nachyla
Presenting Morphisms of Distributive Laws. CALCO (2015)
Bartek Klin, Jurriaan Rot
Coalgebraic Trace Semantics via Forgetful Logics. FoSSaCS (2015)
Bartek Klin, Beata Nachyla
Distributive Laws and Decidable Properties of SOS Specifications. EXPRESS/SOS (2014)
Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota
Automata theory in nominal sets. Log. Methods Comput. Sci. 10 (3) (2014)
Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
Turing machines with atoms, constraint satisfaction problems, and descriptive complexity. CSL-LICS (2014)
Mikolaj Bojanczyk, Bartek Klin, Alexander Kurz, Andrew M. Pitts
Nominal Computation Theory (Dagstuhl Seminar 13422). Dagstuhl Reports 3 (10) (2013)
Bartek Klin, Vladimiro Sassone
Structural operational semantics for stochastic and weighted transition systems. Inf. Comput. 227 (2013)
Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk
Turing Machines with Atoms. LICS (2013)
Filippo Bonchi, Sibylle B. Fröschle, Daniele Gorla, Bartek Klin
Preface to special issue: EXPRESS, ICE and SOS 2009. Math. Struct. Comput. Sci. 22 (2) (2012)
Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, Slawomir Lasota
Towards nominal computation. POPL (2012)
Helle Hvid Hansen, Bartek Klin
Pointwise extensions of GSOS-defined operations. Math. Struct. Comput. Sci. 21 (2) (2011)
Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota
Automata with Group Actions. LICS (2011)
Bartek Klin
Bialgebras for structural operational semantics: An introduction. Theor. Comput. Sci. 412 (38) (2011)
Bartek Klin
Structural Operational Semantics and Modal Logic, Revisited. CMCS (2010)
Bartek Klin
Bialgebraic methods and modal logic in structural operational semantics. Inf. Comput. 207 (2) (2009)
Matthew Hennessy, Bartek Klin
Preface. Electron. Notes Theor. Comput. Sci. 229 (4) (2009)
Bartek Klin
Structural Operational Semantics for Weighted Transition Systems. Semantics and Algebraic Specification (2009)
Bartek Klin, Vladimiro Sassone
Structural Operational Semantics for Stochastic Process Calculi. FoSSaCS (2008)
Bartek Klin
Coalgebraic Modal Logic Beyond Sets. MFPS (2007)
Bartek Klin
Bialgebraic Operational Semantics and Modal Logic. LICS (2007)
Bartek Klin
Bialgebraic Methods in Structural Operational Semantics: Invited Talk. Electron. Notes Theor. Comput. Sci. 175 (1) (2007)
Bartek Klin, Vladimiro Sassone, Pawel Sobocinski
Labels from Reductions: Towards a General Theory. CALCO (2005)
Lutz Schröder, Till Mossakowski, Andrzej Tarlecki, Bartek Klin, Piotr Hoffman
Amalgamation in the semantics of CASL. Theor. Comput. Sci. 331 (1) (2005)
Bartek Klin
From Bialgebraic Semantics to Congruence Formats. Electron. Notes Theor. Comput. Sci. 128 (1) (2005)
Bartek Klin
The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic. CALCO (2005)
Bartek Klin
Adding recursive constructs to bialgebraic semantics. J. Log. Algebraic Methods Program. (2004)
Bartek Klin
A Coalgebraic Approach to Process Equivalence and a Coinduction Principle for Traces. CMCS (2004)
Bartek Klin, Pawel Sobocinski
Syntactic Formats for Free. CONCUR (2003)
Till Mossakowski, Bartek Klin
Institution Independent Static Analysis for CASL. WADT (2001)
Bartek Klin, Piotr Hoffman, Andrzej Tarlecki, Lutz Schröder, Till Mossakowski
Checking Amalgamability Conditions for C ASL Architectural Specifications. MFCS (2001)
Lutz Schröder, Till Mossakowski, Andrzej Tarlecki, Bartek Klin, Piotr Hoffman
Semantics of Architectural Specifications in CASL. FASE (2001)