72 search results - page 12 / 15 » Coalgebraic Logic |
APAL
2007
14 years 11 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
FOSSACS
2006
Springer
15 years 3 months ago
2006
Springer
We take the point of view that, if transition systems are coalgebras for a functor T, then an adequate logic for these transition systems should arise from the `Stone dual' L ...
FOSSACS
2005
Springer
15 years 5 months ago
2005
Springer
We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category X. The propositi...
102
click to vote
ENTCS
2010
14 years 9 months ago
2010
A previously introduced combination of the bialgebraic approach to structural operational semantics with aic modal logic is re-examined and improved in some aspects. Firstly, a mo...
101
click to vote
CALCO
2007
Springer
15 years 3 months ago
2007
Springer
Specification-based testing is a particular case of black-box testing, which consists in deriving test cases from an analysis of a formal specification. We present in this paper an...