Publications : Stefan SCHWOON

[HHSY20]
S. Haar, S. Haddad, S. Schwoon, and L. Ye. Active Prediction for Discrete Event Systems. In Proceedings of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'20), volume 182 of Leibniz International Proceedings in Informatics, pages 48:1--48:16, Goa, India, December 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.FSTTCS.2020.48.
BibTex | DOI | Web page | PDF ]
[HPS20]
S. Haar, L. Paulevé, and S. Schwoon. Drawing the Line: Basin Boundaries in Safe Petri Nets. In Proceedings of the 18th Conference on Computational Methods in System Biology (CMSB'20), volume 12314 of Lecture Notes in Bioinformatics, pages 321--336, held online, September 2020. Springer-Verlag.
doi: 10.1007/978-3-030-60327-4_17.
BibTex | DOI ]
[JMS20]
L. Jezequel, A. Madalinski, and S. Schwoon. Distributed computation of vector clocks in Petri net unfoldings for test selection. Discrete Event Dynamic Systems: Theory and Applications, 30(3):441--464, 2020.
BibTex ]
[JMS18]
L. Jezequel, A. Madalinski, and S. Schwoon. Distributed computation of vector clocks in Petri nets unfolding for test selection. In Proceedings of the 14th Workshop on Discrete Event Systems (WODES'18), volume 51(7) of IFAC-PapersOnLine, pages 106--111, Sorrento Coast, Italy, May-June 2018. Elsevier Science Publishers.
BibTex | PDF ]
[BHSS18]
B. Bérard, S. Haar, S. Schmitz, and S. Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets. Fundamenta Informaticae, 161(4):317--349, 2018.
doi: 10.3233/FI-2018-1706.
BibTex | DOI | Web page ]
[BHSS17]
B. Bérard, S. Haar, S. Schmitz, and S. Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets. In Proceedings of the 38th International Conference on Applications and Theory of Petri Nets (PETRI NETS'17), volume 10258 of Lecture Notes in Computer Science, pages 200--220, Zaragoza, Spain, June 2017. Springer.
doi: 10.1007/978-3-319-57861-3_13.
BibTex | DOI | Web page ]
[HHMS17]
S. Haar, S. Haddad, T. Melliti, and S. Schwoon. Optimal constructions for active diagnosis. Journal of Computer and System Sciences, 83(1):101--120, 2017.
doi: 10.1016/j.jcss.2016.04.007.
BibTex | DOI | PDF ]
[GHKS15]
V. Germanos, S. Haar, V. Khomenko, and S. Schwoon. Diagnosability under Weak Fairness. ACM Transactions in Embedded Computing Systems, 14(4:69), December 2015.
doi: 10.1145/2832910.
BibTex | DOI | Web page | PDF ]
[BHH+15]
S. Böhm, S. Haar, S. Haddad, P. Hofman, and S. Schwoon. Active Diagnosis with Observable Quiescence. In Proceedings of the 54th IEEE Conference on Decision and Control (CDC'15), pages 1663--1668, Osaka, Japan, December 2015. IEEE Control System Society.
doi: 10.1109/CDC.2015.7402449.
BibTex | DOI | Web page | PDF ]
[APS15]
K. Athanasiou, H. Ponce de León, and S. Schwoon. Test Case Generation for Concurrent Systems Using Event Structures. In Proceedings of the 9th International Conference on Tests and Proofs (TAP'15), volume 9154 of Lecture Notes in Computer Science, pages 19--37, L'Aquila, Italy, July 2015. Springer.
doi: 10.1007/978-3-319-21215-9_2.
BibTex | DOI | Web page | PDF ]
[CHKS15]
Th. Chatain, S. Haar, M. Koutny, and S. Schwoon. Non-Atomic Transition Firing in Contextual Nets. In Proceedings of the 36th International Conference on Applications and Theory of Petri Nets (PETRI NETS'15), volume 9115 of Lecture Notes in Computer Science, pages 117--136, Brussels, Belgium, June 2015. Springer.
doi: 10.1007/978-3-319-19488-2_6.
BibTex | DOI | Web page | PDF ]
[CMS14]
R. Chadha, U. Mathur, and S. Schwoon. Computing Information Flow Using Symbolic Model-Checking. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics, pages 505--516, New Dehli, India, December 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2014.505.
BibTex | DOI | Web page | PDF ]
[CHJ+14]
Th. Chatain, S. Haar, L. Jezequel, L. Paulevé, and S. Schwoon. Characterization of Reachable Attractors Using Petri Net Unfoldings. In Proceedings of the 12th Conference on Computational Methods in System Biology (CMSB'14), volume 8859 of Lecture Notes in Bioinformatics, pages 129--142, Manchester, UK, November 2014. Springer-Verlag.
doi: 10.1007/978-3-319-12982-2_10.
BibTex | DOI | Web page | PDF ]
[GHKS14]
V. Germanos, S. Haar, V. Khomenko, and S. Schwoon. Diagnosability under Weak Fairness. In Proceedings of the 14th International Conference on Application of Concurrency to System Design (ACSD'14), pages 132--141, Tunis, Tunisia, June 2014. IEEE Computer Society Press.
doi: 10.1109/ACSD.2014.9.
BibTex | DOI | Web page | PDF ]
[Sch13]
S. Schwoon. Efficient verification of sequential and concurrent systems. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, December 2013.
BibTex | Web page | PDF ]
[HHMS13]
S. Haar, S. Haddad, T. Melliti, and S. Schwoon. Optimal Constructions for Active Diagnosis. In Proceedings of the 33rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'13), volume 24 of Leibniz International Proceedings in Informatics, pages 527--539, Guwahati, India, December 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2013.527.
BibTex | DOI | Web page | PDF ]
[EJS13]
J. Esparza, L. Jezequel, and S. Schwoon. Computation of summaries using net unfoldings. In Proceedings of the 33rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'13), volume 24 of Leibniz International Proceedings in Informatics, pages 225--236, Guwahati, India, December 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2013.225.
BibTex | DOI | Web page | PDF ]
[RS13a]
C. Rodríguez and S. Schwoon. Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs. In Proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis (ATVA'13), volume 8172 of Lecture Notes in Computer Science, pages 492--495, Hanoi, Vietnam, October 2013. Springer.
doi: 10.1007/978-3-319-02444-8_42.
BibTex | DOI | Web page | PDF ]
[RS13b]
C. Rodríguez and S. Schwoon. An Improved Construction of Petri Net Unfoldings. In Proceedings of the 1st French-Singaporean Workshop on Formal Methods and Applications (FSFMA'13), volume 31 of Open Access Series in Informatics, pages 47--52, Singapore, July 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/OASIcs.FSFMA.2013.47.
BibTex | DOI | Web page | PDF ]
[HRS13]
S. Haar, C. Rodríguez, and S. Schwoon. Reveal Your Faults: It's Only Fair! In Proceedings of the 13th International Conference on Application of Concurrency to System Design (ACSD'13), pages 120--129, Barcelona, Spain, July 2013. IEEE Computer Society Press.
doi: 10.1109/ACSD.2013.15.
BibTex | DOI | Web page | PDF ]
[HKS13]
S. Haar, C. Kern, and S. Schwoon. Computing the Reveals Relation in Occurrence Nets. Theoretical Computer Science, 493:66--79, July 2013.
doi: 10.1016/j.tcs.2013.04.028.
BibTex | DOI | Web page | PDF ]
[RSK13]
C. Rodríguez, S. Schwoon, and V. Khomenko. Contextual Merged Processes. In Proceedings of the 34th International Conference on Applications and Theory of Petri Nets (PETRI NETS'13), volume 7927 of Lecture Notes in Computer Science, pages 29--48, Milano, Italy, June 2013. Springer.
doi: 10.1007/978-3-642-38697-8_3.
BibTex | DOI | Web page | PDF ]
[RS12]
C. Rodríguez and S. Schwoon. Verification of Petri Nets with Read Arcs. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 471--485, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_33.
BibTex | DOI | Web page | PDF ]
[BBC+12]
P. Baldan, A. Bruni, A. Corradini, B. König, C. Rodríguez, and S. Schwoon. Efficient unfolding of contextual Petri nets. Theoretical Computer Science, 449(1):2--22, August 2012.
doi: 10.1016/j.tcs.2012.04.046.
BibTex | DOI | Web page | PDF ]
[RSB11]
C. Rodríguez, S. Schwoon, and P. Baldan. Efficient contextual unfolding. In Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR'11), volume 6901 of Lecture Notes in Computer Science, pages 342--357, Aachen, Germany, September 2011. Springer.
doi: 10.1007/978-3-642-23217-6_23.
BibTex | DOI | Web page | PDF ]
[SR11]
S. Schwoon and C. Rodríguez. Construction and SAT-based verification of Contextual Unfoldings. In Proceedings of the 13th International Workshop on Descriptional Complexity of Formal Systems (DCFS'11), volume 6808 of Lecture Notes in Computer Science, pages 34--42, Limburg, Germany, July 2011. Springer.
doi: 10.1007/978-3-642-22600-7_3.
BibTex | DOI | Web page | PDF ]
[HKS11]
S. Haar, C. Kern, and S. Schwoon. Computing the Reveals Relation in Occurrence Nets. In Proceedings of the 2nd International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'11), volume 54 of Electronic Proceedings in Theoretical Computer Science, pages 31--44, Minori, Italy, June 2011.
doi: 10.4204/EPTCS.54.3.
BibTex | DOI | Web page | PDF ]
[RS11]
C. Rodríguez and S. Schwoon. Cunf, February 2011.
BibTex | Web page ]
[BBC+10]
P. Baldan, A. Bruni, A. Corradini, B. König, and S. Schwoon. On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars. In Proceedings of the 5th International Conference on Graph Transformations (ICGT'10), volume 6372 of Lecture Notes in Computer Science, pages 91--106, Enschede, The Netherlands, September-October 2010. Springer.
doi: 10.1007/978-3-642-15928-2_7.
BibTex | DOI | Web page | PDF ]
[GS09]
A. Gaiser and S. Schwoon. Comparison of algorithms for checking emptiness on Büchi automata. In Proceedings of the 5th Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09), Znojmo, Czech Republic, November 2009.
BibTex | Web page | PDF ]
[KSSK09]
M. Kühnrich, S. Schwoon, J. Srba, and S. Kiefer. Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains. In Proceedings of the 12th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'09), volume 5504 of Lecture Notes in Computer Science, pages 440--455, York, UK, March 2009. Springer.
doi: 10.1007/978-3-642-00596-1_31.
BibTex | DOI | Web page | PDF ]
[BCKS08]
P. Baldan, A. Corradini, B. König, and S. Schwoon. McMillan's complete prefix for contextual nets. In Transactions on Petri Nets and Other Models of Concurrency I, volume 5100 of Lecture Notes in Computer Science, pages 199--220. Springer, November 2008.
doi: 10.1007/978-3-540-89287-8_12.
BibTex | DOI | Web page | PS ]
[SES08]
D. Suwimonteerabuth, J. Esparza, and S. Schwoon. Symbolic Context-Bounded Analysis of Multithreaded Java Programs. In Proceedings of the 15th International SPIN Workshop on Model Checking Software (SPIN'08), volume 5156 of Lecture Notes in Computer Science, pages 270--287, Los Angeles, California, USA, August 2008. Springer.
doi: 10.1007/978-3-540-85114-1_19.
BibTex | DOI | Web page | PDF ]
[SS08]
M. Sachenbacher and S. Schwoon. Model-based Test Generation using Quantified CSPs: A Map. In Proceedings of the ECAI'08 Workshop on Model-Based Systems (MBS'08), pages 37--41, Patras, Greece, July 2008.
BibTex ]
[EKS08b]
J. Esparza, S. Kiefer, and S. Schwoon. Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems. Journal on Satisfiability, Boolean Modeling and Computation, 5:27--56, June 2008.
BibTex | Web page | PDF ]
[EKS08a]
J. Esparza, P. Kanade, and S. Schwoon. A Negative Result on Depth-First Unfoldings. International Journal on Software Tools for Technology Transfer, 10(2):161--166, March 2008.
doi: 10.1007/s10009-007-0030-5.
BibTex | DOI | Web page | PS ]
[BESS08]
A. Bouajjani, J. Esparza, S. Schwoon, and D. Suwimonteerabuth. SDSIrep: A Reputation System based on SDSI. In Proceedings of the 14th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'08), volume 4963 of Lecture Notes in Computer Science, pages 501--516, Budapest, Hungary, March-April 2008. Springer.
doi: 10.1007/978-3-540-78800-3_39.
BibTex | DOI | Web page | PS ]
[SBSE07]
D. Suwimonteerabuth, F. Berger, S. Schwoon, and J. Esparza. jMoped: A Test Environment for Java programs. In Proceedings of the 19th International Conference on Computer Aided Verification (CAV'07), volume 4590 of Lecture Notes in Computer Science, pages 164--167, Berlin, Germany, July 2007. Springer.
doi: 10.1007/978-3-540-73368-3_19.
BibTex | DOI | Web page | PS ]
[BCKS07]
P. Baldan, A. Corradini, B. König, and S. Schwoon. McMillan's complete prefix for contextual nets. In Proceedings of the Workshop on UnFOlding and partial order techniques (UFO'07), pages 32--49, Siedlce, Poland, June 2007. Publishing House of University of Podlasie.
BibTex | Web page | PS ]
[NSRL06]
P. Naldurg, S. Schwoon, S. Rajamani, and J. Lambert. NETRA: Seeing Through Access Control. In Proceedings of the 4th ACM Workshop on Formal Methods in Security Engineering (FMSE'06), pages 55--66, Alexandria, Virginia, USA, November 2006. ACM Press.
doi: 10.1145/1180337.1180343.
BibTex | DOI | Web page | PDF ]
[SSE06]
D. Suwimonteerabuth, S. Schwoon, and J. Esparza. Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains. In Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), volume 4218 of Lecture Notes in Computer Science, pages 141--153, Beijing, China, October 2006. Springer.
doi: 10.1007/11901914_13.
BibTex | DOI | Web page | PDF ]
[WJR+06]
H. Wang, S. Jha, T. Reps, S. Schwoon, and S. Stubblebine. Reducing the Dependence of SPKIashSDSI on PKI. In Proceedings of the 11th European Symposium on Research in Computer Security (ESORICS'06), volume 4189 of Lecture Notes in Computer Science, pages 156--173, Hamburg, Germany, September 2006. Springer.
doi: 10.1007/11863908_11.
BibTex | DOI | Web page | PDF ]
[EKS06]
J. Esparza, S. Kiefer, and S. Schwoon. Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems. In Proceedings of the 12th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'06), volume 3920 of Lecture Notes in Computer Science, pages 489--503, Vienna, Austria, March 2006. Springer.
doi: 10.1007/11691372_35.
BibTex | DOI | Web page | PS | PDF ]
[JSWR06]
S. Jha, S. Schwoon, H. Wang, and T. Reps. Weighted Pushdown Systems and Trust-Management Systems. In Proceedings of the 12th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'06), volume 3920 of Lecture Notes in Computer Science, pages 1--26, Vienna, Austria, March 2006. Springer.
doi: 10.1007/11691372_1.
BibTex | DOI | Web page | PDF ]
[BESS05]
A. Bouajjani, J. Esparza, S. Schwoon, and J. Strejček. Reachability analysis of multithreaded software with asynchronous communication. In Proceedings of the 25th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'05), volume 3821 of Lecture Notes in Computer Science, pages 348--359, Hyderabad, India, December 2005. Springer.
doi: 10.1007/11590156_28.
BibTex | DOI | Web page | PS ]
[RSJM05]
T. Reps, S. Schwoon, S. Jha, and D. Melski. Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis. Science of Computer Programming, 58(1-2):206--263, October 2005.
doi: 10.1016/j.scico.2005.02.009.
BibTex | DOI | Web page | PS ]
[EGS05]
J. Esparza, P. Ganty, and S. Schwoon. Locality-Based Abstractions. In Proceedings of the 12th International Symposium Static Analysis (SAS'05), volume 3672 of Lecture Notes in Computer Science, pages 118--134, London, UK, September 2005. Springer.
doi: 10.1007/11547662_10.
BibTex | DOI | Web page | PDF ]
[SE05]
S. Schwoon and J. Esparza. A Note on On-The-Fly Verification Algorithms. In Proceedings of the 11th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'05), volume 3440 of Lecture Notes in Computer Science, pages 174--190, Edinburgh, Scotland, UK, April 2005. Springer.
BibTex | Web page | PS ]
[SSE05]
D. Suwimonteerabuth, S. Schwoon, and J. Esparza. jMoped: A Java bytecode checker based on Moped. In Proceedings of the 11th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'05), volume 3440 of Lecture Notes in Computer Science, pages 541--545, Edinburgh, Scotland, UK, April 2005. Springer.
BibTex | Web page | PS ]
[HS04b]
M. Holzer and S. Schwoon. Reflections on Reflexion -- Computational Complexity Considerations on a Puzzle Game. In Proceedings of the 3rd International Conference on Fun with Algorithms (FUN'04), pages 90--105, Isola d'Elba, Italy, May 2004. Edizioni Plus, Università di Pisa.
BibTex | Web page | PS ]
[HS04a]
M. Holzer and S. Schwoon. Assembling Molecules in Atomix is Hard. Theoretical Computer Science, 303(3):447--462, February 2004.
BibTex | Web page | PDF ]
[EKS03]
J. Esparza, A. Kučera, and S. Schwoon. Model-Checking LTL with Regular Valuations for Pushdown Systems. Information and Computation, 186(2):355--376, November 2003.
BibTex | Web page | PS ]
[RSJ03]
T. Reps, S. Schwoon, and S. Jha. Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis. In Proceedings of the 10th International Symposium Static Analysis (SAS'03), volume 2694 of Lecture Notes in Computer Science, pages 189--213, San Diego, California, USA, June 2003. Springer.
BibTex | Web page | PS ]
[SJRS03]
S. Schwoon, S. Jha, T. Reps, and S. Stubblebine. On Generalized Authorization Problems. In Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW'03), pages 202--218, Pacific Grove, California, USA, June-July 2003. IEEE Computer Society Press.
BibTex | Web page | PS | PDF ]
[SSE03]
C. Schröter, S. Schwoon, and J. Esparza. The Model-Checking Kit. In Proceedings of the 24th International Conference on Applications and Theory of Petri Nets (ICATPN'03), volume 2679 of Lecture Notes in Computer Science, pages 463--472, Eindhoven, The Netherlands, June 2003. Springer.
BibTex | Web page | PS ]
[BHKS03]
W. Brauer, M. Holzer, B. König, and S. Schwoon. The Theory of Finite-State Adventures. EATCS Bulletin, 79:230--237, February 2003.
BibTex | Web page | PS ]
[SSE02]
C. Schröter, S. Schwoon, and J. Esparza. The Model-Checking Kit. In Proceedings of the Tools Day Workshop, pages 22--31, Brno, Czech Republic, August 2002. Uppsala University.
BibTex | Web page | PS ]
[Sch02b]
S. Schwoon. Model-Checking Pushdown Systems. Ph.D. Thesis, Technische Universität München, June 2002.
BibTex | Web page | PS | PDF ]
[Sch02a]
S. Schwoon. Determinization and Complementation of Streett Automata. In Automata, Logics, and Infinite Game: A Guide to Current Research, volume 2500 of Lecture Notes in Computer Science, pages 79--91. Springer, 2002.
BibTex ]
[EKS01]
J. Esparza, A. Kučera, and S. Schwoon. Model-Checking LTL with Regular Valuations for Pushdown Systems. In Proceedings of the 4th International Workshop on Theoretical Aspects of Computer Software (TACS'01), volume 2215 of Lecture Notes in Computer Science, pages 306--339, Sendai, Japan, October 2001. Springer.
BibTex | Web page | PS ]
[ES01]
J. Esparza and S. Schwoon. A BDD-based Model Checker for Recursive Programs. In Proceedings of the 13th International Conference on Computer Aided Verification (CAV'01), volume 2102 of Lecture Notes in Computer Science, pages 324--336, Paris, France, July 2001. Springer.
BibTex | Web page | PS ]
[ERS00]
J. Esparza, P. Rossmanith, and S. Schwoon. A Uniform Framework for Problems on Context-Free Grammars. EATCS Bulletin, 72:169--177, October 2000.
BibTex | Web page | PS ]
[EHRS00]
J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient Algorithms for Model Checking Pushdown Systems. In Proceedings of the 12th International Conference on Computer Aided Verification (CAV 2000), volume 1855 of Lecture Notes in Computer Science, pages 232--247, Chicago, Illinois, USA, July 2000. Springer.
BibTex | Web page | PS ]
[Sch98]
S. Schwoon. Übersetzung von SDL-Spezifikationen in Petri-Netze. Master's Thesis, Universität Hildesheim, August 1998.
BibTex | Web page | PS ]

This file was generated by bibtex2html 1.98.

About LSV