logo

07. April - 07. April 2026

Rang: C (CORE2023)Offline

International Conference on Relational and AlgebraicMethods in Computer Science

Aktualisiert: about 1 month ago
0.0 (0 Bewertungen)

Noch keine Follower.

Übersicht

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.

Call for Papers

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.

Wichtige Termine

Konferenzdaten

Conference Date

7. April 2026

Bisher:
  • 7. April 2026 - 10. April 2026

Einreichung

Paper submission

NEU

20. November 2025

Benachrichtigung

Notification date

NEU

20. Januar 2026

Druckvorlage

Camera-ready

NEU

10. Februar 2026

Quellenrang

Quelle: CORE2023

Rang: C

Forschungsgebiet: Theory of computation

Karte

Loading feedback section...