Correct System Design

Sibylle Fröschle

Address: Sibylle Fröschle
University of Oldenburg
Faculty II
Department of Computing Science
D-26111 Oldenburg
Germany
Foto
Room: A3 2-213
Phone: +49 441 798-3124
Fax: +49 441 798-2965
email: Sibylle.Froeschle

 


top of page

Curriculum Vitae

1996 MSc at the University of Edinburgh
12/1999 - 08/2004 Research Associate at the University of Edinburgh
2004 PhD at the University of Edinburgh (Graduation)
09/2004 - 09/2006 Research Fellow at Warsaw University
11/2006 - 05/2007 Research Visitor at the University of Edinburgh
since 05/2007 Habilitand at the University of Oldenburg


top of page

Publications

[FL07]
Sibylle Fröschle and Slawomir Lasota. Causality versus true-concurrency. Theoretical Computer Science, 386(3):169-187, 2007.
[ bib ]

[Frö07]
Sibylle Fröschle. The insecurity problem: tackling unbounded data. In IEEE Computer Security Foundations Symposium 2007. IEEE Computer Society, 2007.
[ bib | Abstract ]

[FLb]
Sibylle Fröschle and Slawomir Lasota. Normed processes, unique decomposition, and complexity of bisimulation equivalences. In Proceedings of INFINITY'06, Electronic Notes in Theoretical Computer Science. Elsevier. To appear.
[ bib ]

[FLa]
Sibylle Fröschle and Slawomir Lasota. Causality versus true-concurrency. Theoretical Computer Science. To appear.
[ bib ]

[Frö05b]
Sibylle Fröschle. The decidability border of hereditary history preserving bisimilarity. Information Processing Letters, 93(6):289-293, 2005. (c) Elsevier.
[ bib | .pdf ]

[Frö05a]
Sibylle Fröschle. Composition and decomposition in true-concurrency. In Proceedings of FOSSACS'05, volume 3441 of LNCS, pages 333-347. Springer-Verlag, 2005. (c) Springer-Verlag.
[ bib | .pdf | Abstract ]

[FL05b]
Sibylle Fröschle and Slawomir Lasota. Decomposition and complexity of hereditary history preserving bisimulation on BPP. In Proceedings of CONCUR'05, volume 3656 of LNCS, pages 263-277. Springer-Verlag, 2005. (c) Springer-Verlag.
[ bib | .pdf | Abstract ]

[FL05a]
Sibylle Fröschle and Slawomir Lasota. Causality versus true-concurrency. In Proceedings of EXPRESS'05, Electronic Notes in Theoretical Computer Science. Elsevier, 2005. (c) Elsevier.
[ bib | .pdf | Abstract ]

[BF02]
Julian C. Bradfield and Sibylle Fröschle. Independence-friendly modal logic and true concurrency. Nordic Journal of Computing, (9):102-117, 2002.
[ bib ]

[BF01]
Julian C. Bradfield and Sibylle Fröschle. On logical and concurrent equivalences. In Proceedings of EXPRESS'01, volume 52 of Electronic Notes in Theoretical Computer Science. Elsevier, 2001.
[ bib ]

[Frö99]
Sibylle Fröschle. Decidability of plain and hereditary history-preserving bisimulation for bpp. In Proceedings of EXPRESS'99, volume 27 of Electronic Notes in Theoretical Computer Science. Elsevier, 1999.
[ bib ]

[FH99]
Sibylle Fröschle and Thomas T. Hildebrandt. On plain and hereditary history-preserving bisimulation. In Proceedings of MFCS'99, volume 1672 of LNCS. Springer-Verlag, 1999.
[ bib ]


top of page

Theses

[Frö04]
Sibylle Fröschle. Decidability and Coincidence of Equivalences for Concurrency. PhD thesis, University of Edinburgh, 2004.
[ bib | .pdf | Abstract ]