Anna Ingólfsdóttir

Reykjavík University — IS

Computer Science · Physical Sciences

25h-index2.7kcitations284works0.12yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Formal Methods in Verification(159), Logic, programming, and type systems(156), Logic, Reasoning, and Knowledge(76), semigroups and automata theory(44), Advanced Algebra and Logic(30)

Publications284 total

The Complexity of Deciding Characteristic Formulae Modulo Nested Simulation (extended abstract)
Electronic Proceedings in Theoretical Computer Science·2025Open Access
Non finite axiomatisability of weak bisimulation-based congruences
Theoretical Computer Science·2025Open Access
Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
arXiv (Cornell University)·2025Open Access
The complexity of deciding characteristic formulae modulo nested simulation
arXiv (Cornell University)·2025Open Access
Axiomatising weak bisimulation congruences over CCS with left merge and communication merge
Theoretical Computer Science·2025Open Access
Enhancing Session-Based Game Recommendation Systems Via Graph-Based Deep Learning
SSRN Electronic Journal·2025Open Access
Enhancing Session-Based Game Recommendation Systems Via Graph-Based Deep Learning
SSRN Electronic Journal·2025Open Access
The EM-BDD Algorithm For Learning Hidden Markov Models
Lecture notes in computer science·2024· 1 cited
Complexity results for modal logic with recursion via translations and tableaux
Logical Methods in Computer Science·2024Open Access
The complexity of deciding characteristic formulae in van Glabbeek's branching-time spectrum
arXiv (Cornell University)·2024Open Access
Runtime Instrumentation for Reactive Components
arXiv (Cornell University)·2024Open Access
A monitoring tool for linear-time μHML
Science of Computer Programming·2023· 6 cited
The Way We Were: Structural Operational Semantics Research in Perspective
Electronic Proceedings in Theoretical Computer Science·2023Open Access
On first-order runtime enforcement of branching-time properties
Acta Informatica·2023· 2 cited
Complexity results for modal logic with recursion via translations and tableaux
arXiv (Cornell University)·2023Open Access
Bidirectional Runtime Enforcement of First-Order Branching-Time Properties
Logical Methods in Computer Science·2023· 8 citedOpen Access
MM Algorithms to Estimate Parameters in Continuous-time Markov Chains
arXiv (Cornell University)·2023· 1 citedOpen Access
An MM Algorithm to Estimate Parameters in Continuous-Time Markov Chains
Lecture notes in computer science·2023Open Access
Jajapy: A Learning Library for Stochastic Models
Lecture notes in computer science·2023· 3 citedOpen Access
Complexity through Translations for Modal Logic with Recursion
Electronic Proceedings in Theoretical Computer Science·2022· 2 citedOpen Access
page 1 of 15Next →

Frequent Co-authors

Luca Aceto(42), Adrian Francalanza(10), Wan Fokkink(9), Antonis Achilleos(6), Zoltán Ésik(5), Jiřı́ Srba(3), Matthew Hennessy(3), Matteo Cimini(3), Ian Cassar(3), Bas Luttik(3), Karoliina Lehtinen(3), Kim G. Larsen(2), Árni Hermann Reynisson(2), Marjan Sirjani(2), Steinar Hugi Sigurdarson(2), Rob van Glabbeek(2), Duncan Paul Attard(2), Dario Della Monica(2), Daníel F. Guðbjartsson(1), Thorvaldur Thorvaldsson(1)