| 2009 |
|---|
| 64 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
A finite equational base for CCS with left merge and communication merge.
ACM Trans. Comput. Log. 10(1): (2009) |
| 2008 |
|---|
| 63 | | Luca Aceto,
Ivan Damgård,
Leslie Ann Goldberg,
Magnús M. Halldórsson,
Anna Ingólfsdóttir,
Igor Walukiewicz:
Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games
Springer 2008 |
| 62 | | Luca Aceto,
Ivan Damgård,
Leslie Ann Goldberg,
Magnús M. Halldórsson,
Anna Ingólfsdóttir,
Igor Walukiewicz:
Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations
Springer 2008 |
| 61 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Mohammad Reza Mousavi:
Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras.
IFIP TCS 2008: 301-316 |
| 60 | EE | Luca Aceto,
Anna Ingólfsdóttir,
Bas Luttik,
Paul van Tilburg:
Finite Equational Bases for Fragments of CCS with Restriction and Relabelling.
IFIP TCS 2008: 317-332 |
| 59 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
A Cancellation Theorem for BCCSP.
Fundam. Inform. 88(1-2): 1-21 (2008) |
| 58 | EE | Luca Aceto,
Silvio Capobianco,
Anna Ingólfsdóttir,
Bas Luttik:
The equational theory of prebisimilarity over basic CCS with divergence.
Inf. Process. Lett. 108(5): 284-289 (2008) |
| 57 | EE | Luca Aceto,
Anna Ingólfsdóttir:
On the expressibility of priority.
Inf. Process. Lett. 109(1): 83-85 (2008) |
| 56 | EE | Luca Aceto,
Anna Ingólfsdóttir:
Guest Editors' Foreword.
J. Log. Algebr. Program. 77(1-2): (2008) |
| 55 | EE | Luca Aceto,
Taolue Chen,
Wan Fokkink,
Anna Ingólfsdóttir:
On the axiomatisability of priority.
Mathematical Structures in Computer Science 18(1): 5-28 (2008) |
| 2007 |
|---|
| 54 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
Ready to Preorder: Get Your BCCSP Axiomatization for Free!
CALCO 2007: 65-79 |
| 53 | EE | Luca Aceto,
Anna Ingólfsdóttir,
Mohammad Reza Mousavi:
Impossibility Results for the Equational Theory of Timed CCS.
CALCO 2007: 80-95 |
| 52 | EE | Luca Aceto,
Anna Ingólfsdóttir:
The Saga of the Axiomatization of Parallel Composition.
CONCUR 2007: 2-16 |
| 51 | EE | Luca Aceto,
Anna Ingólfsdóttir:
Guest Editors' Foreword.
J. Log. Algebr. Program. 73(1-2): 1 (2007) |
| 2006 |
|---|
| 50 | | Luca Aceto,
Anna Ingólfsdóttir:
Foundations of Software Science and Computation Structures, 9th International Conference, FOSSACS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006, Proceedings
Springer 2006 |
| 49 | | Corrado Priami,
Anna Ingólfsdóttir,
Bud Mishra,
Hanne Riis Nielson:
Transactions on Computational Systems Biology VII
Springer 2006 |
| 48 | EE | Luca Aceto,
Taolue Chen,
Wan Fokkink,
Anna Ingólfsdóttir:
On the Axiomatizability of Priority.
ICALP (2) 2006: 480-491 |
| 47 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
A Finite Equational Base for CCS with Left Merge and Communication Merge.
ICALP (2) 2006: 492-503 |
| 46 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
A Finite Equational Base for CCS with Left Merge and Communication Merge
CoRR abs/cs/0608001: (2006) |
| 45 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Sumit Nain:
Bisimilarity is not finitely based over BPA with interrupt.
Theor. Comput. Sci. 366(1-2): 60-81 (2006) |
| 2005 |
|---|
| 44 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Sumit Nain:
Bisimilarity Is Not Finitely Based over BPA with Interrupt.
CALCO 2005: 52-66 |
| 43 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
Finite Equational Bases in Process Algebra: Results and Open Questions.
Processes, Terms and Cycles 2005: 338-367 |
| 42 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge
CoRR abs/cs/0501040: (2005) |
| 41 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge.
Logical Methods in Computer Science 1(1): (2005) |
| 40 | EE | Anna Ingólfsdóttir,
Daniel Gudbjartsson:
Genetic Linkage Analysis Algorithms and Their Implementation.
T. Comp. Sys. Biology: 123-144 (2005) |
| 39 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
CCS with Hennessy's merge has no finite-equational axiomatization.
Theor. Comput. Sci. 330(3): 377-405 (2005) |
| 38 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Zoltán Ésik:
Guest editors' foreword: Process Algebra.
Theor. Comput. Sci. 335(2-3): 127-129 (2005) |
| 2004 |
|---|
| 37 | EE | Luca Aceto,
Wan Fokkink,
Rob J. van Glabbeek,
Anna Ingólfsdóttir:
Nested semantics over finite trees are equationally hard.
Inf. Comput. 191(2): 203-232 (2004) |
| 36 | EE | Luca Aceto,
Jens A. Hansen,
Anna Ingólfsdóttir,
Jacob Johnsen,
John Knudsen:
The Complexity of Checking Consistency of Pedigree Information and Related Problems.
J. Comput. Sci. Technol. 19(1): 42-59 (2004) |
| 2003 |
|---|
| 35 | EE | Daniel Gudbjartsson,
Jens A. Hansen,
Anna Ingólfsdóttir,
Jacob Johnsen,
John Knudsen:
Single Point Algorithms in Genetic Linkage Analysis.
EUROCAST 2003: 372-383 |
| 34 | EE | Luca Aceto,
Jens A. Hansen,
Anna Ingólfsdóttir,
Jacob Johnsen,
John Knudsen:
The Complexity of Checking Consistency of Pedigree Information and Related Problems.
ICTCS 2003: 174-187 |
| 33 | | Zoltán Ésik,
Anna Ingólfsdóttir:
Foreword.
ITA 37(4): 272 (2003) |
| 32 | EE | Anna Ingólfsdóttir:
A semantic theory for value-passing processes based on the late approach.
Inf. Comput. 184(1): 1-44 (2003) |
| 31 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
A note on an expressiveness hierarchy for multi-exit iteration.
Inf. Process. Lett. 87(1): 17-23 (2003) |
| 30 | EE | Luca Aceto,
Zoltán Ésik,
Anna Ingólfsdóttir:
Equational theories of tropical semirings.
Theor. Comput. Sci. 3(298): 417-469 (2003) |
| 2002 |
|---|
| 29 | | Zoltán Ésik,
Anna Ingólfsdóttir:
Fixed Points in Computer Science, FICS 2002, Copenhagen, Denmark, 20-21 July 2002, Preliminary Proceedings
University of Aarhus 2002 |
| 28 | EE | Luca Aceto,
Zoltán Ésik,
Anna Ingólfsdóttir:
Equational Axioms for Probabilistic Bisimilarity.
AMAST 2002: 239-253 |
| 27 | EE | Luca Aceto,
Zoltán Ésik,
Anna Ingólfsdóttir:
A Fully Equational Proof of Parikh's Theorem.
ITA 36(2): 129-153 (2002) |
| 2001 |
|---|
| 26 | EE | Luca Aceto,
Zoltán Ésik,
Anna Ingólfsdóttir:
Axiomatizing Tropical Semirings.
FoSSaCS 2001: 42-56 |
| 25 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
2-Nested Simulation Is Not Finitely Equationally Axiomatizable.
STACS 2001: 39-50 |
| 24 | EE | Samson Abramsky,
Luca Aceto,
Anna Ingólfsdóttir:
Corrigendum: A Domain Equation for Bisimulation: Volume 92 Number 2 (1991), pages 161-218.
Inf. Comput. 165(2): 119-122 (2001) |
| 23 | EE | Anna Ingólfsdóttir,
Andrea Schalk:
A fully abstract denotational model for observational precongruence.
Theor. Comput. Sci. 254(1-2): 35-61 (2001) |
| 2000 |
|---|
| 22 | EE | Luca Aceto,
Zoltán Ésik,
Anna Ingólfsdóttir:
On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers.
STACS 2000: 267-278 |
| 21 | EE | Lone Halkjaer,
Karen Haervig,
Anna Ingólfsdóttir:
Verification of the legOS Scheduler using Uppaal.
Electr. Notes Theor. Comput. Sci. 39(3): (2000) |
| 20 | EE | Luca Aceto,
Anna Ingólfsdóttir,
Mikkel Lykke Pedersen,
Jan Poulsen:
Characteristic formulae for timed automata.
ITA 34(6): 565-584 (2000) |
| 1999 |
|---|
| 19 | | Luca Aceto,
Anna Ingólfsdóttir:
Testing Hennessy-Milner Logic with Recursion.
FoSSaCS 1999: 41-55 |
| 18 | EE | Anna Ingólfsdóttir,
Rosario Pugliese:
Towards Verified Lazy Implementation of Concurrent Value-Passing Languages.
Electr. Notes Theor. Comput. Sci. 27: (1999) |
| 1998 |
|---|
| 17 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
A Cook's Tour of Equational Axiomatizations for Prefix Iteration.
FoSSaCS 1998: 20-34 |
| 16 | | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
A Menagerie of NonFfinitely Based Process Semantics over BPA* - From Ready Simulation to Completed Traces.
Mathematical Structures in Computer Science 8(3): 193-230 (1998) |
| 15 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
On a Question of A. Salomaa: The Equational Theory of Regular Expressions Over a Singleton Alphabet is not Finitely Based.
Theor. Comput. Sci. 209(1-2): 163-178 (1998) |
| 1997 |
|---|
| 14 | EE | Luca Aceto,
Hans Hüttel,
Anna Ingólfsdóttir,
Josva Kleist:
Relating semantic models for the object calculus.
Electr. Notes Theor. Comput. Sci. 7: (1997) |
| 13 | EE | Luca Aceto,
Anna Ingólfsdóttir:
A Characterization of Finitary Bisimulation.
Inf. Process. Lett. 64(3): 127-134 (1997) |
| 1996 |
|---|
| 12 | | Luca Aceto,
Anna Ingólfsdóttir:
An Equational Axiomatization of Observation Congruence for Prefix Iteration.
AMAST 1996: 195-209 |
| 11 | | Anna Ingólfsdóttir:
Weak Semantics Based on Lighted Button Pressing Experiments.
CSL 1996: 226-243 |
| 10 | | Luca Aceto,
Rob J. van Glabbeek,
Wan Fokkink,
Anna Ingólfsdóttir:
Axiomatizing Prefix Iteration with Silent Steps.
Inf. Comput. 127(1): 26-40 (1996) |
| 9 | | Luca Aceto,
Anna Ingólfsdóttir:
CPO Models for Compact GSOS Languages.
Inf. Comput. 129(2): 107-141 (1996) |
| 1995 |
|---|
| 8 | | Anna Ingólfsdóttir,
Andrea Schalk:
A Fully Abstract Denotational Model for Observational Precongruence.
CSL 1995: 335-361 |
| 7 | | Luca Aceto,
Anna Ingólfsdóttir:
CPO Models for a Class of GSOS Languages.
TAPSOFT 1995: 439-453 |
| 6 | EE | Anna Ingólfsdóttir:
Late and Early Semantics Coincide for Testing.
Theor. Comput. Sci. 146(1&2): 341-349 (1995) |
| 1994 |
|---|
| 5 | | Bernhard Steffen,
Anna Ingólfsdóttir:
Characteristic Formulae for Processes with Divergence
Inf. Comput. 110(1): 149-163 (1994) |
| 1993 |
|---|
| 4 | | Matthew Hennessy,
Anna Ingólfsdóttir:
Communicating Processes with Value-passing and Assignments.
Formal Asp. Comput. 5(5): 432-466 (1993) |
| 3 | | Matthew Hennessy,
Anna Ingólfsdóttir:
A Theory of Communicating Processes with Value Passing
Inf. Comput. 107(2): 202-236 (1993) |
| 1991 |
|---|
| 2 | | Luca Aceto,
Anna Ingólfsdóttir:
A Theory of Testing for ACP.
CONCUR 1991: 78-95 |
| 1990 |
|---|
| 1 | | Matthew Hennessy,
Anna Ingólfsdóttir:
A Theory of Communicating Processes with Value-Passing.
ICALP 1990: 209-219 |
