Anna Ingólfsdóttir

According to our database1, Anna Ingólfsdóttir
  • authored at least 124 papers between 1990 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Preface for the 27th Nordic Workshop on Programming Theory (NWPT 2015).
J. Log. Algebr. Meth. Program., 2017

A unified rule format for bounded nondeterminism in SOS with terms as labels.
J. Log. Algebr. Meth. Program., 2017

Monitorability for the Hennessy-Milner logic with recursion.
Formal Methods in System Design, 2017

A Survey of Runtime Monitoring Instrumentation Techniques.
Proceedings of the Proceedings Second International Workshop on Pre- and Post-Deployment Verification Techniques, 2017

Trace Simulation Semantics is not Finitely Based over BCCSP.
Acta Cybern., 2017

On the Complexity of Determinizing Monitors.
Proceedings of the Implementation and Application of Automata, 2017

Logical Characterisations and Compositionality of Input-Output Conformance Simulation.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

A Foundation for Runtime Monitoring.
Proceedings of the Runtime Verification - 17th International Conference, 2017

eAOP: an aspect oriented programming framework for Erlang.
Proceedings of the 16th ACM SIGPLAN International Workshop on Erlang, 2017

Rule Formats for Nominal Process Calculi.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Zoltan Esik (1951-2016) In Memoriam.
Bulletin of the EATCS, 2016

Report on NWPT 2015.
Bulletin of the EATCS, 2016

Algebraic Synchronization Trees and Processes.
CoRR, 2016

Determinizing Monitors for HML with Recursion.
CoRR, 2016

A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases.
Acta Inf., 2016

Rule Formats for Bounded Nondeterminism in Structural Operational Semantics.
Proceedings of the Semantics, Logics, and Calculi, 2016

2015
A ground-complete axiomatization of stateless bisimilarity over Linda.
Inf. Process. Lett., 2015

On Verifying Hennessy-Milner Logic with Recursion at Runtime.
Proceedings of the Runtime Verification - 6th International Conference, 2015

When Are Prime Formulae Characteristic?
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014
Axiomatizing weak simulation semantics over BCCSP.
Theor. Comput. Sci., 2014

Modelling and simulation of asynchronous real-time systems using Timed Rebeca.
Sci. Comput. Program., 2014

SOS rule formats for idempotent terms and idempotent unary operators.
J. Log. Algebr. Program., 2014

Report on Two events at ICE-TCS, Reykjavik University.
Bulletin of the EATCS, 2014

On the Expressiveness of the Interval Logic of Allen's Relations Over Finite and Discrete Linear Orders.
Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014

2013
On the specification of modal systems: A comparison of three frameworks.
Sci. Comput. Program., 2013

Meta SOS - A Maude Based SOS Meta-Theory Framework.
Proceedings of the Proceedings Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics, 2013

A Complete Classification of the Expressiveness of Interval Logics of Allen's Relations over Dense Linear Orders.
Proceedings of the 2013 20th International Symposium on Temporal Representation and Reasoning, 2013

SOS Rule Formats for Idempotent Terms and Idempotent Unary Operators.
Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

An Algorithm for Enumerating Maximal Models of Horn Theories with an Application to Modal Logics.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Compositional Reasoning for Multi-modal Logics.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

Exploiting Algebraic Laws to Improve Mechanized Axiomatizations.
Proceedings of the Algebra and Coalgebra in Computer Science, 2013

2012
Rule formats for distributivity.
Theor. Comput. Sci., 2012

Rule formats for determinism and idempotence.
Sci. Comput. Program., 2012

Characteristic formulae for fixed-point semantics: a general framework.
Mathematical Structures in Computer Science, 2012

Proving the validity of equations in GSOS languages using rule-matching bisimilarity.
Mathematical Structures in Computer Science, 2012

Characteristic Formulae for Relations with Nested Fixed Points
Proceedings of the Proceedings 8th Workshop on Fixed Points in Computer Science, 2012

The Equational Theory of Weak Complete Simulation Semantics over BCCSP.
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Algebraic Synchronization Trees and Processes.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
SOS rule formats for zero and unit elements.
Theor. Comput. Sci., 2011

On the axiomatizability of priority II.
Theor. Comput. Sci., 2011

Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet.
Inf. Process. Lett., 2011

Graphical representation of covariant-contravariant modal formulae
Proceedings of the Proceedings 18th International Workshop on Expressiveness in Concurrency, 2011

Axiomatizing GSOS with Predicates
Proceedings of the Proceedings Eight Workshop on Structural Operational Semantics 2011, 2011

Modelling and Simulation of Asynchronous Real-Time Systems using Timed Rebeca
Proceedings of the Proceedings 10th International Workshop on the Foundations of Coordination Languages and Software Architectures, 2011

Sigma algebras in probabilistic epistemic dynamics.
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011

Rule Formats for Distributivity.
Proceedings of the Language and Automata Theory and Applications, 2011

Axiomatizing Weak Ready Simulation Semantics over BCCSP.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31, 2011

Relating Modal Refinements, Covariant-Contravariant Simulations and Partial Bisimulations.
Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

Decompositional Reasoning about the History of Parallel Processes.
Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

PREG Axiomatizer - A Ground Bisimilarity Checker for GSOS with Predicates.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010
Resource bisimilarity and graded bisimilarity coincide.
Inf. Process. Lett., 2010

On Rule Formats for Zero and Unit Elements.
Electr. Notes Theor. Comput. Sci., 2010

Lifting non-finite axiomatizability results to extensions of process algebras.
Acta Inf., 2010

A Rule Format for Unit Elements.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

2009
A finite equational base for CCS with left merge and communication merge.
ACM Trans. Comput. Log., 2009

Foreword: special issue in memory of Nadia Busi.
Mathematical Structures in Computer Science, 2009

Preface.
J. Log. Algebr. Program., 2009

Algebraic Properties for Free!
Bulletin of the EATCS, 2009

A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages
Proceedings of the Proceedings Sixth Workshop on Structural Operational Semantics, 2009

Characteristic Formulae for Fixed-Point Semantics: A General Framework
Proceedings of the Proceedings 16th International Workshop on Expressiveness in Concurrency, 2009

Teaching Concurrency: Theory in Practice.
Proceedings of the Teaching Formal Methods, Second International Conference, 2009

Rule Formats for Determinism and Idempotence.
Proceedings of the Fundamentals of Software Engineering, 2009

2008
On the axiomatisability of priority.
Mathematical Structures in Computer Science, 2008

Guest Editors' Foreword.
J. Log. Algebr. Program., 2008

On the expressibility of priority.
Inf. Process. Lett., 2008

The equational theory of prebisimilarity over basic CCS with divergence.
Inf. Process. Lett., 2008

A Cancellation Theorem for BCCSP.
Fundam. Inform., 2008

Applying Concurrency Research in Industry Report on a Strategic Workshop.
Bulletin of the EATCS, 2008

Finite Equational Bases for Fragments of CCS with Restriction and Relabelling.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2007
Guest Editors' Foreword.
J. Log. Algebr. Program., 2007

Characteristic Formulae: From Automata to Logic.
Bulletin of the EATCS, 2007

The Saga of the Axiomatization of Parallel Composition.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

Impossibility Results for the Equational Theory of Timed CCS.
Proceedings of the Algebra and Coalgebra in Computer Science, 2007

Ready to Preorder: Get Your BCCSP Axiomatization for Free!
Proceedings of the Algebra and Coalgebra in Computer Science, 2007

2006
Bisimilarity is not finitely based over BPA with interrupt.
Theor. Comput. Sci., 2006

A Finite Equational Base for CCS with Left Merge and Communication Merge
CoRR, 2006

A Finite Equational Base for CCS with Left Merge and Communication Merge.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

On the Axiomatizability of Priority.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Genetic Linkage Analysis Algorithms and Their Implementation.
, 2005

CCS with Hennessy's merge has no finite-equational axiomatization.
Theor. Comput. Sci., 2005

Guest editors' foreword: Process Algebra.
Theor. Comput. Sci., 2005

Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge.
Logical Methods in Computer Science, 2005

Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge
CoRR, 2005

Bisimilarity Is Not Finitely Based over BPA with Interrupt.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

Finite Equational Bases in Process Algebra: Results and Open Questions.
Proceedings of the Processes, 2005

2004
The Complexity of Checking Consistency of Pedigree Information and Related Problems.
J. Comput. Sci. Technol., 2004

Nested semantics over finite trees are equationally hard.
Inf. Comput., 2004

2003
The max-plus algebra of the natural numbers has no finite equational basis.
Theor. Comput. Sci., 2003

Equational theories of tropical semirings.
Theor. Comput. Sci., 2003

Foreword.
ITA, 2003

A note on an expressiveness hierarchy for multi-exit iteration.
Inf. Process. Lett., 2003

A semantic theory for value-passing processes based on the late approach.
Inf. Comput., 2003

The Complexity of Checking Consistency of Pedigree Information and Related Problems.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Single Point Algorithms in Genetic Linkage Analysis.
Proceedings of the Computer Aided Systems Theory, 2003

2002
A Fully Equational Proof of Parikh's Theorem.
ITA, 2002

Equational Axioms for Probabilistic Bisimilarity.
Proceedings of the Algebraic Methodology and Software Technology, 2002

2001
A fully abstract denotational model for observational precongruence.
Theor. Comput. Sci., 2001

Corrigendum: A Domain Equation for Bisimulation: Volume 92 Number 2 (1991), pages 161-218.
Inf. Comput., 2001

2-Nested Simulation Is Not Finitely Equationally Axiomatizable.
Proceedings of the STACS 2001, 2001

Axiomatizing Tropical Semirings.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

2000
Characteristic formulae for timed automata.
ITA, 2000

Verification of the legOS Scheduler using Uppaal.
Electr. Notes Theor. Comput. Sci., 2000

On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers.
Proceedings of the STACS 2000, 2000

1999
Towards Verified Lazy Implementation of Concurrent Value-Passing Languages.
Electr. Notes Theor. Comput. Sci., 1999

Testing Hennessy-Milner Logic with Recursion.
Proceedings of the Foundations of Software Science and Computation Structure, 1999

1998
On a Question of A. Salomaa: The Equational Theory of Regular Expressions Over a Singleton Alphabet is not Finitely Based.
Theor. Comput. Sci., 1998

A Menagerie of NonFfinitely Based Process Semantics over BPA* - From Ready Simulation to Completed Traces.
Mathematical Structures in Computer Science, 1998

A Cook's Tour of Equational Axiomatizations for Prefix Iteration.
Proceedings of the Foundations of Software Science and Computation Structure, 1998

1997
A Characterization of Finitary Bisimulation.
Inf. Process. Lett., 1997

Relating semantic models for the object calculus.
Electr. Notes Theor. Comput. Sci., 1997

1996
CPO Models for Compact GSOS Languages.
Inf. Comput., 1996

Axiomatizing Prefix Iteration with Silent Steps.
Inf. Comput., 1996

Weak Semantics Based on Lighted Button Pressing Experiments.
Proceedings of the Computer Science Logic, 10th International Workshop, 1996

An Equational Axiomatization of Observation Congruence for Prefix Iteration.
Proceedings of the Algebraic Methodology and Software Technology, 1996

1995
Late and Early Semantics Coincide for Testing.
Theor. Comput. Sci., 1995

CPO Models for a Class of GSOS Languages.
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

A Fully Abstract Denotational Model for Observational Precongruence.
Proceedings of the Computer Science Logic, 9th International Workshop, 1995

1994
Characteristic Formulae for Processes with Divergence
Inf. Comput., April, 1994

Semantic models for communicating processes with value-passing.
PhD thesis, 1994

1993
A Theory of Communicating Processes with Value Passing
Inf. Comput., December, 1993

Communicating Processes with Value-passing and Assignments.
Formal Asp. Comput., 1993

1991
A Theory of Testing for ACP.
Proceedings of the CONCUR '91, 1991

1990
A Theory of Communicating Processes with Value-Passing.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990


  Loading...