logo

07 avril - 07 avril 2026

Classement: C (CORE2023)Offline

International Conference on Relational and AlgebraicMethods in Computer Science

Mis à jour le : 20 days ago
0.0 (0 Évaluations)

Aucun abonné pour le moment.

Aperçu

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.

Appel à communications

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.

Dates importantes

Dates de la conférence

Conference Date

7 avril 2026

Précédemment :
  • 7 avril 2026 - 10 avril 2026

Soumission

Paper submission

NOUVEAU

20 novembre 2025

Notification

Notification date

NOUVEAU

20 janvier 2026

Version finale

Camera-ready

NOUVEAU

10 février 2026

Classement source

Source: CORE2023

Classement: C

Domaine de recherche: Theory of computation

Carte

Loading feedback section...