Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Stefan Gulan
@inproceedings{DBLP:conf/safecomp/GulanHJKRZ15, author = {Stefan Gulan and Jens Harnisch and Sven Johr and Roberto Kretschmer and Stefan Rieger and Rafael Zalman}, editor = {Floor Koornneef and Coen van Gulijk}, title = {Model-Based Analysis for Safety Critical Software}, booktitle = {Computer Safety, Reliability, and Security - 34th International Conference, {SAFECOMP} 2015 Delft, The Netherlands, September 23-25, 2015. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9337}, pages = {111--120}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-24255-2\_9}, doi = {10.1007/978-3-319-24255-2\_9}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/safecomp/GulanHJKRZ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icse/BeckGBBW14, author = {Fabian Beck and Stefan Gulan and Benjamin Biegel and Sebastian Baltes and Daniel Weiskopf}, editor = {Pankaj Jalote and Lionel C. Briand and Andr{\'{e}} van der Hoek}, title = {RegViz: visual debugging of regular expressions}, booktitle = {36th International Conference on Software Engineering, {ICSE} '14, Companion Proceedings, Hyderabad, India, May 31 - June 07, 2014}, pages = {504--507}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2591062.2591111}, doi = {10.1145/2591062.2591111}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icse/BeckGBBW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/Gulan13, author = {Stefan Gulan}, title = {Series Parallel Digraphs with Loops - Graphs Encoded by Regular Expression}, journal = {Theory Comput. Syst.}, volume = {53}, number = {2}, pages = {126--158}, year = {2013}, url = {https://doi.org/10.1007/s00224-012-9409-0}, doi = {10.1007/S00224-012-9409-0}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/Gulan13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/indin/GulanJKRD13, author = {Stefan Gulan and Sven Johr and Roberto Kretschmer and Stefan Rieger and Michael Ditze}, title = {Graphical modelling meets formal methods}, booktitle = {11th {IEEE} International Conference on Industrial Informatics, {INDIN} 2013, Bochum, Germany, July 29-31, 2013}, pages = {716--721}, publisher = {{IEEE}}, year = {2013}, url = {https://doi.org/10.1109/INDIN.2013.6622972}, doi = {10.1109/INDIN.2013.6622972}, timestamp = {Wed, 16 Oct 2019 14:14:52 +0200}, biburl = {https://dblp.org/rec/conf/indin/GulanJKRD13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Gulan11, author = {Stefan Gulan}, editor = {Thomas Schwentick and Christoph D{\"{u}}rr}, title = {Graphs Encoded by Regular Expressions}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2011, March 10-12, 2011, Dortmund, Germany}, series = {LIPIcs}, volume = {9}, pages = {495--506}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2011}, url = {https://doi.org/10.4230/LIPIcs.STACS.2011.495}, doi = {10.4230/LIPICS.STACS.2011.495}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/stacs/Gulan11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lata/GruberG10, author = {Hermann Gruber and Stefan Gulan}, editor = {Adrian{-}Horia Dediu and Henning Fernau and Carlos Mart{\'{\i}}n{-}Vide}, title = {Simplifying Regular Expressions}, booktitle = {Language and Automata Theory and Applications, 4th International Conference, {LATA} 2010, Trier, Germany, May 24-28, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6031}, pages = {285--296}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13089-2\_24}, doi = {10.1007/978-3-642-13089-2\_24}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/lata/GruberG10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/GulanF08, author = {Stefan Gulan and Henning Fernau}, editor = {Ramesh Hariharan and Madhavan Mukund and V. Vinay}, title = {An Optimal Construction of Finite Automata from Regular Expressions}, booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2008, December 9-11, 2008, Bangalore, India}, series = {LIPIcs}, volume = {2}, pages = {211--222}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2008}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1754}, doi = {10.4230/LIPICS.FSTTCS.2008.1754}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/GulanF08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sofsem/GulanF08, author = {Stefan Gulan and Henning Fernau}, editor = {Viliam Geffert and Juhani Karhum{\"{a}}ki and Alberto Bertoni and Bart Preneel and Pavol N{\'{a}}vrat and M{\'{a}}ria Bielikov{\'{a}}}, title = {Local elimination-strategies in automata for shorter regular expressions}, booktitle = {{SOFSEM} 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}} Smokovec, Slovakia, January 19-25, 2008, Volume {II} - Student Research Forum}, pages = {46--57}, publisher = {Safarik University, Kosice, Slovakia}, year = {2008}, timestamp = {Tue, 25 Nov 2008 12:12:56 +0100}, biburl = {https://dblp.org/rec/conf/sofsem/GulanF08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.