Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Sibylle B. Fröschle
2010 – today
- 2012
[j11]Filippo Bonchi, Sibylle B. Fröschle, Daniele Gorla, Bartek Klin: Preface to special issue: EXPRESS, ICE and SOS 2009. Mathematical Structures in Computer Science 22(2): 123-124 (2012)- [i1]Mike Bond, Riccardo Focardi, Sibylle B. Fröschle, Graham Steel: Analysis of Security APIs (Dagstuhl Seminar 12482). Dagstuhl Reports 2(11): 155-168 (2012)
- 2011
- [j10]Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota: Partially-commutative context-free processes: Expressibility and tractability. Inf. Comput. 209(5): 782-798 (2011)
- [c8]Sibylle B. Fröschle, Nils Sommer: Concepts and Proofs for Configuring PKCS#11. Formal Aspects in Security and Trust 2011: 131-147
- 2010
- [j9]Sibylle B. Fröschle, Petr Jancar, Slawomir Lasota, Zdenek Sawa: Non-interleaving bisimulation equivalences on Basic Parallel Processes. Inf. Comput. 208(1): 42-62 (2010)
- [c7]Sibylle B. Fröschle, Nils Sommer: Reasoning with Past to Prove PKCS#11 Keys Secure. Formal Aspects in Security and Trust 2010: 96-110
- [e2]Sibylle B. Fröschle, Frank D. Valencia (Eds.): Proceedings 17th International Workshop on Expressiveness in Concurrency. EPTCS 41, 2010
2000 – 2009
- 2009
- [j8]Sibylle B. Fröschle, Slawomir Lasota: Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences. Electr. Notes Theor. Comput. Sci. 239: 17-42 (2009)
- [j7]Sibylle B. Fröschle: Adding Branching to the Strand Space Model. Electr. Notes Theor. Comput. Sci. 242(1): 139-159 (2009)
- [c6]Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota: Partially-Commutative Context-Free Processes. CONCUR 2009: 259-273
- [c5]Sibylle B. Fröschle, Graham Steel: Analysing PKCS#11 Key Management APIs with Unbounded Fresh Data. ARSPA-WITS 2009: 92-106
- [e1]Sibylle B. Fröschle, Daniele Gorla (Eds.): Proceedings 16th International Workshop on Expressiveness in Concurrency. EPTCS 8, 2009
- 2007
- [j6]Sibylle B. Fröschle, Slawomir Lasota: Causality versus true-concurrency. Theor. Comput. Sci. 386(3): 169-187 (2007)
- [c4]
- 2006
- [j5]Sibylle B. Fröschle, Slawomir Lasota: Causality Versus True-Concurrency. Electr. Notes Theor. Comput. Sci. 154(3): 3-18 (2006)
- 2005
- [j4]Sibylle B. Fröschle: The decidability border of hereditary history preserving bisimilarity. Inf. Process. Lett. 93(6): 289-293 (2005)
- [c3]Sibylle B. Fröschle, Slawomir Lasota: Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP. CONCUR 2005: 263-277
- [c2]
- 2002
- [j3]Julian C. Bradfield, Sibylle B. Fröschle: Independence-Friendly Modal Logic and True Concurrency. Nord. J. Comput. 9(1): 102-117 (2002)
- 2001
- [j2]Julian C. Bradfield, Sibylle B. Fröschle: On Logical and Concurrent Equivalences. Electr. Notes Theor. Comput. Sci. 52(1): 32-45 (2001)
1990 – 1999
- 1999
- [j1]Sibylle B. Fröschle: Decidability of Plain and Hereditary History-Preserving Bisimilarity for BPP. Electr. Notes Theor. Comput. Sci. 27: 85-106 (1999)
- [c1]Sibylle B. Fröschle, Thomas T. Hildebrandt: On Plain and Hereditary History-Preserving Bisimulation. MFCS 1999: 354-365
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 10:58 CEST by the dblp team