47 citations · 115 across the 13 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.LO2016★ 16 cited
Coalgebraic trace semantics via forgetful logics
Bartek Klin, Jurriaan Rot
We use modal logic as a framework for coalgebraic trace semantics, and show the flexibility of the approach with concrete examples such as the language semantics of weighted, alter…
cs.FL2016★ 22 cited
Learning Nominal Automata
Joshua Moerman, Matteo Sammartino, Alexandra Silva +2
We present an Angluin-style algorithm to learn nominal automata, which are acceptors of languages over infinite (structured) alphabets. The abstract approach we take allows us to s…
cs.PL2016★ 17 cited
SMT Solving for Functional Programming over Infinite Structures
Bartek Klin, Michał Szynwelski
We develop a simple functional programming language aimed at manipulating infinite, but first-order definable structures, such as the countably infinite clique graph or the set of…