Preliminary Reports

Sibylle Fröschle and Nils Sommer (2011).
When is a PKCS#11 Configuration Secure? A preliminary version of the full implementation of the verification approach put forward in the FAST'10 paper with an investigation of the `wrap-with-trusted' feature.    pdf  

Publications

• Filippo Bonchi, Sibylle Fröschle, Daniele Gorla and Bartek Klin (2012).
  Special Issue: EXPRESS'09, ICE'09 and SOS'09
  Mathematical Structures in Computer Science 22:2, 2012.
   
• Sibylle Fröschle and Nils Sommer (2011).
  Concepts and Proofs for Configuring PKCS#11
  Proceedings of FAST'11, to appear in LNCS.    pdf   © Springer       slides
   
• Sibylle Fröschle and Nils Sommer (2011).
  Reasoning with Past to Prove PKCS#11 Keys Secure.
  Proceedings of FAST'10, LNCS 6561, pp. 96-110.    pdf   © Springer       slides
   
  Submitted version with appendix:   pdf  
   
• Wojciech Czerwińsk, Sibylle Fröschle, Sławomir Lasota (2011).
  Partially-Commutative Context-Free Processes: Expressibility and Tractability
  Information and Computation 209(5): 782-798.    preprint pdf   © Elsevier
   
• Sibylle Fröschle and Frank D. Valencia (2010).
  Proceedings of EXPRESS'10, EPTCS 41.
   
• Sibylle Fröschle, Petr Jančar, Sławomir Lasota, Zdeněk Sawa (2010).
  Non-Interleaving Bisimulation Equivalences on Basic Parallel Processes.
  Information and Computation 208(1): 42-62.    preprint pdf   © Elsevier
   
• Sibylle Fröschle and Daniele Gorla (2009).
  Proceedings of EXPRESS'09, EPTCS 8.
   
• Wojciech Czerwińsk, Sibylle Fröschle, Sławomir Lasota (2009).
  Partially-Commutative Context-Free Processes.
  Proceedings of CONCUR'09, LNCS 5710, pp. 259-273.   
   
• Sibylle Fröschle and Graham Steel (2009).
  Analysing PKCS#11 Key Management APIs with Unbounded Fresh Data.
  Proceedings of ARSPA-WITS'09, LNCS 5511, pp. 92-106.    pdf   © Springer
   
• Sibylle Fröschle (2009).
  Adding Branching to the Strand Space Model.
  Proceedings of EXPRESS'08, ENTCS 242(1).    pdf   © Elsevier
   
• Sibylle Fröschle (2007).
  The Insecurity Problem: Tackling Unbounded Data.
  Proceedings of the IEEE Computer Security Foundations Symposium 2007.    pdf   © IEEE Computer Society
   
• Sibylle Fröschle and Sławomir Lasota (2007).
  Causality Versus True-Concurrency.
  Theoretical Computer Science 386(3):169-187.    preprint pdf   © Elsevier
   
• Sibylle Fröschle and Sławomir Lasota (2009).
  Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences.
  Proceedings of INFINITY'06, ENTCS 239.    pdf   © Elsevier
   
• Sibylle Fröschle and Sławomir Lasota (2006).
  Causality Versus True-Concurrency.
  Proceedings of EXPRESS'05, Volume 154, Issue 3 of ENTCS, pp. 3-18.    pdf  
   
• Sibylle Fröschle and Sławomir Lasota (2005).
  Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP.
  Proceedings of CONCUR'05, LNCS 3656, pp. 263-277.    ps   pdf   © Springer
   
  Full version:   Informatics Report 280, Warsaw University.    ps  
   
• Sibylle Fröschle (2005).
  Composition and Decomposition in True-Concurrency.
  Proceedings of FOSSACS'05, LNCS 3441, pp. 333-347.    ps   pdf   © Springer
   
  Full version:   Informatics Report 276, Warsaw University.    ps   pdf
   
• Sibylle Fröschle (2005).
  The Decidability Border of Hereditary History Preserving Bisimilarity.
  Information Processing Letters 93(6):289-293.    ps   pdf   © Elsevier
   
• Sibylle Fröschle (2004).
  The Decidability of Hereditary History Preserving Bisimilarity on Trace-Labelled Systems is Unresolved.
  Report EDI-INF-RR-0231, University of Edinburgh.   ps  pdf
   
• Sibylle Fröschle (2004).
  Hereditary History Preserving Bisimilarity Coincides with History Preserving Bisimilarity for a Class of Live Free Choice Systems.
  Report EDI-INF-RR-0190, University of Edinburgh.   ps.gz  pdf
   
• Sibylle Fröschle (2004).
  Decidability and Coincidence of Equivalences for Concurrency.
  PhD thesis.   ps.gz  pdf
   
• Julian C. Bradfield, Sibylle Fröschle (2002).
  Independence-Friendly Modal Logic and True Concurrency.
  Nordic Journal of Computing 9(2002):102-117.
   
• Julian C. Bradfield, Sibylle Fröschle (2001).
  On Logical and Concurrent Equivalences.
  Proceedings of EXPRESS'01, volume 52 of ENTCS.
   
• Sibylle Fröschle (1999).
  Decidability of Plain and Hereditary History-Preserving Bisimulation for BPP.
  Proceedings of EXPRESS'99, volume 27 of ENTCS.
   
• Sibylle Fröschle, Thomas T. Hildebrandt (1999).
  On Plain and Hereditary History-Preserving Bisimulation.
  Proceedings of MFCS'99, LNCS 1672.
  Full version available as BRICS Report, RS-99-4.