
07 de abril - 07 de abril de 2026
International Conference on Relational and AlgebraicMethods in Computer Science
Aún no hay seguidores.
Resumen General
Since 1994, the RAMiCS conference series has served as the primary forum for research on relation algebras, Kleene algebras, and related algebraic structures. These frameworks play a central role as conceptual and methodological tools in computer science and beyond. On the theoretical side, RAMiCS covers topics such as semigroups, residuated lattices, semirings, Kleene algebras, relation algebras, quantales, and other related structures. The conference explores their connections with program logics and other logical systems, as well as their roles in automata theory, concurrency, formal languages, games, networks, and programming languages. It also welcomes contributions on the development of algebraic, algorithmic, categorical, coalgebraic, and proof-theoretic methods, including formalisation efforts using theorem provers. Applications of these formalisms span a wide range of domains, including tools and techniques for program specification, verification, and correctness; qualitative and quantitative models of computing systems; algorithm design; automated reasoning; network protocol analysis; optimisation; control; and even social choice theory.
Since 1994, the RAMiCS conference series has served as the primary forum for research on relation algebras, Kleene algebras, and related algebraic structures. These frameworks play a central role as conceptual and methodological tools in computer science and beyond. On the theoretical side, RAMiCS covers topics such as semigroups, residuated lattices, semirings, Kleene algebras, relation algebras, quantales, and other related structures. The conference explores their connections with program logics and other logical systems, as well as their roles in automata theory, concurrency, formal languages, games, networks, and programming languages. It also welcomes contributions on the development of algebraic, algorithmic, categorical, coalgebraic, and proof-theoretic methods, including formalisation efforts using theorem provers. Applications of these formalisms span a wide range of domains, including tools and techniques for program specification, verification, and correctness; qualitative and quantitative models of computing systems; algorithm design; automated reasoning; network protocol analysis; optimisation; control; and even social choice theory.
Fechas Importantes
Fechas del Congreso
Conference Date
7 de abril de 2026
- 7 de abril de 2026 - 10 de abril de 2026
Envío
Paper submission
NUEVO20 de noviembre de 2025
Notificación
Notification date
NUEVO20 de enero de 2026
Versión Final
Camera-ready
NUEVO10 de febrero de 2026
Clasificación de la Fuente
Fuente: CORE2023
Clasificación: C
Campo de Investigación: Theory of computation