Expressivity of coalgebraic modal logic: The limits and beyond
Theoretical Computer Science
Coalgebraising Subsequential Transducers
Electronic Notes in Theoretical Computer Science (ENTCS)
Admissibility of Cut in Coalgebraic Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Shallow Models for Non-iterative Modal Logics
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
PSPACE bounds for rank-1 modal logics
ACM Transactions on Computational Logic (TOCL)
CoLoSS: The Coalgebraic Logic Satisfiability Solver
Electronic Notes in Theoretical Computer Science (ENTCS)
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Rank-1 modal logics are coalgebraic
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Coalgebraic modal logic in COCASL
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
Free modal algebras: a coalgebraic perspective
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Beyond rank 1: algebraic semantics and finite models for coalgebraic logics
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Generalized modal satisfiability
Journal of Computer and System Sciences
Free Heyting algebras: revisited
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Cut elimination in coalgebraic logics
Information and Computation
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Modular algorithms for heterogeneous modal logics
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hi-index | 0.00 |
The UCLID project seeks to develop formal verification tools for infinite-state systems having a degree of automation comparable to that of model checking tools for finitestate systems. The UCLID modeling language describes systems where the state variables ...