Anna Ingólfsdóttir, 1952-
Anna Ingólfsdóttir
Ingólfsdóttir, Anna
Anna Ingólfsdóttir Ph.D. from University of Sussex in 1995 on "Semantic Models for Communicating Processes with Value-Passing." supervised by Matthew C. B. Hennessy
VIAF ID: 119897005 (Personal)
Permalink: http://viaf.org/viaf/119897005
Preferred Forms
-
100 4 _ ‡a Anna ‡1 Ingólfsdóttir ‡d 1952-
-
100 0 _
‡a
Anna Ingólfsdóttir
‡d
1952-
-
200 _ | ‡a Anna Ingólfsdóttir ‡f 1952-....
-
100 0 _ ‡a Anna Ingólfsdóttir, ‡d 1952-
-
100 0 _
‡a
Anna Ingólfsdóttir,
‡d
1952-
-
100 0 _ ‡a Anna Ingólfsdóttir, ‡d 1952-
-
100 3 _ ‡a Anna Ingólfsdóttir
-
100 0 _
‡a
Anna Ingólfsdóttir
-
100 0 _
‡a
Anna Ingólfsdóttir
‡c
Ph.D. from University of Sussex in 1995 on "Semantic Models for Communicating Processes with Value-Passing." supervised by Matthew C. B. Hennessy
-
100 0 _ ‡a Anna Ingólfsdóttir, ‡d 1952-
-
100 1 _ ‡a Ingólfsdóttir, Anna
4xx's: Alternate Name Forms (8)
5xx's: Related Names (1)
Works
| Title | Sources |
|---|---|
| 2-nested simulation is not finitely equationally axiomatizable |
|
| Bisimilarity is not finitely based over BPA with interrupt |
|
| Characteristic formulae |
|
| The complexity of checking consistency of pedigree information and related problems |
|
| Computer scientist - the 21st century renaissance man. |
|
| Decompositional Reasoning about the History of Parallel Processes |
|
| A Domain Equation for Bisimulation |
|
| Equational theories of tropical semirings |
|
| ETAPS 2006 |
|
| Ett samtal om den nordiska bilderboken |
|
| Finite equational bases in process algebra : results and open questions |
|
| FOSSACS 2006 |
|
| Foundations of software science and computation structures, c2006: |
|
| Joint European Conferences on Theory and Practice of Software |
|
| Modelling and Simulation of Asynchronous Real-Time Systems using Timed Rebeca |
|
| Nested semantics over finite trees are equationally hard |
|
| On a question of A. Salomaa |
|
| On the axiomatizability of priority II |
|
| On the existence of a finite base for complete trace equivalence over BPA with interrupt |
|
| On the finitary bisimulation |
|
| PREG Axiomatizer : A Ground Bisimilarity Checker for GSOS with Predicates |
|
| Reactive systems : modelling, specification and verification |
|
| Ready to preorder |
|
| Rule formats for determinism and idempotence |
|
| Rule formats for distributivity |
|
| SOS rule formats for zero and unit elements |
|
| Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge |
|
| Stærðfræði fyrir framhaldsskóla |
|
| Stærðfræði styður við gerð óbrigðuls, öruggs og öflugs hugbúnaðar |
|
| Towards Verified Lazy Implementation of Concurrent Value-Passing Languages (Abstract) |
|
| Weak semantics based on lighted button pressing experiments |
|
| An ¤BDD-based implementation of the Allegro software |
|
| A ¤complete equational axiomatization for prefix iteration with silent steps |
|
| A ¤formalization of linkage analysis |
|
| A ¤fully abstract denotational model for observational congruence |
|
| A ¤fully equational proof of Parikh's theorem |
|
| The ¤Max-Plus Algebra of the natural numbers has no finite equational basis |
|
| A ¤menagerie of non-finitely based process semantics over BPA* |
|
| A ¤note on an expressiveness hierachy for multi-exit iteration |
|
| The ¤saga of the axiomatization of parallel composition |
|
| A ¤semantic theory for value-passing processes |
|
