Bartek Klin

Orcid: 0000-0001-5793-7425

Affiliations:
  • University of Oxford, UK
  • University of Warsaw, Poland (former)


According to our database1, Bartek Klin authored at least 53 papers between 2001 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Polyregular Functions on Unordered Trees of Bounded Height.
Proc. ACM Program. Lang., January, 2024

2022
Codensity Games for Bisimilarity.
New Gener. Comput., 2022

Monadic Monadic Second Order Logic.
CoRR, 2022

Countdown μ-Calculus.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

μ-Calculi with Atoms (Invited Talk).
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2019
Scalar and Vectorial mu-calculus with Atoms.
Log. Methods Comput. Sci., 2019

Definable isomorphism problem.
Log. Methods Comput. Sci., 2019

A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra.
Log. Methods Comput. Sci., 2019

Expressiveness of probabilistic modal logics: A gradual approach.
Inf. Comput., 2019

Codensity Games for Bisimilarity.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

History-Dependent Nominal μ-Calculus.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018
Iterated Covariant Powerset is not a Monad.
Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

A non-regular language of infinite trees that is recognizable by a finite algebra.
CoRR, 2018

2017
Some undecidable properties of SOS specifications.
J. Log. Algebraic Methods Program., 2017

Learning nominal automata.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Expressiveness of Probabilistic Modal Logics, Revisited.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Modal mu-Calculus with Atoms.
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2016
SMT Solving for Functional Programming over Infinite Structures.
Proceedings of the Proceedings 6th Workshop on Mathematically Structured Functional Programming, 2016

Coalgebraic trace semantics via forgetful logics.
Log. Methods Comput. Sci., 2016

Homomorphism Problems for First-Order Definable Structures.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015
Locally Finite Constraint Satisfaction Problems.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Presenting Morphisms of Distributive Laws.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

2014
Distributive Laws and Decidable Properties of SOS Specifications.
Proceedings of the Proceedings Combined 21st International Workshop on Expressiveness in Concurrency, 2014

Automata theory in nominal sets.
Log. Methods Comput. Sci., 2014

Turing machines with atoms, constraint satisfaction problems, and descriptive complexity.
Proceedings of the 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), 2014

2013
Structural operational semantics for stochastic and weighted transition systems.
Inf. Comput., 2013

Nominal Computation Theory (Dagstuhl Seminar 13422).
Dagstuhl Reports, 2013

Turing Machines with Atoms.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2012
Preface to special issue: EXPRESS, ICE and SOS 2009.
Math. Struct. Comput. Sci., 2012

Towards nominal computation.
Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

2011
Bialgebras for structural operational semantics: An introduction.
Theor. Comput. Sci., 2011

Pointwise extensions of GSOS-defined operations.
Math. Struct. Comput. Sci., 2011

Automata with Group Actions.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010
Structural Operational Semantics and Modal Logic, Revisited.
Proceedings of the Tenth Workshop on Coalgebraic Methods in Computer Science, 2010

2009
Bialgebraic methods and modal logic in structural operational semantics.
Inf. Comput., 2009

Structural Operational Semantics for Weighted Transition Systems.
Proceedings of the Semantics and Algebraic Specification, 2009

2008
Preface.
Proceedings of the Fifth Workshop on Structural Operational Semantics, 2008

Structural Operational Semantics for Stochastic Process Calculi.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

2007
Coalgebraic Modal Logic Beyond Sets.
Proceedings of the 23rd Conference on the Mathematical Foundations of Programming Semantics, 2007

Bialgebraic Operational Semantics and Modal Logic.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

2006
Bialgebraic Methods in Structural Operational Semantics: Invited Talk.
Proceedings of the Third Workshop on Structural Operational Semantics, 2006

2005
Amalgamation in the semantics of CASL.
Theor. Comput. Sci., 2005

Labels from Reductions: Towards a General Theory.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

2004
Adding recursive constructs to bialgebraic semantics.
J. Log. Algebraic Methods Program., 2004

From Bialgebraic Semantics to Congruence Formats.
Proceedings of the Workshop on Structural Operational Semantics, 2004

A Coalgebraic Approach to Process Equivalence and a Coinduction Principle for Traces.
Proceedings of the Workshop on Coalgebraic Methods in Computer Science, 2004

2003
Syntactic Formats for Free.
Proceedings of the CONCUR 2003, 2003

2001
Institution Independent Static Analysis for CASL.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2001

Checking Amalgamability Conditions for C ASL Architectural Specifications.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Semantics of Architectural Specifications in CASL.
Proceedings of the Fundamental Approaches to Software Engineering, 2001


  Loading...