
4월 07일 - 2026년 4월 10일
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월 10일
- 2024년 8월 19일 - 2024년 8월 22일
출처 순위
출처: CORE2023
순위: C
연구 분야: Theory of computation, 더 이상 사용되지 않음