default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Schwoon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i5]Giann Karlo Aguirre-Samboní, Stefan Haar, Loïc Paulevé, Stefan Schwoon, Nick Würdemann:
Attractor Basins in Concurrent Systems. CoRR abs/2409.01079 (2024)- 2022
- [c42]Giann Karlo Aguirre-Samboní, Stefan Haar, Loïc Paulevé, Stefan Schwoon, Nick Würdemann:
Avoid One's Doom: Finding Cliff-Edge Configurations in Petri Nets. GandALF 2022: 178-193 - 2020
- [j13]Loïg Jezequel
, Agnes Madalinski, Stefan Schwoon:
Distributed computation of vector clocks in Petri net unfoldings for test selection. Discret. Event Dyn. Syst. 30(3): 441-464 (2020) - [c41]Stefan Haar, Loïc Paulevé, Stefan Schwoon:
Drawing the Line: Basin Boundaries in Safe Petri Nets. CMSB 2020: 321-336 - [c40]Stefan Haar, Serge Haddad, Stefan Schwoon, Lina Ye:
Active Prediction for Discrete Event Systems. FSTTCS 2020: 48:1-48:16
2010 – 2019
- 2018
- [j12]Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon:
The Complexity of Diagnosability and Opacity Verification for Petri Nets. Fundam. Informaticae 161(4): 317-349 (2018) - 2017
- [j11]Stefan Haar, Serge Haddad, Tarek Melliti, Stefan Schwoon:
Optimal constructions for active diagnosis. J. Comput. Syst. Sci. 83(1): 101-120 (2017) - [c39]Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon:
The Complexity of Diagnosability and Opacity Verification for Petri Nets. Petri Nets 2017: 200-220 - 2015
- [j10]Vasileios Germanos, Stefan Haar, Victor Khomenko, Stefan Schwoon:
Diagnosability under Weak Fairness. ACM Trans. Embed. Comput. Syst. 14(4): 69:1-69:19 (2015) - [c38]Thomas Chatain, Stefan Haar, Maciej Koutny, Stefan Schwoon:
Non-atomic Transition Firing in Contextual Nets. Petri Nets 2015: 117-136 - [c37]Stanislav Böhm, Stefan Haar, Serge Haddad, Piotr Hofman, Stefan Schwoon:
Active diagnosis with observable quiescence. CDC 2015: 1663-1668 - [c36]Konstantinos Athanasiou, Hernán Ponce de León, Stefan Schwoon:
Test Case Generation for Concurrent Systems Using Event Structures. TAP@STAF 2015: 19-37 - 2014
- [c35]Vasileios Germanos, Stefan Haar, Victor Khomenko, Stefan Schwoon:
Diagnosability under Weak Fairness. ACSD 2014: 132-141 - [c34]Thomas Chatain, Stefan Haar, Loïg Jezequel, Loïc Paulevé, Stefan Schwoon:
Characterization of Reachable Attractors Using Petri Net Unfoldings. CMSB 2014: 129-142 - [c33]Rohit Chadha, Umang Mathur, Stefan Schwoon:
Computing Information Flow Using Symbolic Model-Checking. FSTTCS 2014: 505-516 - 2013
- [b2]Stefan Schwoon:
Efficient verification of sequential and concurrent systems. École normale supérieure de Cachan, France, 2013 - [j9]Stefan Haar, Christian Kern, Stefan Schwoon:
Computing the reveals relation in occurrence nets. Theor. Comput. Sci. 493: 66-79 (2013) - [c32]Stefan Haar, César Rodríguez, Stefan Schwoon:
Reveal Your Faults: It's Only Fair! ACSD 2013: 120-129 - [c31]César Rodríguez, Stefan Schwoon, Victor Khomenko:
Contextual Merged Processes. Petri Nets 2013: 29-48 - [c30]César Rodríguez, Stefan Schwoon:
Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs. ATVA 2013: 492-495 - [c29]César Rodríguez, Stefan Schwoon:
An Improved Construction of Petri Net Unfoldings. FSFMA 2013: 47-52 - [c28]Javier Esparza, Loïg Jezequel, Stefan Schwoon:
Computation of Summaries Using Net Unfoldings. FSTTCS 2013: 225-236 - [c27]Stefan Haar, Serge Haddad, Tarek Melliti, Stefan Schwoon:
Optimal Constructions for Active Diagnosis. FSTTCS 2013: 527-539 - [i4]Javier Esparza, Loïg Jezequel, Stefan Schwoon:
Computation of Summaries Using Net Unfoldings. CoRR abs/1310.2143 (2013) - 2012
- [j8]Paolo Baldan, Alessandro Bruni, Andrea Corradini, Barbara König, César Rodríguez, Stefan Schwoon:
Efficient unfolding of contextual Petri nets. Theor. Comput. Sci. 449: 2-22 (2012) - [c26]César Rodríguez, Stefan Schwoon:
Verification of Petri Nets with Read Arcs. CONCUR 2012: 471-485 - 2011
- [c25]César Rodríguez, Stefan Schwoon, Paolo Baldan:
Efficient Contextual Unfolding. CONCUR 2011: 342-357 - [c24]Stefan Schwoon, César Rodríguez:
Construction and SAT-Based Verification of Contextual Unfoldings. DCFS 2011: 34-42 - [c23]Stefan Haar, Christian Kern, Stefan Schwoon:
Computing the Reveals Relation in Occurrence Nets. GandALF 2011: 31-44 - 2010
- [c22]Paolo Baldan, Alessandro Bruni, Andrea Corradini, Barbara König, Stefan Schwoon:
On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars. ICGT 2010: 91-106
2000 – 2009
- 2009
- [c21]Morten Kühnrich, Stefan Schwoon, Jirí Srba, Stefan Kiefer:
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains. FoSSaCS 2009: 440-455 - [c20]Andreas Gaiser, Stefan Schwoon:
Comparison of Algorithms for Checking Emptiness on Büchi Automata. MEMICS 2009 - [i3]Morten Kühnrich, Stefan Schwoon, Jirí Srba, Stefan Kiefer:
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains. CoRR abs/0901.0501 (2009) - [i2]Andreas Gaiser, Stefan Schwoon:
Comparison of Algorithms for Checking Emptiness on Buechi Automata. CoRR abs/0910.3766 (2009) - 2008
- [j7]Javier Esparza, Stefan Kiefer, Stefan Schwoon:
Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems. J. Satisf. Boolean Model. Comput. 5(1-4): 27-56 (2008) - [j6]Javier Esparza, Pradeep Kanade, Stefan Schwoon:
A negative result on depth-first net unfoldings. Int. J. Softw. Tools Technol. Transf. 10(2): 161-166 (2008) - [j5]Paolo Baldan, Andrea Corradini, Barbara König, Stefan Schwoon:
McMillan's Complete Prefix for Contextual Nets. Trans. Petri Nets Other Model. Concurr. 1: 199-220 (2008) - [c19]Dejvuth Suwimonteerabuth, Javier Esparza, Stefan Schwoon:
Symbolic Context-Bounded Analysis of Multithreaded Java Programs. SPIN 2008: 270-287 - [c18]Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Dejvuth Suwimonteerabuth:
SDSIrep: A Reputation System Based on SDSI. TACAS 2008: 501-516 - 2007
- [c17]Dejvuth Suwimonteerabuth, Felix Berger, Stefan Schwoon, Javier Esparza:
jMoped: A Test Environment for Java Programs. CAV 2007: 164-167 - 2006
- [c16]Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier Esparza:
Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains. ATVA 2006: 141-153 - [c15]Prasad Naldurg, Stefan Schwoon, Sriram K. Rajamani, John Lambert:
NETRA: : seeing through access control. FMSE 2006: 55-66 - [c14]Hao Wang, Somesh Jha, Thomas W. Reps, Stefan Schwoon, Stuart G. Stubblebine:
Reducing the Dependence of SPKI/SDSI on PKI. ESORICS 2006: 156-173 - [c13]Somesh Jha, Stefan Schwoon, Hao Wang, Thomas W. Reps:
Weighted Pushdown Systems and Trust-Management Systems. TACAS 2006: 1-26 - [c12]Javier Esparza, Stefan Kiefer, Stefan Schwoon:
Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems. TACAS 2006: 489-503 - [i1]Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Jan Strejcek:
Reachability analysis of multithreaded software with asynchronous communication. Software Verification: Infinite-State Model Checking and Static Program Analysis 2006 - 2005
- [j4]Thomas W. Reps, Stefan Schwoon, Somesh Jha, David Melski:
Weighted pushdown systems and their application to interprocedural dataflow analysis. Sci. Comput. Program. 58(1-2): 206-263 (2005) - [c11]Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Jan Strejcek:
Reachability Analysis of Multithreaded Software with Asynchronous Communication. FSTTCS 2005: 348-359 - [c10]Javier Esparza, Pierre Ganty, Stefan Schwoon:
Locality-Based Abstractions. SAS 2005: 118-134 - [c9]Stefan Schwoon, Javier Esparza:
A Note on On-the-Fly Verification Algorithms. TACAS 2005: 174-190 - [c8]Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier Esparza:
jMoped: A Java Bytecode Checker Based on Moped. TACAS 2005: 541-545 - 2004
- [j3]Markus Holzer, Stefan Schwoon:
Assembling molecules in ATOMIX is hard. Theor. Comput. Sci. 313(3): 447-462 (2004) - 2003
- [j2]Javier Esparza, Antonín Kucera, Stefan Schwoon:
Model checking LTL with regular valuations for pushdown systems. Inf. Comput. 186(2): 355-376 (2003) - [c7]Claus Schröter, Stefan Schwoon, Javier Esparza:
The Model-Checking Kit. ICATPN 2003: 463-472 - [c6]Stefan Schwoon, Somesh Jha, Thomas W. Reps, Stuart G. Stubblebine:
On Generalized Authorization Problems. CSFW 2003: 202- - [c5]Thomas W. Reps, Stefan Schwoon, Somesh Jha:
Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis. SAS 2003: 189-213 - 2002
- [b1]Stefan Schwoon:
Model checking pushdown systems. Technical University Munich, Germany, 2002, pp. 1-202 - 2001
- [c4]Javier Esparza, Stefan Schwoon:
A BDD-Based Model Checker for Recursive Programs. CAV 2001: 324-336 - [c3]Stefan Schwoon:
Determinization and Complementation of Streett Automata. Automata, Logics, and Infinite Games 2001: 79-91 - [c2]Javier Esparza, Antonín Kucera, Stefan Schwoon:
Model-Checking LTL with Regular Valuations for Pushdown Systems. TACS 2001: 316-339 - 2000
- [j1]Javier Esparza, Peter Rossmanith, Stefan Schwoon:
A Uniform Framework for Problems on Context-Free Grammars. Bull. EATCS 72: 169-177 (2000) - [c1]Javier Esparza, David Hansel, Peter Rossmanith, Stefan Schwoon:
Efficient Algorithms for Model Checking Pushdown Systems. CAV 2000: 232-247
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-10-07 02:35 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:
