default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSibylle B. Fröschle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c23]Julius Möller, Sibylle B. Fröschle, Axel Hahn:
Permissioned Blockchain for Data Provenance in Scientific Data Management. Wirtschaftsinformatik 2021- 2020
- [i2]Sibylle B. Fröschle, Martin Kubisch, Marlon Gräfing:
Security Analysis and Design for TAGA: a Touch and Go Assistant in the Aerospace Domain. CoRR abs/2004.02516 (2020)
2010 – 2019
- 2018
- [c22]Jithin Zacharias, Sibylle B. Fröschle:
Misbehavior detection system in VANETs using local traffic density. VNC 2018: 1-4 - 2017
- [c21]Sibylle B. Fröschle, Alexander Stühring:
Analyzing the Capabilities of the CAN Attacker. ESORICS (1) 2017: 464-482 - 2016
- [j7]Sibylle B. Fröschle, Frank D. Valencia:
Preface to special issue: EXPRESS 2010. Math. Struct. Comput. Sci. 26(6): 907 (2016) - [c20]Alexander Stühring, Günter Ehmen, Sibylle B. Fröschle:
Analyzing the impact of injected sensor data on an Advanced Driver Assistance System using the OP2TIMUS prototyping platform. DATE 2016: 523-526 - 2015
- [c19]Sibylle B. Fröschle:
Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems. Correct System Design 2015: 83-98 - [c18]Sibylle B. Fröschle:
Leakiness is Decidable for Well-Founded Protocols. POST 2015: 176-195 - [c17]Nils Müllner, Martin Fränzle, Sibylle B. Fröschle:
Estimating the probability of a timely traffic-hazard warning via simulation. SpringSim (ANSS) 2015: 130-137 - 2014
- [c16]Sibylle B. Fröschle, Alexander Stühring:
Idea: Security Engineering Principles for Day Two Car2X Applications. ESSoS 2014: 213-221 - [c15]Ingo Stierand, Sunil Malipatlolla, Sibylle B. Fröschle, Alexander Stühring, Stefan Henkler:
Integrating the Security Aspect into Design Space Exploration of Embedded Systems. ISSRE Workshops 2014: 371-376 - 2013
- [c14]Christoph Etzien, Tayfun Gezgin, Sibylle B. Fröschle, Stefan Henkler, Achim Rettberg:
Contracts for evolving systems. ISORC 2013: 1-8 - 2012
- [j6]Filippo Bonchi
, Sibylle B. Fröschle, Daniele Gorla, Bartek Klin:
Preface to special issue: EXPRESS, ICE and SOS 2009. Math. Struct. Comput. Sci. 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
- [j5]Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota:
Partially-commutative context-free processes: Expressibility and tractability. Inf. Comput. 209(5): 782-798 (2011) - [c13]Sibylle B. Fröschle, Nils Sommer:
Concepts and Proofs for Configuring PKCS#11. Formal Aspects in Security and Trust 2011: 131-147 - 2010
- [j4]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) - [c12]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:
Proceedings 17th International Workshop on Expressiveness in Concurrency, EXPRESS'10, Paris, France, August 30th, 2010. EPTCS 41, 2010 [contents]
2000 – 2009
- 2009
- [c11]Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota:
Partially-Commutative Context-Free Processes. CONCUR 2009: 259-273 - [c10]Sibylle B. Fröschle, Graham Steel:
Analysing PKCS#11 Key Management APIs with Unbounded Fresh Data. ARSPA-WITS 2009: 92-106 - [c9]Sibylle B. Fröschle, Slawomir Lasota:
Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences. INFINITY 2009: 17-42 - [e1]Sibylle B. Fröschle, Daniele Gorla:
Proceedings 16th International Workshop on Expressiveness in Concurrency, EXPRESS 2009, Bologna, Italy, 5th September 2009. EPTCS 8, 2009 [contents] - 2008
- [c8]Sibylle B. Fröschle:
Adding Branching to the Strand Space Model. EXPRESS 2008: 139-159 - 2007
- [j3]Sibylle B. Fröschle, Slawomir Lasota:
Causality versus true-concurrency. Theor. Comput. Sci. 386(3): 169-187 (2007) - [c7]Sibylle B. Fröschle:
The Insecurity Problem: Tackling Unbounded Data. CSF 2007: 370-384 - 2005
- [j2]Sibylle B. Fröschle:
The decidability border of hereditary history preserving bisimilarity. Inf. Process. Lett. 93(6): 289-293 (2005) - [c6]Sibylle B. Fröschle, Slawomir Lasota:
Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP. CONCUR 2005: 263-277 - [c5]Sibylle B. Fröschle:
Composition and Decomposition in True-Concurrency. FoSSaCS 2005: 333-347 - [c4]Sibylle B. Fröschle, Slawomir Lasota:
Causality Versus True-Concurrency. EXPRESS 2005: 3-18 - 2002
- [j1]Julian C. Bradfield, Sibylle B. Fröschle:
Independence-Friendly Modal Logic and True Concurrency. Nord. J. Comput. 9(1): 102-117 (2002) - 2001
- [c3]Julian C. Bradfield, Sibylle B. Fröschle:
On Logical and Concurrent Equivalences. EXPRESS 2001: 32-45
1990 – 1999
- 1999
- [c2]Sibylle B. Fröschle, Thomas T. Hildebrandt:
On Plain and Hereditary History-Preserving Bisimulation. MFCS 1999: 354-365 - [c1]Sibylle B. Fröschle:
Decidability of Plain and Hereditary History-Preserving Bisimilarity for BPP. EXPRESS 1999: 85-106
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
