
4月07日 - 2026年4月07日
International Conference on Relational and AlgebraicMethods in Computer Science
暂无关注者。
概览
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.
重要日期
会议日期
Conference Date
2026年4月7日
- 2026年4月7日 - 2026年4月10日
投稿
Paper submission
新2025年11月20日
通知
Notification date
新2026年1月20日
终稿
Camera-ready
新2026年2月10日
来源排名
来源: CORE2023
排名: C
研究领域: Theory of computation