Bartek Klin

Home Publications Teaching (in Polish)

DBLP, Google Scholar

To appear

• B. Klin, S. Lasota, S. Toruńczyk: Nondeterministic and co-nondeterministic implies deterministic, for data languages.
  To appear in the proceedings of FoSSaCS 2021.
  

2019

• M. Bojańczyk, B. Klin: A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra.
  Log. Meth. Comp. Sci. 15(4).
  oai:arXiv.org:1804.06667
  
• F. Clerc, N. Fijalkow, B. Klin, P. Panangaden: Expressiveness of probabilistic modal logics: A gradual approach.
  Inf. Comput. 267, pp. 145-163.
  doi:10.1016/j.ic.2019.04.002
  
• C. Eberhart, B. Klin: History-dependent nominal mu-calculus.
  Proceedings of LICS 2019.
  doi:10.1109/LICS.2019.8785736
  
• K. Keshvardoost, B. Klin, S. Lasota, J. Ochremiak, S. Toruńczyk: Definable isomorphism problem.
  Log. Meth. Comp. Sci. 15(4).
  oai:arXiv.org:1802.08500
  
• B. Klin, M. Łełyk: Scalar and Vectorial mu-Calculus with Atoms.
  Log. Meth. Comp. Sci. 15(4).
  oai:arXiv.org:1803.06752
  
• Y. Komorida, S. Katsumata, N. Hu, B. Klin, I. Hasuo: Codensity games for bisimilarity.
  Proceedings of LICS 2019.
  doi:10.1109/LICS.2019.8785691
  

2018

• B. Klin, J. Salamanca: Iterated covariant powerset is not a monad.
  Proceedings of MFPS 2018, ENTCS 341, pp. 261-276.
  doi:10.1016/j.entcs.2018.11.013
  

2017

• N. Fijalkow, B. Klin, P. Panangaden: Expressiveness of Probabilistic Modal Logics, Revisited.
  Proceedings of ICALP 2017, pp. 30:1--30:21.
  doi:10.4230/LIPIcs.ICALP.2017.105
  
• B. Klin, M. Łełyk: Modal mu-Calculus with Atoms.
  Proceedings of CSL 2017, pp. 105:1--105:12.
  doi:10.4230/LIPIcs.CSL.2017.30
  
• B. Klin, B. Nachyła: Some undecidable properties of SOS specifications.
  J. Log. Alg. Methods in Prog. 87, pp. 94-109.
  doi:10.1016/j.jlamp.2016.08.005
  
• J. Moerman, M. Sammartino, A. Silva, B. Klin, M. Szynwelski: Learning nominal automata.
  Proceedings of POPL 2017, pp. 613-625.
  doi:10.1145/3009837.3009879
  

2016

• B. Klin, S. Lasota, J. Ochremiak, S. Toruńczyk: Homomorphism problems for first-order definable structures.
  Proceedings of FSTTCS 2016, pp. 14:1-14:15.
  10.4230/LIPIcs.FSTTCS.2016.14
  
• B. Klin, J. Rot: Coalgebraic trace semantics via forgetful logics.
  Log. Meth. Comp. Sci. 12(4).
  doi:10.2168/LMCS-12(4:10)2016
  
• B. Klin, M. Szynwelski: SMT solving for functional programming over infinite structures.
  Proceedings of MSFP 2016, EPTCS 207, pp. 57-75
  doi:10.4204/EPTCS.207.3
  

2015

• B. Klin, E. Kopczyński, J. Ochremiak, S. Toruńczyk: Locally finite Constraint Satisfaction Problems.
  Proceedings of LICS 2015, pp. 475-486
  doi:10.1109/LICS.2015.51
  
• B. Klin, B. Nachyła: Presenting morphisms of distributive laws.
  Proceedings of CALCO 2015, pp. 190-204
  doi:10.4230/LIPIcs.CALCO.2015.190
  
• B. Klin, J. Rot: Coalgebraic trace semantics via forgetful logics.
  Proceedings of FOSSACS 2015, LNCS 9034, pp. 151-166.
  doi:10.1007/978-3-662-46678-0_10
  

2014

• M. Bojańczyk, B. Klin, S. Lasota: Automata theory in nominal sets.
  Log. Meth. Comp. Sci. 10(3:4).
  doi:10.2168/LMCS-10(3:4)2014
  
• B. Klin, S. Lasota, J. Ochremiak, S. Toruńczyk: Turing machines with atoms, constraint satisfaction problems and descriptive complexity.
  Proceedings of LICS 2014, pp. 58:1-58:10
  doi:10.1145/2603088.2603135
  
• B. Klin, B. Nachyła: Distributive laws and decidable properties of SOS specifications.
  Proceedings of EXPRESS/SOS 2014, EPTCS 160, pp. 79-93.
  doi:10.4204/EPTCS.160.8
  

2013

• M. Bojańczyk, B. Klin, S. Lasota, S. Toruńczyk: Turing machines with atoms.
  Proceedings of LICS 2013, pp. 183-192.
  doi:10.1109/LICS.2013.24
  
• B. Klin, V. Sassone: Structural operational semantics for stochastic and weighted transition systems.
  Inf. Comput. 227, pp. 58-83.
  doi:10.1016/j.ic.2013.04.001
  

2012

• M. Bojańczyk, L. Braud, B. Klin, S. Lasota: Towards nominal computation.
  Proceedings of POPL 2012, pp. 401-412.
  doi:10.1145/2103656.2103704
  

2011

• M. Bojańczyk, B. Klin, S. Lasota: Automata with group actions.
  Proceedings of LICS 2011, pp. 355-364.
  doi:10.1109/LICS.2011.48
  
• H. H. Hansen, B. Klin: Pointwise extensions of GSOS-defined operations.
  Math. Struct. Comp. Sci 21(2), pp. 321-361.
  doi:10.1017/S096012951000054X
  

• B. Klin: Bialgebras for structural operational semantics: an introduction.
  TCS 412(38), pp. 5043-5069.
  doi:10.1016/j.tcs.2011.03.023
  

2010

• B. Klin: Structural operational semantics and modal logic, revisited.
  Proceedings of CMCS 2010, ENTCS 264(2), pp. 155-175.
  doi:10.1016/j.entcs.2010.07.019
  

2009

• B. Klin: Structural operational semantics for weighted transition systems.
  Essays Dedicated to Peter D. Mosses on the Occasion of His 60th Birthday, LNCS 5700, pp. 121-139.
  doi:10.1007/978-3-642-04164-8_7
  
• B. Klin: Bialgebraic methods and modal logic in structural operational semantics.
  Inf. Comput. 207(2), pp. 237-257.
  doi:10.1016/j.ic.2007.10.006
  

2008

• B. Klin, V. Sassone: Structural operational semantics for stochastic process calculi.
  Proceedings of FOSSACS 2008, LNCS 4962, pp. 428-442.
  doi:10.1007/978-3-540-78499-9_30
  

2007

• B. Klin: Bialgebraic operational semantics and modal logic.
  Proceedings of LICS 2007, pp. 336-345.
  doi:10.1109/LICS.2007.13
  
• B. Klin: Coalgebraic modal logic beyond sets.
  Proceedings of MFPS 2007, ENTCS 175(1), pp. 177-201.
  doi:10.1016/j.entcs.2007.02.034
  
• B. Klin: Bialgebraic methods in structural operational semantics: invited talk.
  Proceedings of SOS 2006, ENTCS 175(1), pp. 33-43.
  doi:10.1016/j.entcs.2006.11.018
  

2005

• B. Klin: The least fibred lifting and the expressivity of coalgebraic modal logic.
  Proceedings of CALCO 2005, LNCS 3629, pp. 247-262.
  doi:10.1007/11548133_16
  
• B. Klin, V. Sassone, P. Sobociński: Labels from reductions: towards a general theory.
  Proceedings of CALCO 2005, LNCS 3629, pp. 30-50.
  doi:10.1007/11548133_2
  
• B. Klin: From bialgebraic semantics to congruence formats.
  Proceedings of SOS 2004, ENTCS 128(1), pp. 3-37.
  doi:10.1016/j.entcs.2004.09.038
  
• L. Schröder, T. Mossakowski, A. Tarlecki, B. Klin, P. Hoffman: Amalgamation in the semantics of CASL.
  TCS 331(1), pp. 215-247.
  doi:10.1016/j.tcs.2004.09.037
  

2004

• B. Klin: A coalgebraic approach to process equivalence and a coinduction principle for traces.
  Proceedings of CMCS 2004, ENTCS 106, pp. 201-218.
  doi:10.1016/j.entcs.2004.02.029
  
• B. Klin: Adding recursive constructs to bialgebraic semantics.
  J. Log. Alg. Prog. 60-61, pp. 259-286.
  doi:10.1016/j.jlap.2004.03.005
  
• B. Klin: An abstract coalgebraic approach to process equivalence for well-behaved operational semantics.
  PhD Thesis, BRICS, University of Aarhus.
  

2003

• B. Klin, P. Sobociński: Syntactic formats for free.
  Proceedings of CONCUR 2003, LNCS 2761, pp. 72-86.
  doi:10.1007/b11938
  

2001

• L. Schröder, T. Mossakowski, A. Tarlecki, B. Klin, P. Hoffman: Semantics of architectural specifications in CASL.
  Proceedings of FASE 2001, LNCS 2029, pp. 253-268.
  doi:10.1007/3-540-45314-8_19
  
• B. Klin, P. Hoffman, A. Tarlecki, L. Schröder, T. Mossakowski: Checking amalgamability conditions for CASL architectural specifications.
  Proceedings of MFCS 2001, LNCS 2136, pp. 451-463.
  doi:10.1007/3-540-44683-4_40
  
• T. Mossakowski, B. Klin: Institution independent static analysis for CASL.
  Proceedings of WADT 2001, LNCS 2267, pp. 221-237.
  doi:10.1007/3-540-45645-7_11