var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"https://hajduakos.github.io/publications.bib\",\"jsonp\":\"1\",\"theme\":\"side\",\"host\":\"bibbase.org\"},\n      data: [{\"bibtype\":\"inproceedings\",\"type\":\"Conference\",\"author\":[{\"firstnames\":[\"Ákos\"],\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"suffixes\":[]},{\"firstnames\":[\"András\"],\"propositions\":[],\"lastnames\":[\"Vörös\"],\"suffixes\":[]},{\"firstnames\":[\"Tamás\"],\"propositions\":[],\"lastnames\":[\"Bartha\"],\"suffixes\":[]},{\"firstnames\":[\"Zoltán\"],\"propositions\":[],\"lastnames\":[\"Mártonka\"],\"suffixes\":[]}],\"title\":\"Extensions to the CEGAR Approach on Petri Nets\",\"year\":\"2013\",\"pages\":\"274–288\",\"publisher\":\"University of Szeged\",\"booktitle\":\"Proceedings of the 13th Symposium on Programming Languages and Software Tools\",\"isbn\":\"978-963-306-228-9\",\"url_pdf\":\"https://hajduakos.github.io/publications/splst2013.pdf\",\"url_link\":\"http://www.inf.u-szeged.hu/projectdirs/splst13/splst13proc.pdf\",\"url_slides\":\"https://hajduakos.github.io/publications/slides/splst2013.pdf\",\"abstract\":\"Formal verification is becoming more prevalent and often compulsory in the safety-critical system and software development processes. Reachability analysis can provide information about safety and invariant properties of the developed system. However, checking the reachability is a computationally hard problem, especially in the case of asynchronous or infinite state systems. Petri nets are widely used for the modeling and verification of such systems. In this paper we examine a recently published approach for the reachability checking of Petri net markings. We give proofs concerning the completeness and the correctness properties of the algorithm, and we introduce algorithmic improvements. We also extend the algorithm to handle new classes of problems: submarking coverability and reachability of Petri nets with inhibitor arcs.\",\"bibtex\":\"@inproceedings{splst2013,\\n    author     = {{\\\\'A}kos Hajdu and Andr{\\\\'a}s V{\\\\\\\"o}r{\\\\\\\"o}s and Tam{\\\\'a}s Bartha and Zolt{\\\\'a}n M{\\\\'a}rtonka},\\n    title      = {Extensions to the {CEGAR} Approach on {P}etri Nets},\\n    year       = {2013},\\n    pages      = {274--288},\\n    publisher  = {University of Szeged},\\n    booktitle  = {Proceedings of the 13th Symposium on Programming Languages and Software Tools},\\n    isbn       = {978-963-306-228-9},\\n\\n    type       = {Conference},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/splst2013.pdf},\\n    url_link   = {http://www.inf.u-szeged.hu/projectdirs/splst13/splst13proc.pdf},\\n    url_slides = {https://hajduakos.github.io/publications/slides/splst2013.pdf},\\n\\n    abstract   = {Formal verification is becoming more prevalent and often compulsory in the safety-critical system and software development processes. Reachability analysis can provide information about safety and invariant properties of the developed system. However, checking the reachability is a computationally hard problem, especially in the case of asynchronous or infinite state systems. Petri nets are widely used for the modeling and verification of such systems. In this paper we examine a recently published approach for the reachability checking of Petri net markings. We give proofs concerning the completeness and the correctness properties of the algorithm, and we introduce algorithmic improvements. We also extend the algorithm to handle new classes of problems: submarking coverability and reachability of Petri nets with inhibitor arcs.},\\n}\\n\\n\",\"author_short\":[\"Hajdu, Á.\",\"Vörös, A.\",\"Bartha, T.\",\"Mártonka, Z.\"],\"key\":\"splst2013\",\"id\":\"splst2013\",\"bibbaseid\":\"hajdu-vrs-bartha-mrtonka-extensionstothecegarapproachonpetrinets-2013\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/splst2013.pdf\",\" link\":\"http://www.inf.u-szeged.hu/projectdirs/splst13/splst13proc.pdf\",\" slides\":\"https://hajduakos.github.io/publications/slides/splst2013.pdf\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"Journal\",\"author\":[{\"firstnames\":[\"Ákos\"],\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"suffixes\":[]},{\"firstnames\":[\"András\"],\"propositions\":[],\"lastnames\":[\"Vörös\"],\"suffixes\":[]},{\"firstnames\":[\"Tamás\"],\"propositions\":[],\"lastnames\":[\"Bartha\"],\"suffixes\":[]},{\"firstnames\":[\"Zoltán\"],\"propositions\":[],\"lastnames\":[\"Mártonka\"],\"suffixes\":[]}],\"title\":\"Extensions to the CEGAR Approach on Petri Nets\",\"year\":\"2014\",\"pages\":\"401–417\",\"journal\":\"Acta Cybernetica\",\"volume\":\"21\",\"number\":\"3\",\"issn\":\"0324-721X\",\"doi\":\"10.14232/actacyb.21.3.2014.8\",\"url_pdf\":\"https://hajduakos.github.io/publications/acta2014.pdf\",\"url_link\":\"http://www.inf.u-szeged.hu/actacybernetica/edb/vol21n3/pdf/Hajdu_2014_ActaCybernetica.pdf\",\"abstract\":\"Formal verification is becoming more prevalent and often compulsory in the safety-critical system and software development processes. Reachability analysis can provide information about safety and invariant properties of the developed system. However, checking the reachability is a computationally hard problem, especially in the case of asynchronous or infinite state systems. Petri nets are widely used for the modeling and verification of such systems. In this paper we examine a recently published approach for the reachability checking of Petri net markings. We give proofs concerning the completeness and the correctness properties of the algorithm, and we introduce algorithmic improvements. We also extend the algorithm to handle new classes of problems: submarking coverability and reachability of Petri nets with inhibitor arcs.\",\"bibtex\":\"@article{acta2014,\\n    author   = {{\\\\'A}kos Hajdu and Andr{\\\\'a}s V{\\\\\\\"o}r{\\\\\\\"o}s and Tam{\\\\'a}s Bartha and Zolt{\\\\'a}n M{\\\\'a}rtonka},\\n    title    = {Extensions to the {CEGAR} Approach on {P}etri Nets},\\n    year     = {2014},\\n    pages    = {401--417},\\n    journal  = {Acta Cybernetica},\\n    volume   = {21},\\n    number   = {3},\\n    issn     = {0324-721X},\\n    doi      = {10.14232/actacyb.21.3.2014.8},\\n\\n    type     = {Journal},\\n\\n    url_pdf  = {https://hajduakos.github.io/publications/acta2014.pdf},\\n    url_link = {http://www.inf.u-szeged.hu/actacybernetica/edb/vol21n3/pdf/Hajdu_2014_ActaCybernetica.pdf},\\n\\n    abstract = {Formal verification is becoming more prevalent and often compulsory in the safety-critical system and software development processes. Reachability analysis can provide information about safety and invariant properties of the developed system. However, checking the reachability is a computationally hard problem, especially in the case of asynchronous or infinite state systems. Petri nets are widely used for the modeling and verification of such systems. In this paper we examine a recently published approach for the reachability checking of Petri net markings. We give proofs concerning the completeness and the correctness properties of the algorithm, and we introduce algorithmic improvements. We also extend the algorithm to handle new classes of problems: submarking coverability and reachability of Petri nets with inhibitor arcs.},\\n}\\n\\n\",\"author_short\":[\"Hajdu, Á.\",\"Vörös, A.\",\"Bartha, T.\",\"Mártonka, Z.\"],\"key\":\"acta2014\",\"id\":\"acta2014\",\"bibbaseid\":\"hajdu-vrs-bartha-mrtonka-extensionstothecegarapproachonpetrinets-2014\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/acta2014.pdf\",\" link\":\"http://www.inf.u-szeged.hu/actacybernetica/edb/vol21n3/pdf/Hajdu_2014_ActaCybernetica.pdf\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"Conference\",\"author\":[{\"firstnames\":[\"Ákos\"],\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"suffixes\":[]},{\"firstnames\":[\"Róbert\"],\"propositions\":[],\"lastnames\":[\"Német\"],\"suffixes\":[]},{\"firstnames\":[\"Szilvia\"],\"propositions\":[],\"lastnames\":[\"Varró-Gyapay\"],\"suffixes\":[]},{\"firstnames\":[\"András\"],\"propositions\":[],\"lastnames\":[\"Vörös\"],\"suffixes\":[]}],\"title\":\"Petri Net Based Trajectory Optimization\",\"booktitle\":\"ASCONIKK 2014: Extended Abstracts. Future Internet Services\",\"year\":\"2014\",\"location\":\"Veszprém, Hungary\",\"publisher\":\"University of Pannonia\",\"pages\":\"11–19\",\"isbn\":\"978-963-396-047-9\",\"url_pdf\":\"https://hajduakos.github.io/publications/vocal2014.pdf\",\"url_link\":\"http://nikk.mik.uni-pannon.hu/images/II_final_.pdf\",\"url_slides\":\"https://hajduakos.github.io/publications/slides/vocal2014.pdf\",\"abstract\":\"Optimization problems are becoming more prevalent in the design of complex systems. Petri nets are widely used for the modeling of such systems. An optimization problem can be translated to find an optimal trajectory where a cost is assigned to each step. The reachability problem of Petri nets answers whether a given state is reachable from the initial state. However, reachability analysis is a computationally hard problem, especially in the case of asynchronous or infinite state systems. In this paper we examine a recently published algorithm that solves reachability using abstraction methods and we extend this approach to be able to handle optimal trajectory problems.\",\"bibtex\":\"@inproceedings{asconikk2014,\\n    author     = {{\\\\'A}kos Hajdu and R{\\\\'o}bert N{\\\\'e}met and Szilvia Varr{\\\\'o}-Gyapay and Andr{\\\\'a}s V{\\\\\\\"o}r{\\\\\\\"o}s},\\n    title      = {{P}etri Net Based Trajectory Optimization},\\n    booktitle  = {ASCONIKK 2014: Extended Abstracts. Future Internet Services},\\n    year       = {2014},\\n    location   = {Veszpr\\\\'em, Hungary},\\n    publisher  = {University of Pannonia},\\n    pages      = {11--19},\\n    isbn       = {978-963-396-047-9},\\n\\n    type       = {Conference},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/vocal2014.pdf},\\n    url_link   = {http://nikk.mik.uni-pannon.hu/images/II_final_.pdf},\\n    url_slides = {https://hajduakos.github.io/publications/slides/vocal2014.pdf},\\n\\n    abstract   = {Optimization problems are becoming more prevalent in the design of complex systems. Petri nets are widely used for the modeling of such systems. An optimization problem can be translated to find an optimal trajectory where a cost is assigned to each step. The reachability problem of Petri nets answers whether a given state is reachable from the initial state. However, reachability analysis is a computationally hard problem, especially in the case of asynchronous or infinite state systems. In this paper we examine a recently published algorithm that solves reachability using abstraction methods and we extend this approach to be able to handle optimal trajectory problems.},\\n}\\n\\n\",\"author_short\":[\"Hajdu, Á.\",\"Német, R.\",\"Varró-Gyapay, S.\",\"Vörös, A.\"],\"key\":\"asconikk2014\",\"id\":\"asconikk2014\",\"bibbaseid\":\"hajdu-nmet-varrgyapay-vrs-petrinetbasedtrajectoryoptimization-2014\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/vocal2014.pdf\",\" link\":\"http://nikk.mik.uni-pannon.hu/images/II_final_.pdf\",\" slides\":\"https://hajduakos.github.io/publications/slides/vocal2014.pdf\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"Conference\",\"author\":[{\"firstnames\":[\"Ákos\"],\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"suffixes\":[]},{\"firstnames\":[\"András\"],\"propositions\":[],\"lastnames\":[\"Vörös\"],\"suffixes\":[]},{\"firstnames\":[\"Tamás\"],\"propositions\":[],\"lastnames\":[\"Bartha\"],\"suffixes\":[]}],\"title\":\"New search strategies for the Petri net CEGAR approach\",\"year\":\"2015\",\"booktitle\":\"Application and Theory of Petri Nets and Concurrency\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"9115\",\"publisher\":\"Springer\",\"isbn\":\"978-3-319-19488-2\",\"pages\":\"309–328\",\"doi\":\"10.1007/978-3-319-19488-2_16\",\"url_pdf\":\"https://hajduakos.github.io/publications/icatpn2015.pdf\",\"url_link\":\"http://link.springer.com/chapter/10.1007/978-3-319-19488-2_16\",\"url_slides\":\"https://hajduakos.github.io/publications/slides/icatpn2015.pdf\",\"abstract\":\"Petri nets are a successful formal method for the modeling and verification of asynchronous, concurrent and distributed systems. Reachability analysis can provide important information about the behavior of the model. However, reachability analysis is a computationally hard problem, especially when the state space is infinite. Abstraction-based techniques are often applied to overcome complexity. In this paper we analyze an algorithm, which uses counterexample guided abstraction refinement. This algorithm proved its efficiency on the model checking contest. We examine the algorithm from a theoretical and practical point of view. On the theoretical side, we show that the algorithm cannot decide reachability for relatively simple instances. We propose a new iteration strategy to explore the invariant space, which extends the set of decidable problems. We also give proofs on the theoretical limits of our approach. On the practical side, we examine different search strategies and we present our new, complex strategy with superior performance compared to traditional strategies. Measurements show that our new contributions perform well for traditional benchmark models as well.\",\"bibtex\":\"@incollection{icatpn2015,\\n    author     = {{\\\\'A}kos Hajdu and Andr{\\\\'a}s V{\\\\\\\"o}r{\\\\\\\"o}s and Tam{\\\\'a}s Bartha},\\n    title      = {New search strategies for the {P}etri net {CEGAR} approach},\\n    year       = {2015},\\n    booktitle  = {Application and Theory of Petri Nets and Concurrency},\\n    series     = {Lecture Notes in Computer Science},\\n    volume     = {9115},\\n    publisher  = {Springer},\\n    isbn       = {978-3-319-19488-2},\\n    pages      = {309--328},\\n    doi        = {10.1007/978-3-319-19488-2_16},\\n\\n    type       = {Conference},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/icatpn2015.pdf},\\n    url_link   = {http://link.springer.com/chapter/10.1007/978-3-319-19488-2_16},\\n    url_slides = {https://hajduakos.github.io/publications/slides/icatpn2015.pdf},\\n\\n    abstract   = {Petri nets are a successful formal method for the modeling and verification of asynchronous, concurrent and distributed systems. Reachability analysis can provide important information about the behavior of the model. However, reachability analysis is a computationally hard problem, especially when the state space is infinite. Abstraction-based techniques are often applied to overcome complexity. In this paper we analyze an algorithm, which uses counterexample guided abstraction refinement. This algorithm proved its efficiency on the model checking contest. We examine the algorithm from a theoretical and practical point of view. On the theoretical side, we show that the algorithm cannot decide reachability for relatively simple instances. We propose a new iteration strategy to explore the invariant space, which extends the set of decidable problems. We also give proofs on the theoretical limits of our approach. On the practical side, we examine different search strategies and we present our new, complex strategy with superior performance compared to traditional strategies. Measurements show that our new contributions perform well for traditional benchmark models as well.},\\n}\\n\\n\",\"author_short\":[\"Hajdu, Á.\",\"Vörös, A.\",\"Bartha, T.\"],\"key\":\"icatpn2015\",\"id\":\"icatpn2015\",\"bibbaseid\":\"hajdu-vrs-bartha-newsearchstrategiesforthepetrinetcegarapproach-2015\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/icatpn2015.pdf\",\" link\":\"http://link.springer.com/chapter/10.1007/978-3-319-19488-2_16\",\" slides\":\"https://hajduakos.github.io/publications/slides/icatpn2015.pdf\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"techreport\",\"type\":\"Tech. rep.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]}],\"title\":\"Making the TTreeReader interface more accessible\",\"number\":\"CERN-STUDENTS-Note-2015-039\",\"year\":\"2015\",\"month\":\"Aug\",\"institution\":\"European Organization for Nuclear Research (CERN)\",\"url_pdf\":\"http://cds.cern.ch/record/2044503/files/report.pdf\",\"url_link\":\"http://cds.cern.ch/record/2044503\",\"abstract\":\"The ROOT framework is the main data analysis tool for High Energy Physics. One of its main features is TTree, a collection type enabling efficient analysis on petabytes of data. ROOT has a new interface called TTreeReader to access data in a type-safe and efficient way. This Summer Student project aims at implementing a utility interface to generate source file skeletons as a starting point for the users. This will make the TTreeReader much more accessible for the users of ROOT.\",\"bibtex\":\"@techreport{cern2015,\\n    author      = {Hajdu, {\\\\'A}kos},\\n    title       = {Making the {TT}ree{R}eader interface more accessible},\\n    number      = {CERN-STUDENTS-Note-2015-039},\\n    year        = {2015},\\n    month       = {Aug},\\n    institution = {European Organization for Nuclear Research (CERN)},\\n\\n    type        = {Tech. rep.},\\n\\n    url_pdf     = {http://cds.cern.ch/record/2044503/files/report.pdf},\\n    url_link    = {http://cds.cern.ch/record/2044503},\\n\\n    abstract    = {The ROOT framework is the main data analysis tool for High Energy Physics. One of its main features is TTree, a collection type enabling efficient analysis on petabytes of data. ROOT has a new interface called TTreeReader to access data in a type-safe and efficient way. This Summer Student project aims at implementing a utility interface to generate source file skeletons as a starting point for the users. This will make the TTreeReader much more accessible for the users of ROOT.},\\n}\\n\\n\",\"author_short\":[\"Hajdu, Á.\"],\"key\":\"cern2015\",\"id\":\"cern2015\",\"bibbaseid\":\"hajdu-makingthettreereaderinterfacemoreaccessible-2015\",\"role\":\"author\",\"urls\":{\" pdf\":\"http://cds.cern.ch/record/2044503/files/report.pdf\",\" link\":\"http://cds.cern.ch/record/2044503\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"Conference\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tóth\"],\"firstnames\":[\"Tamás\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Vörös\"],\"firstnames\":[\"András\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Majzik\"],\"firstnames\":[\"István\"],\"suffixes\":[]}],\"title\":\"A Configurable CEGAR Framework with Interpolation-based Refinements\",\"year\":\"2016\",\"booktitle\":\"Formal Techniques for Distributed Objects, Components and Systems\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"9688\",\"pages\":\"158–174\",\"publisher\":\"Springer\",\"isbn\":\"978-3-319-39570-8\",\"doi\":\"10.1007/978-3-319-39570-8_11\",\"url_pdf\":\"https://hajduakos.github.io/publications/forte2016.pdf\",\"url_link\":\"http://link.springer.com/chapter/10.1007/978-3-319-39570-8_11\",\"url_slides\":\"https://hajduakos.github.io/publications/slides/forte2016.pdf\",\"abstract\":\"Correctness of software components in a distributed system is a key issue to ensure overall reliability. Formal verification techniques such as model checking can show design flaws at early stages of development. Abstraction is a key technique for reducing complexity by hiding information, which is not relevant for verification. Counterexample-Guided Abstraction Refinement (CEGAR) is a verification algorithm that starts from a coarse abstraction and refines it iteratively until the proper precision is obtained. Many abstraction types and refinement strategies exist for systems with different characteristics. In this paper we show how these algorithms can be combined into a configurable CEGAR framework. In our framework we also present a new CEGAR configuration based on a combination of abstractions, being able to perform better for certain models. We demonstrate the use of the framework by comparing several configurations of the algorithms on various problems, identifying their advantages and shortcomings.\",\"bibtex\":\"@incollection{forte2016,\\n    author     = {Hajdu, {\\\\'A}kos and T{\\\\'o}th, Tam{\\\\'a}s and V{\\\\\\\"o}r{\\\\\\\"o}s, Andr{\\\\'a}s and Majzik, Istv{\\\\'a}n},\\n    title      = {A Configurable {CEGAR} Framework with Interpolation-based Refinements},\\n    year       = {2016},\\n    booktitle  = {Formal Techniques for Distributed Objects, Components and Systems},\\n    series     = {Lecture Notes in Computer Science},\\n    volume     = {9688},\\n    pages      = {158--174},\\n    publisher  = {Springer},\\n    isbn       = {978-3-319-39570-8},\\n    doi        = {10.1007/978-3-319-39570-8_11},\\n\\n    type       = {Conference},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/forte2016.pdf},\\n    url_link   = {http://link.springer.com/chapter/10.1007/978-3-319-39570-8_11},\\n    url_slides = {https://hajduakos.github.io/publications/slides/forte2016.pdf},\\n\\n    abstract   = {Correctness of software components in a distributed system is a key issue to ensure overall reliability. Formal verification techniques such as model checking can show design flaws at early stages of development. Abstraction is a key technique for reducing complexity by hiding information, which is not relevant for verification. Counterexample-Guided Abstraction Refinement (CEGAR) is a verification algorithm that starts from a coarse abstraction and refines it iteratively until the proper precision is obtained. Many abstraction types and refinement strategies exist for systems with different characteristics. In this paper we show how these algorithms can be combined into a configurable CEGAR framework. In our framework we also present a new CEGAR configuration based on a combination of abstractions, being able to perform better for certain models. We demonstrate the use of the framework by comparing several configurations of the algorithms on various problems, identifying their advantages and shortcomings.},\\n}\\n\\n\",\"author_short\":[\"Hajdu, Á.\",\"Tóth, T.\",\"Vörös, A.\",\"Majzik, I.\"],\"key\":\"forte2016\",\"id\":\"forte2016\",\"bibbaseid\":\"hajdu-tth-vrs-majzik-aconfigurablecegarframeworkwithinterpolationbasedrefinements-2016\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/forte2016.pdf\",\" link\":\"http://link.springer.com/chapter/10.1007/978-3-319-39570-8_11\",\" slides\":\"https://hajduakos.github.io/publications/slides/forte2016.pdf\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":6,\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"Conference\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Vörös\"],\"firstnames\":[\"András\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Darvas\"],\"firstnames\":[\"Dániel\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Molnár\"],\"firstnames\":[\"Vince\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Klenik\"],\"firstnames\":[\"Attila\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Jámbor\"],\"firstnames\":[\"Attila\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Bartha\"],\"firstnames\":[\"Tamás\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Majzik\"],\"firstnames\":[\"István\"],\"suffixes\":[]}],\"title\":\"PetriDotNet 1.5: Extensible Petri Net Editor and Analyser for Education and Research\",\"year\":\"2016\",\"booktitle\":\"Application and Theory of Petri Nets and Concurrency\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"9698\",\"pages\":\"123–132\",\"publisher\":\"Springer\",\"isbn\":\"978-3-319-39086-4\",\"doi\":\"10.1007/978-3-319-39086-4_9\",\"url_pdf\":\"https://hajduakos.github.io/publications/icatpn2016.pdf\",\"url_link\":\"http://link.springer.com/chapter/10.1007/978-3-319-39086-4_9\",\"abstract\":\"PetriDotNet is an extensible Petri net editor and analysis tool originally developed to support the education of formal methods. The ease of use and simple extensibility fostered more and more algorithmic developments. Thanks to the continuous interest of developers (especially M.Sc. and Ph.D. students who choose PetriDotNet as the framework of their thesis project), by now PetriDotNet became an analysis platform, providing various cutting-edge model checking algorithms and stochastic analysis algorithms. As a result, industrial application of the tool also emerged in recent years. In this paper we overview the main features and the architecture of PetriDotNet, and compare it with other available tools.\",\"bibtex\":\"@incollection{icatpn2016,\\n    author    = {V{\\\\\\\"o}r{\\\\\\\"o}s, Andr{\\\\'a}s and Darvas, D{\\\\'a}niel and Moln{\\\\'a}r, Vince and Klenik, Attila and Hajdu, {\\\\'A}kos and J{\\\\'a}mbor, Attila and Bartha, Tam{\\\\'a}s and Majzik, Istv{\\\\'a}n},\\n    title     = {{PetriDotNet} 1.5: Extensible {P}etri Net Editor and Analyser for Education and Research},\\n    year      = {2016},\\n    booktitle = {Application and Theory of Petri Nets and Concurrency},\\n    series    = {Lecture Notes in Computer Science},\\n    volume    = {9698},\\n    pages     = {123--132},\\n    publisher = {Springer},\\n    isbn      = {978-3-319-39086-4},\\n    doi       = {10.1007/978-3-319-39086-4_9},\\n\\n    type      = {Conference},\\n\\n    url_pdf   = {https://hajduakos.github.io/publications/icatpn2016.pdf},\\n    url_link  = {http://link.springer.com/chapter/10.1007/978-3-319-39086-4_9},\\n\\n    abstract  = {PetriDotNet is an extensible Petri net editor and analysis tool originally developed to support the education of formal methods. The ease of use and simple extensibility fostered more and more algorithmic developments. Thanks to the continuous interest of developers (especially M.Sc. and Ph.D. students who choose PetriDotNet as the framework of their thesis project), by now PetriDotNet became an analysis platform, providing various cutting-edge model checking algorithms and stochastic analysis algorithms. As a result, industrial application of the tool also emerged in recent years. In this paper we overview the main features and the architecture of PetriDotNet, and compare it with other available tools.},\\n}\\n\\n\",\"author_short\":[\"Vörös, A.\",\"Darvas, D.\",\"Molnár, V.\",\"Klenik, A.\",\"Hajdu, Á.\",\"Jámbor, A.\",\"Bartha, T.\",\"Majzik, I.\"],\"key\":\"icatpn2016\",\"id\":\"icatpn2016\",\"bibbaseid\":\"vrs-darvas-molnr-klenik-hajdu-jmbor-bartha-majzik-petridotnet15extensiblepetrineteditorandanalyserforeducationandresearch-2016\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/icatpn2016.pdf\",\" link\":\"http://link.springer.com/chapter/10.1007/978-3-319-39086-4_9\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"Local event\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Micskei\"],\"firstnames\":[\"Zoltán\"],\"suffixes\":[]}],\"title\":\"Exploratory Analysis of the Performance of a Configurable CEGAR Framework\",\"year\":\"2017\",\"booktitle\":\"Proceedings of the 24th PhD Mini-Symposium\",\"location\":\"Budapest, Hungary\",\"publisher\":\"Budapest University of Technology and Economics, Department of Measurement and Information Systems\",\"pages\":\"34–37\",\"doi\":\"10.5281/zenodo.291895\",\"isbn\":\"978-963-313-243-2\",\"url_pdf\":\"https://hajduakos.github.io/publications/minisy2017.pdf\",\"url_link\":\"https://doi.org/10.5281/zenodo.291895\",\"url_slides\":\"https://hajduakos.github.io/publications/slides/minisy2017.pdf\",\"abstract\":\"Formal verification techniques can check the correctness of systems in a mathematically precise way. However, their computational complexity often prevents their successful application. The counterexample-guided abstraction refinement (CEGAR) algorithm aims to overcome this problem by automatically building abstractions for the system to reduce its complexity. Previously, we developed a generic CEGAR framework, which incorporates many configurations of the algorithm. In this paper we focus on an exploratory analysis of our framework. We identify parameters of the systems and algorithm configurations, overview some possible analysis methods and present preliminary results. We show that different variants are more efficient for certain tasks and we also describe how the properties of the system and parameters of the algorithm affect the success of verification.\",\"bibtex\":\"@inproceedings{minisy2017,\\n    author     = {Hajdu, {\\\\'A}kos and Micskei, Zolt{\\\\'a}n},\\n    title      = {Exploratory Analysis of the Performance of a Configurable {CEGAR} Framework},\\n    year       = {2017},\\n    booktitle  = {Proceedings of the 24th PhD Mini-Symposium},\\n    location   = {Budapest, Hungary},\\n    publisher  = {Budapest University of Technology and Economics, Department of Measurement and Information Systems},\\n    pages      = {34--37},\\n    doi        = {10.5281/zenodo.291895},\\n    isbn       = {978-963-313-243-2},\\n\\n    type       = {Local event},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/minisy2017.pdf},\\n    url_link   = {https://doi.org/10.5281/zenodo.291895},\\n    url_slides = {https://hajduakos.github.io/publications/slides/minisy2017.pdf},\\n\\n    abstract   = {Formal verification techniques can check the correctness of systems in a mathematically precise way. However, their computational complexity often prevents their successful application. The counterexample-guided abstraction refinement (CEGAR) algorithm aims to overcome this problem by automatically building abstractions for the system to reduce its complexity. Previously, we developed a generic CEGAR framework, which incorporates many configurations of the algorithm. In this paper we focus on an exploratory analysis of our framework. We identify parameters of the systems and algorithm configurations, overview some possible analysis methods and present preliminary results. We show that different variants are more efficient for certain tasks and we also describe how the properties of the system and parameters of the algorithm affect the success of verification.},\\n}\\n\\n\",\"author_short\":[\"Hajdu, Á.\",\"Micskei, Z.\"],\"key\":\"minisy2017\",\"id\":\"minisy2017\",\"bibbaseid\":\"hajdu-micskei-exploratoryanalysisoftheperformanceofaconfigurablecegarframework-2017\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/minisy2017.pdf\",\" link\":\"https://doi.org/10.5281/zenodo.291895\",\" slides\":\"https://hajduakos.github.io/publications/slides/minisy2017.pdf\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"Local event\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Farkas\"],\"firstnames\":[\"Rebeka\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]}],\"title\":\"Activity-Based Abstraction Refinement for Timed Systems\",\"year\":\"2017\",\"booktitle\":\"Proceedings of the 24th PhD Mini-Symposium\",\"location\":\"Budapest, Hungary\",\"publisher\":\"Budapest University of Technology and Economics, Department of Measurement and Information Systems\",\"pages\":\"18–21\",\"doi\":\"10.5281/zenodo.291891\",\"isbn\":\"978-963-313-243-2\",\"url_pdf\":\"https://hajduakos.github.io/publications/minisy2017fr.pdf\",\"url_link\":\"https://doi.org/10.5281/zenodo.291891\",\"abstract\":\"Formal analysis of real time systems is important as they are widely used in safety critical domains. Such systems combine discrete behaviours represented by control states and timed behaviours represented by clock variables. The counterexample-guided abstraction refinement (CEGAR) algorithm utilizes the fundamental technique of abstraction to system verification. We propose a CEGAR-based algorithm for reachability analysis of timed systems. The algorithm is specialized to handle the time related behaviours efficiently by introducing a refinement technique tailored specially to clock variables. The performance of the presented algorithm is demonstrated by runtime measurements on models commonly used for benchmarking such algorithms.\",\"bibtex\":\"@inproceedings{minisy2017fr,\\n    author     = {Farkas, Rebeka and Hajdu, {\\\\'A}kos},\\n    title      = {Activity-Based Abstraction Refinement for Timed Systems},\\n    year       = {2017},\\n    booktitle  = {Proceedings of the 24th PhD Mini-Symposium},\\n    location   = {Budapest, Hungary},\\n    publisher  = {Budapest University of Technology and Economics, Department of Measurement and Information Systems},\\n    pages      = {18--21},\\n    doi        = {10.5281/zenodo.291891},\\n    isbn       = {978-963-313-243-2},\\n\\n    type       = {Local event},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/minisy2017fr.pdf},\\n    url_link   = {https://doi.org/10.5281/zenodo.291891},\\n\\n    abstract   = {Formal analysis of real time systems is important as they are widely used in safety critical domains. Such systems combine discrete behaviours represented by control states and timed behaviours represented by clock variables. The counterexample-guided abstraction refinement (CEGAR) algorithm utilizes the fundamental technique of abstraction to system verification. We propose a CEGAR-based algorithm for reachability analysis of timed systems. The algorithm is specialized to handle the time related behaviours efficiently by introducing a refinement technique tailored specially to clock variables. The performance of the presented algorithm is demonstrated by runtime measurements on models commonly used for benchmarking such algorithms.},\\n}\\n\\n\",\"author_short\":[\"Farkas, R.\",\"Hajdu, Á.\"],\"key\":\"minisy2017fr\",\"id\":\"minisy2017fr\",\"bibbaseid\":\"farkas-hajdu-activitybasedabstractionrefinementfortimedsystems-2017\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/minisy2017fr.pdf\",\" link\":\"https://doi.org/10.5281/zenodo.291891\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"Workshop\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Czipó\"],\"firstnames\":[\"Bence\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tóth\"],\"firstnames\":[\"Tamás\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Majzik\"],\"firstnames\":[\"István\"],\"suffixes\":[]}],\"year\":\"2017\",\"title\":\"Exploiting Hierarchy in the Abstraction-Based Verification of Statecharts Using SMT Solvers\",\"booktitle\":\"Proceedings of the 14th International Workshop on Formal Engineering Approaches to Software Components and Architectures\",\"series\":\"Electronic Proceedings in Theoretical Computer Science\",\"volume\":\"245\",\"publisher\":\"Open Publishing Association\",\"pages\":\"31–45\",\"doi\":\"10.4204/EPTCS.245.3\",\"url_pdf\":\"https://hajduakos.github.io/publications/fesca2017.pdf\",\"url_link\":\"http://eptcs.web.cse.unsw.edu.au/paper.cgi?FESCA2017.3\",\"url_slides\":\"https://hajduakos.github.io/publications/slides/fesca2017.pdf\",\"abstract\":\"Statecharts are frequently used as a modeling formalism in the design of state-based systems. Formal verification techniques are also often applied to prove certain properties about the behavior of the system. One of the most efficient techniques for formal verification is Counterexample-Guided Abstraction Refinement (CEGAR), which reduces the complexity of systems by automatically building and refining abstractions. In our paper we present a novel adaptation of the CEGAR approach to hierarchical statechart models. First we introduce an encoding of the statechart to logical formulas that preserves information about the state hierarchy. Based on this encoding we propose abstraction and refinement techniques that utilize the hierarchical structure of statecharts and also handle variables in the model. The encoding allows us to use SMT solvers for the systematic exploration and verification of the abstract model, including also bounded model checking. We demonstrate the applicability and efficiency of our abstraction techniques with measurements on an industry-motivated example.\",\"bibtex\":\"@incollection{fesca2017,\\n    author     = {Czip{\\\\'o}, Bence and Hajdu, {\\\\'A}kos and T{\\\\'o}th, Tam{\\\\'a}s and Majzik, Istv{\\\\'a}n},\\n    year       = {2017},\\n    title      = {Exploiting Hierarchy in the Abstraction-Based Verification of Statecharts Using {SMT} Solvers},\\n    booktitle  = {Proceedings of the 14th International Workshop on Formal Engineering Approaches to Software Components and Architectures},\\n    series     = {Electronic Proceedings in Theoretical Computer Science},\\n    volume     = {245},\\n    publisher  = {Open Publishing Association},\\n    pages      = {31--45},\\n    doi        = {10.4204/EPTCS.245.3},\\n\\n    type       = {Workshop},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/fesca2017.pdf},\\n    url_link   = {http://eptcs.web.cse.unsw.edu.au/paper.cgi?FESCA2017.3},\\n    url_slides = {https://hajduakos.github.io/publications/slides/fesca2017.pdf},\\n\\n    abstract   = {Statecharts are frequently used as a modeling formalism in the design of state-based systems. Formal verification techniques are also often applied to prove certain properties about the behavior of the system. One of the most efficient techniques for formal verification is Counterexample-Guided Abstraction Refinement (CEGAR), which reduces the complexity of systems by automatically building and refining abstractions. In our paper we present a novel adaptation of the CEGAR approach to hierarchical statechart models. First we introduce an encoding of the statechart to logical formulas that preserves information about the state hierarchy. Based on this encoding we propose abstraction and refinement techniques that utilize the hierarchical structure of statecharts and also handle variables in the model. The encoding allows us to use SMT solvers for the systematic exploration and verification of the abstract model, including also bounded model checking. We demonstrate the applicability and efficiency of our abstraction techniques with measurements on an industry-motivated example.},\\n}\\n\\n\",\"author_short\":[\"Czipó, B.\",\"Hajdu, Á.\",\"Tóth, T.\",\"Majzik, I.\"],\"key\":\"fesca2017\",\"id\":\"fesca2017\",\"bibbaseid\":\"czip-hajdu-tth-majzik-exploitinghierarchyintheabstractionbasedverificationofstatechartsusingsmtsolvers-2017\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/fesca2017.pdf\",\" link\":\"http://eptcs.web.cse.unsw.edu.au/paper.cgi?FESCA2017.3\",\" slides\":\"https://hajduakos.github.io/publications/slides/fesca2017.pdf\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"Workshop\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Sallai\"],\"firstnames\":[\"Gyula\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tóth\"],\"firstnames\":[\"Tamás\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Micskei\"],\"firstnames\":[\"Zoltán\"],\"suffixes\":[]}],\"year\":\"2017\",\"title\":\"Towards Evaluating Size Reduction Techniques for Software Model Checking\",\"booktitle\":\"Proceedings of the Fifth International Workshop on Verification and Program Transformation\",\"series\":\"Electronic Proceedings in Theoretical Computer Science\",\"volume\":\"253\",\"publisher\":\"Open Publishing Association\",\"pages\":\"75–91\",\"doi\":\"10.4204/EPTCS.253.7\",\"url_pdf\":\"https://hajduakos.github.io/publications/vpt2017.pdf\",\"url_link\":\"http://eptcs.web.cse.unsw.edu.au/paper.cgi?VPT2017.7\",\"url_slides\":\"https://hajduakos.github.io/publications/slides/vpt2017.pdf\",\"abstract\":\"Formal verification techniques are widely used for detecting design flaws in software systems. Formal verification can be done by transforming an already implemented source code to a formal model and attempting to prove certain properties of the model (e.g. that no erroneous state can occur during execution). Unfortunately, transformations from source code to a formal model often yield large and complex models, making the verification process inefficient and costly. In order to reduce the size of the resulting model, optimization transformations can be used. Such optimizations include common algorithms known from compiler design and different program slicing techniques. Our paper describes a framework for transforming C programs to a formal model, enhanced by various optimizations for size reduction. We evaluate and compare several optimization algorithms regarding their effect on the size of the model and the efficiency of the verification. Results show that different optimizations are more suitable for certain models, justifying the need for a framework that includes several algorithms.\",\"bibtex\":\"@incollection{vpt2017,\\n    author     = {Sallai, Gyula and Hajdu, {\\\\'A}kos and T{\\\\'o}th, Tam{\\\\'a}s and Micskei, Zolt{\\\\'a}n},\\n    year       = {2017},\\n    title      = {Towards Evaluating Size Reduction Techniques for Software Model Checking},\\n    booktitle  = {Proceedings of the Fifth International Workshop on Verification and Program Transformation},\\n    series     = {Electronic Proceedings in Theoretical Computer Science},\\n    volume     = {253},\\n    publisher  = {Open Publishing Association},\\n    pages      = {75--91},\\n    doi        = {10.4204/EPTCS.253.7},\\n\\n    type       = {Workshop},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/vpt2017.pdf},\\n    url_link   = {http://eptcs.web.cse.unsw.edu.au/paper.cgi?VPT2017.7},\\n    url_slides = {https://hajduakos.github.io/publications/slides/vpt2017.pdf},\\n\\n    abstract   = {Formal verification techniques are widely used for detecting design flaws in software systems. Formal verification can be done by transforming an already implemented source code to a formal model and attempting to prove certain properties of the model (e.g. that no erroneous state can occur during execution). Unfortunately, transformations from source code to a formal model often yield large and complex models, making the verification process inefficient and costly. In order to reduce the size of the resulting model, optimization transformations can be used. Such optimizations include common algorithms known from compiler design and different program slicing techniques. Our paper describes a framework for transforming C programs to a formal model, enhanced by various optimizations for size reduction. We evaluate and compare several optimization algorithms regarding their effect on the size of the model and the efficiency of the verification. Results show that different optimizations are more suitable for certain models, justifying the need for a framework that includes several algorithms.}\\n}\\n\\n\",\"author_short\":[\"Sallai, G.\",\"Hajdu, Á.\",\"Tóth, T.\",\"Micskei, Z.\"],\"key\":\"vpt2017\",\"id\":\"vpt2017\",\"bibbaseid\":\"sallai-hajdu-tth-micskei-towardsevaluatingsizereductiontechniquesforsoftwaremodelchecking-2017\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/vpt2017.pdf\",\" link\":\"http://eptcs.web.cse.unsw.edu.au/paper.cgi?VPT2017.7\",\" slides\":\"https://hajduakos.github.io/publications/slides/vpt2017.pdf\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"Journal\",\"author\":[{\"firstnames\":[\"András\"],\"propositions\":[],\"lastnames\":[\"Vörös\"],\"suffixes\":[]},{\"firstnames\":[\"Dániel\"],\"propositions\":[],\"lastnames\":[\"Darvas\"],\"suffixes\":[]},{\"firstnames\":[\"Ákos\"],\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"suffixes\":[]},{\"firstnames\":[\"Attila\"],\"propositions\":[],\"lastnames\":[\"Klenik\"],\"suffixes\":[]},{\"firstnames\":[\"Kristóf\"],\"propositions\":[],\"lastnames\":[\"Marussy\"],\"suffixes\":[]},{\"firstnames\":[\"Vince\"],\"propositions\":[],\"lastnames\":[\"Molnár\"],\"suffixes\":[]},{\"firstnames\":[\"Tamás\"],\"propositions\":[],\"lastnames\":[\"Bartha\"],\"suffixes\":[]},{\"firstnames\":[\"István\"],\"propositions\":[],\"lastnames\":[\"Majzik\"],\"suffixes\":[]}],\"title\":\"Industrial Applications of the PetriDotNet Modelling and Analysis Tool\",\"year\":\"2018\",\"journal\":\"Science of Computer Programming\",\"volume\":\"157\",\"pages\":\"17–40\",\"issn\":\"0167-6423\",\"doi\":\"10.1016/j.scico.2017.09.003\",\"url_pdf\":\"https://hajduakos.github.io/publications/scp2017.pdf\",\"url_link\":\"http://www.sciencedirect.com/science/article/pii/S0167642317301910\",\"abstract\":\"Since their invention, Petri nets have provided modelling and analysis methods to support the design of correct, reliable and robust systems. This motivated our work to develop PetriDotNet, a Petri net editor and analysis tool. In this paper we overview the supported modelling formalisms and the analysis methods included in PetriDotNet. Next, we present eight different industrial case studies, demonstrating the wide variety of scenarios where Petri nets and PetriDotNet can help the design, development and analysis of industrial systems. Our original goal with PetriDotNet was to provide an educational tool to our students, however our efforts led to a framework being able to serve both academic and industrial needs.\",\"bibtex\":\"@article{scp2017,\\n    author   = {Andr{\\\\'a}s V\\\\\\\"{o}r\\\\\\\"{o}s and D{\\\\'a}niel Darvas and {\\\\'A}kos Hajdu and Attila Klenik and Krist{\\\\'o}f Marussy and Vince Moln{\\\\'a}r and Tam{\\\\'a}s Bartha and Istv{\\\\'a}n Majzik},\\n    title    = {Industrial Applications of the {P}etri{D}ot{N}et Modelling and Analysis Tool},\\n    year     = {2018},\\n    journal  = {Science of Computer Programming},\\n    volume   = {157},\\n    pages    = {17--40},\\n    issn     = {0167-6423},\\n    doi      = {10.1016/j.scico.2017.09.003},\\n\\n    type     = {Journal},\\n\\n    url_pdf  = {https://hajduakos.github.io/publications/scp2017.pdf},\\n    url_link = {http://www.sciencedirect.com/science/article/pii/S0167642317301910},\\n\\n    abstract = {Since their invention, Petri nets have provided modelling and analysis methods to support the design of correct, reliable and robust systems. This motivated our work to develop PetriDotNet, a Petri net editor and analysis tool. In this paper we overview the supported modelling formalisms and the analysis methods included in PetriDotNet. Next, we present eight different industrial case studies, demonstrating the wide variety of scenarios where Petri nets and PetriDotNet can help the design, development and analysis of industrial systems. Our original goal with PetriDotNet was to provide an educational tool to our students, however our efforts led to a framework being able to serve both academic and industrial needs.},\\n}\\n\\n\",\"author_short\":[\"Vörös, A.\",\"Darvas, D.\",\"Hajdu, Á.\",\"Klenik, A.\",\"Marussy, K.\",\"Molnár, V.\",\"Bartha, T.\",\"Majzik, I.\"],\"key\":\"scp2017\",\"id\":\"scp2017\",\"bibbaseid\":\"vrs-darvas-hajdu-klenik-marussy-molnr-bartha-majzik-industrialapplicationsofthepetridotnetmodellingandanalysistool-2018\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/scp2017.pdf\",\" link\":\"http://www.sciencedirect.com/science/article/pii/S0167642317301910\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"Conference\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Tóth\"],\"firstnames\":[\"Tamás\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Vörös\"],\"firstnames\":[\"András\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Micskei\"],\"firstnames\":[\"Zoltán\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Majzik\"],\"firstnames\":[\"István\"],\"suffixes\":[]}],\"year\":\"2017\",\"title\":\"Theta: a Framework for Abstraction Refinement-Based Model Checking\",\"booktitle\":\"Proceedings of the 17th Conference on Formal Methods in Computer-Aided Design\",\"isbn\":\"978-0-9835678-7-5\",\"pages\":\"176–179\",\"doi\":\"10.23919/FMCAD.2017.8102257\",\"url_pdf\":\"https://hajduakos.github.io/publications/fmcad2017.pdf\",\"url_link\":\"http://www.cs.utexas.edu/users/hunt/FMCAD/FMCAD17/proceedings/\",\"url_slides\":\"https://hajduakos.github.io/publications/slides/fmcad2017.pdf\",\"url_video\":\"https://oc-presentation.ltcc.tuwien.ac.at/engage/theodul/ui/core.html?id=c658c37e-ae70-11e7-a0dd-bb49f3cb440c\",\"abstract\":\"In this paper, we present Theta, a configurable model checking framework. The goal of the framework is to support the design, execution and evaluation of abstraction refinement-based reachability analysis algorithms for models of different formalisms. It enables the definition of input formalisms, abstract domains, model interpreters, and strategies for abstraction and refinement. Currently it contains front-end support for transition systems, control flow automata and timed automata. The built-in abstract domains include predicates, explicit values, zones and their combinations, along with various refinement strategies implemented for each. The configurability of the framework allows the integration of several abstraction and refinement methods, this way supporting the evaluation of their advantages and shortcomings. We demonstrate the applicability of the framework by use cases for the safety checking of PLC, hardware, C programs and timed automata models.\",\"bibtex\":\"@inproceedings{fmcad2017,\\n    author     = {T{\\\\'o}th, Tam{\\\\'a}s and Hajdu, {\\\\'A}kos and V{\\\\\\\"o}r{\\\\\\\"o}s, Andr{\\\\'a}s and Micskei, Zolt{\\\\'a}n and Majzik, Istv{\\\\'a}n},\\n    year       = {2017},\\n    title      = {Theta: a Framework for Abstraction Refinement-Based Model Checking},\\n    booktitle  = {Proceedings of the 17th Conference on Formal Methods in Computer-Aided Design},\\n    isbn       = {978-0-9835678-7-5},\\n    pages      = {176--179},\\n    doi        = {10.23919/FMCAD.2017.8102257},\\n\\n    type       = {Conference},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/fmcad2017.pdf},\\n    url_link   = {http://www.cs.utexas.edu/users/hunt/FMCAD/FMCAD17/proceedings/},\\n    url_slides = {https://hajduakos.github.io/publications/slides/fmcad2017.pdf},\\n    url_video  = {https://oc-presentation.ltcc.tuwien.ac.at/engage/theodul/ui/core.html?id=c658c37e-ae70-11e7-a0dd-bb49f3cb440c},\\n\\n    abstract   = {In this paper, we present Theta, a configurable model checking framework. The goal of the framework is to support the design, execution and evaluation of abstraction refinement-based reachability analysis algorithms for models of different formalisms. It enables the definition of input formalisms, abstract domains, model interpreters, and strategies for abstraction and refinement. Currently it contains front-end support for transition systems, control flow automata and timed automata. The built-in abstract domains include predicates, explicit values, zones and their combinations, along with various refinement strategies implemented for each. The configurability of the framework allows the integration of several abstraction and refinement methods, this way supporting the evaluation of their advantages and shortcomings. We demonstrate the applicability of the framework by use cases for the safety checking of PLC, hardware, C programs and timed automata models.},\\n}\\n\\n\",\"author_short\":[\"Tóth, T.\",\"Hajdu, Á.\",\"Vörös, A.\",\"Micskei, Z.\",\"Majzik, I.\"],\"key\":\"fmcad2017\",\"id\":\"fmcad2017\",\"bibbaseid\":\"tth-hajdu-vrs-micskei-majzik-thetaaframeworkforabstractionrefinementbasedmodelchecking-2017\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/fmcad2017.pdf\",\" link\":\"http://www.cs.utexas.edu/users/hunt/FMCAD/FMCAD17/proceedings/\",\" slides\":\"https://hajduakos.github.io/publications/slides/fmcad2017.pdf\",\" video\":\"https://oc-presentation.ltcc.tuwien.ac.at/engage/theodul/ui/core.html?id=c658c37e-ae70-11e7-a0dd-bb49f3cb440c\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"Local event\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Micskei\"],\"firstnames\":[\"Zoltán\"],\"suffixes\":[]}],\"title\":\"A Preliminary Analysis on the Effect of Randomness in a CEGAR Framework\",\"year\":\"2018\",\"booktitle\":\"Proceedings of the 25th PhD Mini-Symposium\",\"location\":\"Budapest, Hungary\",\"publisher\":\"Budapest University of Technology and Economics, Department of Measurement and Information Systems\",\"pages\":\"32–35\",\"doi\":\"10.5281/zenodo.1219261\",\"isbn\":\"978-963-313-285-2\",\"url_pdf\":\"https://hajduakos.github.io/publications/minisy2018.pdf\",\"url_link\":\"https://doi.org/10.5281/zenodo.1219261\",\"url_slides\":\"https://hajduakos.github.io/publications/slides/minisy2018.pdf\",\"abstract\":\"Formal verification techniques can check the correctness of systems in a mathematically precise way. Counterexample-Guided Abstraction Refinement (CEGAR) is an automatic algorithm that reduces the complexity of systems by constructing and refining abstractions. CEGAR is a generic approach, having many variants and strategies developed over the years. However, as the variants become more and more advanced, one may not be sure whether the performance of a strategy can be attributed to the strategy itself or to other, unintentional factors. In this paper we perform an experiment by evaluating the performance of different strategies while randomizing certain external factors such as the search strategy and variable naming. We show that randomization introduces a great variation in the output metrics, and that in several cases this might even influence whether the algorithm successfully terminates.\",\"bibtex\":\"@inproceedings{minisy2018,\\n    author     = {Hajdu, {\\\\'A}kos and Micskei, Zolt{\\\\'a}n},\\n    title      = {A Preliminary Analysis on the Effect of Randomness in a {CEGAR} Framework},\\n    year       = {2018},\\n    booktitle  = {Proceedings of the 25th PhD Mini-Symposium},\\n    location   = {Budapest, Hungary},\\n    publisher  = {Budapest University of Technology and Economics, Department of Measurement and Information Systems},\\n    pages      = {32--35},\\n    doi        = {10.5281/zenodo.1219261},\\n    isbn       = {978-963-313-285-2},\\n\\n    type       = {Local event},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/minisy2018.pdf},\\n    url_link   = {https://doi.org/10.5281/zenodo.1219261},\\n    url_slides = {https://hajduakos.github.io/publications/slides/minisy2018.pdf},\\n\\n    abstract   = {Formal verification techniques can check the correctness of systems in a mathematically precise way. Counterexample-Guided Abstraction Refinement (CEGAR) is an automatic algorithm that reduces the complexity of systems by constructing and refining abstractions. CEGAR is a generic approach, having many variants and strategies developed over the years. However, as the variants become more and more advanced, one may not be sure whether the performance of a strategy can be attributed to the strategy itself or to other, unintentional factors. In this paper we perform an experiment by evaluating the performance of different strategies while randomizing certain external factors such as the search strategy and variable naming. We show that randomization introduces a great variation in the output metrics, and that in several cases this might even influence whether the algorithm successfully terminates.},\\n}\\n\\n\",\"author_short\":[\"Hajdu, Á.\",\"Micskei, Z.\"],\"key\":\"minisy2018\",\"id\":\"minisy2018\",\"bibbaseid\":\"hajdu-micskei-apreliminaryanalysisontheeffectofrandomnessinacegarframework-2018\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/minisy2018.pdf\",\" link\":\"https://doi.org/10.5281/zenodo.1219261\",\" slides\":\"https://hajduakos.github.io/publications/slides/minisy2018.pdf\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"Workshop\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Farkas\"],\"firstnames\":[\"Rebeka\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tóth\"],\"firstnames\":[\"Tamás\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Vörös\"],\"firstnames\":[\"András\"],\"suffixes\":[]}],\"title\":\"Backward reachability analysis for timed automata with data variables\",\"year\":\"2018\",\"booktitle\":\"Proceedings of the 18th International Workshop on Automated Verification of Critical Systems\",\"series\":\"Electronic Communications of the EASST\",\"issn\":\"1863-2122\",\"volume\":\"76\",\"publisher\":\"EASST\",\"pages\":\"1–20\",\"doi\":\"10.14279/tuj.eceasst.76.1076\",\"url_pdf\":\"https://hajduakos.github.io/publications/avocs2018.pdf\",\"url_link\":\"https://journal.ub.tu-berlin.de/eceasst/article/view/1076\",\"abstract\":\"Efficient techniques for reachability analysis of timed automata are zone-based methods that explore the reachable state space from the initial state, and SMT-based methods that perform backward search from the target states. It is also possible to perform backward exploration based on zones, but calculating predecessor states for systems with data variables is computationally expensive, prohibiting the successful application of this approach so far. In this paper we overcome this limitation by combining zone-based backward exploration with the weakest precondition operation for data variables. This combination allows us to handle diagonal constraints efficiently as opposed to zone-based forward search where most approaches require additional operations to ensure correctness. We demonstrate the applicability and compare the efficiency of the algorithm to existing forward exploration approaches by measurements performed on industrial case studies. Although the large number of states often prevents successful verification, we show that data variables can be efficienlty handled by the weakest precondition operation. This way our new approach complements existing techniques.\",\"bibtex\":\"@incollection{avocs2018,\\n    author     = {Farkas, Rebeka and T{\\\\'o}th, Tam{\\\\'a}s and Hajdu, {\\\\'A}kos and V{\\\\\\\"o}r{\\\\\\\"o}s, Andr{\\\\'a}s},\\n    title      = {Backward reachability analysis for timed automata with data variables},\\n    year       = {2018},\\n    booktitle  = {Proceedings of the 18th International Workshop on Automated Verification of Critical Systems},\\n    series     = {Electronic Communications of the EASST},\\n    issn       = {1863-2122},\\n    volume     = {76},\\n    publisher  = {EASST},\\n    pages      = {1--20},\\n    doi        = {10.14279/tuj.eceasst.76.1076},\\n\\n    type       = {Workshop},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/avocs2018.pdf},\\n    url_link   = {https://journal.ub.tu-berlin.de/eceasst/article/view/1076},\\n\\n    abstract   = {Efficient techniques for reachability analysis of timed automata are zone-based methods that explore the reachable state space from the initial state, and SMT-based methods that perform backward search from the target states. It is also possible to perform backward exploration based on zones, but calculating predecessor states for systems with data variables is computationally expensive, prohibiting the successful application of this approach so far. In this paper we overcome this limitation by combining zone-based backward exploration with the weakest precondition operation for data variables. This combination allows us to handle diagonal constraints efficiently as opposed to zone-based forward search where most approaches require additional operations to ensure correctness. We demonstrate the applicability and compare the efficiency of the algorithm to existing forward exploration approaches by measurements performed on industrial case studies. Although the large number of states often prevents successful verification, we show that data variables can be efficienlty handled by the weakest precondition operation. This way our new approach complements existing techniques.}\\n}\\n\\n\",\"author_short\":[\"Farkas, R.\",\"Tóth, T.\",\"Hajdu, Á.\",\"Vörös, A.\"],\"key\":\"avocs2018\",\"id\":\"avocs2018\",\"bibbaseid\":\"farkas-tth-hajdu-vrs-backwardreachabilityanalysisfortimedautomatawithdatavariables-2018\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/avocs2018.pdf\",\" link\":\"https://journal.ub.tu-berlin.de/eceasst/article/view/1076\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"Local event\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Bajkai\"],\"firstnames\":[\"Viktória\",\"Dorina\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]}],\"title\":\"Software Model Checking with a Combination of Explicit Values and Predicates\",\"year\":\"2019\",\"booktitle\":\"Proceedings of the 26th PhD Mini-Symposium\",\"location\":\"Budapest, Hungary\",\"publisher\":\"Budapest University of Technology and Economics, Department of Measurement and Information Systems\",\"pages\":\"4–7\",\"isbn\":\"978-963-313-314-9\",\"doi\":\"10.5281/zenodo.2597969\",\"url_pdf\":\"https://hajduakos.github.io/publications/minisy2019.pdf\",\"url_link\":\"http://doi.org/10.5281/zenodo.2597969\",\"abstract\":\"Formal verification techniques can both reveal bugs or prove their absence in programs with a sound mathematical basis. However, their high computational complexity often prevents their application on real-world software. Counterexample-guided abstraction refinement (CEGAR) aims to improve efficiency by automatically constructing and refining abstractions for the program. There are several existing abstract domains, such as explicit-values and predicates, but different abstract domains are suitable for different kinds of software. Therefore, product domains have also emerged, which combine different kinds of abstractions in a single algorithm. In this paper, we present a new variant of the CEGAR algorithm, which is a combination of explicit-value analysis and predicate abstraction. We perform an experiment with a wide range of software systems and we compare the results to the existing methods. Measurements show that our new algorithm can efficiently combine the advantages of the different domains.\",\"bibtex\":\"@inproceedings{minisy2019,\\n    author     = {Bajkai, Vikt{\\\\'o}ria Dorina and Hajdu, {\\\\'A}kos},\\n    title      = {Software Model Checking with a Combination of Explicit Values and Predicates},\\n    year       = {2019},\\n    booktitle  = {Proceedings of the 26th PhD Mini-Symposium},\\n    location   = {Budapest, Hungary},\\n    publisher  = {Budapest University of Technology and Economics, Department of Measurement and Information Systems},\\n    pages      = {4--7},\\n    isbn       = {978-963-313-314-9},\\n    doi        = {10.5281/zenodo.2597969},\\n\\n    type       = {Local event},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/minisy2019.pdf},\\n    url_link   = {http://doi.org/10.5281/zenodo.2597969},\\n\\n    abstract   = {Formal verification techniques can both reveal bugs or prove their absence in programs with a sound mathematical basis. However, their high computational complexity often prevents their application on real-world software. Counterexample-guided abstraction refinement (CEGAR) aims to improve efficiency by automatically constructing and refining abstractions for the program. There are several existing abstract domains, such as explicit-values and predicates, but different abstract domains are suitable for different kinds of software. Therefore, product domains have also emerged, which combine different kinds of abstractions in a single algorithm. In this paper, we present a new variant of the CEGAR algorithm, which is a combination of explicit-value analysis and predicate abstraction. We perform an experiment with a wide range of software systems and we compare the results to the existing methods. Measurements show that our new algorithm can efficiently combine the advantages of the different domains.},\\n}\\n\\n\",\"author_short\":[\"Bajkai, V. D.\",\"Hajdu, Á.\"],\"key\":\"minisy2019\",\"id\":\"minisy2019\",\"bibbaseid\":\"bajkai-hajdu-softwaremodelcheckingwithacombinationofexplicitvaluesandpredicates-2019\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/minisy2019.pdf\",\" link\":\"http://doi.org/10.5281/zenodo.2597969\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"Conference\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Jovanović\"],\"firstnames\":[\"Dejan\"],\"suffixes\":[]}],\"title\":\"solc-verify: A Modular Verifier for Solidity Smart Contracts\",\"year\":\"2020\",\"booktitle\":\"Verified Software. Theories, Tools, and Experiments\",\"pages\":\"161–179\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"12301\",\"publisher\":\"Springer\",\"doi\":\"10.1007/978-3-030-41600-3_11\",\"isbn\":\"978-3-030-41600-3\",\"url_pdf\":\"https://hajduakos.github.io/publications/vstte2019.pdf\",\"url_link\":\"https://link.springer.com/chapter/10.1007/978-3-030-41600-3_11\",\"url_slides\":\"https://hajduakos.github.io/publications/slides/vstte2019.pdf\",\"abstract\":\"We present solc-verify, a source-level verification tool for Ethereum smart contracts. Solc-verify takes smart contracts written in Solidity and discharges verification conditions using modular program analysis and SMT solvers. Built on top of the Solidity compiler, solc-verify reasons at the level of the contract source code, as opposed to the more common approaches that operate at the level of Ethereum bytecode. This enables solc-verify to effectively reason about high-level contract properties while modeling low-level language semantics precisely. The contract properties, such as contract invariants, loop invariants, and function pre- and post-conditions, can be provided as annotations in the code by the developer. This enables automated, yet user-friendly formal verification for smart contracts. We demonstrate solc-verify by examining real-world examples where our tool can effectively find bugs and prove correctness of non-trivial properties with minimal user effort.\",\"bibtex\":\"@incollection{vstte2019,\\n    author     = {Hajdu, {\\\\'A}kos and Jovanovi{\\\\'c}, Dejan},\\n    title      = {solc-verify: A Modular Verifier for {S}olidity Smart Contracts},\\n    year       = {2020},\\n    booktitle  = {Verified Software. Theories, Tools, and Experiments},\\n    pages      = {161--179},\\n    series     = {Lecture Notes in Computer Science},\\n    volume     = {12301},\\n    publisher  = {Springer},\\n    doi        = {10.1007/978-3-030-41600-3_11},\\n    isbn       = {978-3-030-41600-3},\\n\\n    type       = {Conference},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/vstte2019.pdf},\\n    url_link   = {https://link.springer.com/chapter/10.1007/978-3-030-41600-3_11},\\n    url_slides = {https://hajduakos.github.io/publications/slides/vstte2019.pdf},\\n\\n    abstract   = {We present solc-verify, a source-level verification tool for Ethereum smart contracts. Solc-verify takes smart contracts written in Solidity and discharges verification conditions using modular program analysis and SMT solvers. Built on top of the Solidity compiler, solc-verify reasons at the level of the contract source code, as opposed to the more common approaches that operate at the level of Ethereum bytecode. This enables solc-verify to effectively reason about high-level contract properties while modeling low-level language semantics precisely. The contract properties, such as contract invariants, loop invariants, and function pre- and post-conditions, can be provided as annotations in the code by the developer. This enables automated, yet user-friendly formal verification for smart contracts. We demonstrate solc-verify by examining real-world examples where our tool can effectively find bugs and prove correctness of non-trivial properties with minimal user effort.},\\n}\\n\\n\",\"author_short\":[\"Hajdu, Á.\",\"Jovanović, D.\"],\"key\":\"vstte2019\",\"id\":\"vstte2019\",\"bibbaseid\":\"hajdu-jovanovi-solcverifyamodularverifierforsoliditysmartcontracts-2020\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/vstte2019.pdf\",\" link\":\"https://link.springer.com/chapter/10.1007/978-3-030-41600-3_11\",\" slides\":\"https://hajduakos.github.io/publications/slides/vstte2019.pdf\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"Journal\",\"author\":[{\"firstnames\":[\"Ákos\"],\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"suffixes\":[]},{\"firstnames\":[\"Zoltán\"],\"propositions\":[],\"lastnames\":[\"Micskei\"],\"suffixes\":[]}],\"title\":\"Efficient Strategies for CEGAR-based Model Checking\",\"journal\":\"Journal of Automated Reasoning\",\"volume\":\"64\",\"number\":\"6\",\"pages\":\"1051–1091\",\"year\":\"2020\",\"doi\":\"10.1007/s10817-019-09535-x\",\"url_pdf\":\"https://link.springer.com/content/pdf/10.1007%2Fs10817-019-09535-x.pdf\",\"url_link\":\"https://link.springer.com/article/10.1007/s10817-019-09535-x\",\"abstract\":\"Automated formal verification is often based on the Counterexample-Guided Abstraction Refinement (CEGAR) approach. Many variants of CEGAR have been developed over the years as different problem domains usually require different strategies for efficient verification. This has lead to generic and configurable CEGAR frameworks, which can incorporate various algorithms. In our paper we propose six novel improvements to different aspects of the CEGAR approach, including both abstraction and refinement. We implement our new contributions in the Theta framework allowing us to compare them with state-of-the-art algorithms. We conduct an experiment on a diverse set of models to address research questions related to the effectiveness and efficiency of our new strategies. Results show that our new contributions perform well in general. Moreover, we highlight certain cases where performance could not be increased or where a remarkable improvement is achieved.\",\"bibtex\":\"@article{jar2019,\\n    author   = {{\\\\'A}kos Hajdu and Zolt{\\\\'a}n Micskei},\\n    title    = {Efficient Strategies for {CEGAR}-based Model Checking},\\n    journal  = {Journal of Automated Reasoning},\\n    volume   = {64},\\n    number   = {6},\\n    pages    = {1051--1091},\\n    year     = {2020},\\n    doi      = {10.1007/s10817-019-09535-x},\\n\\n    type     = {Journal},\\n\\n    url_pdf  = {https://link.springer.com/content/pdf/10.1007%2Fs10817-019-09535-x.pdf},\\n    url_link = {https://link.springer.com/article/10.1007/s10817-019-09535-x},\\n\\n    abstract = {Automated formal verification is often based on the Counterexample-Guided Abstraction Refinement (CEGAR) approach. Many variants of CEGAR have been developed over the years as different problem domains usually require different strategies for efficient verification. This has lead to generic and configurable CEGAR frameworks, which can incorporate various algorithms. In our paper we propose six novel improvements to different aspects of the CEGAR approach, including both abstraction and refinement. We implement our new contributions in the Theta framework allowing us to compare them with state-of-the-art algorithms. We conduct an experiment on a diverse set of models to address research questions related to the effectiveness and efficiency of our new strategies. Results show that our new contributions perform well in general. Moreover, we highlight certain cases where performance could not be increased or where a remarkable improvement is achieved.},\\n}\\n\\n\",\"author_short\":[\"Hajdu, Á.\",\"Micskei, Z.\"],\"key\":\"jar2019\",\"id\":\"jar2019\",\"bibbaseid\":\"hajdu-micskei-efficientstrategiesforcegarbasedmodelchecking-2020\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://link.springer.com/content/pdf/10.1007%2Fs10817-019-09535-x.pdf\",\" link\":\"https://link.springer.com/article/10.1007/s10817-019-09535-x\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":13,\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"Conference\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Jovanović\"],\"firstnames\":[\"Dejan\"],\"suffixes\":[]}],\"title\":\"SMT-Friendly Formalization of the Solidity Memory Model\",\"year\":\"2020\",\"booktitle\":\"Programming Languages and Systems\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"12075\",\"pages\":\"224–250\",\"publisher\":\"Springer\",\"doi\":\"10.1007/978-3-030-44914-8_9\",\"url_pdf\":\"https://hajduakos.github.io/publications/esop2020.pdf\",\"url_link\":\"https://link.springer.com/chapter/10.1007/978-3-030-44914-8_9\",\"url_slides\":\"https://hajduakos.github.io/publications/slides/smt2020.pdf\",\"url_video\":\"https://youtu.be/B3ML9vGituk?t=626\",\"abstract\":\"Solidity is the dominant programming language for Ethereum smart contracts. This paper presents a high-level formalization of the Solidity language with a focus on the memory model. The presented formalization covers all features of the language related to managing state and memory. In addition, the formalization we provide is effective: all but few features can be encoded in the quantifier-free fragment of standard SMT theories. This enables precise and efficient reasoning about the state of smart contracts written in Solidity. The formalization is implemented in the solc-verify verifier and we provide an extensive set of tests that covers the breadth of the required semantics. We also provide an evaluation on the test set that validates the semantics and shows the novelty of the approach compared to other Solidity-level contract analysis tools. \",\"bibtex\":\"@incollection{esop2020,\\n    author     = {Hajdu, {\\\\'A}kos and Jovanovi{\\\\'c}, Dejan},\\n    title      = {{SMT}-Friendly Formalization of the {S}olidity Memory Model},\\n    year       = {2020},\\n    booktitle  = {Programming Languages and Systems},\\n    series     = {Lecture Notes in Computer Science},\\n    volume     = {12075},\\n    pages      = {224--250},\\n    publisher  = {Springer},\\n    doi        = {10.1007/978-3-030-44914-8_9},\\n\\n    type       = {Conference},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/esop2020.pdf},\\n    url_link   = {https://link.springer.com/chapter/10.1007/978-3-030-44914-8_9},\\n    url_slides = {https://hajduakos.github.io/publications/slides/smt2020.pdf},\\n    url_video  = {https://youtu.be/B3ML9vGituk?t=626},\\n    abstract   = {Solidity is the dominant programming language for Ethereum smart contracts. This paper presents a high-level formalization of the Solidity language with a focus on the memory model. The presented formalization covers all features of the language related to managing state and memory. In addition, the formalization we provide is effective: all but few features can be encoded in the quantifier-free fragment of standard SMT theories. This enables precise and efficient reasoning about the state of smart contracts written in Solidity. The formalization is implemented in the solc-verify verifier and we provide an extensive set of tests that covers the breadth of the required semantics. We also provide an evaluation on the test set that validates the semantics and shows the novelty of the approach compared to other Solidity-level contract analysis tools. },\\n}\\n\\n\",\"author_short\":[\"Hajdu, Á.\",\"Jovanović, D.\"],\"key\":\"esop2020\",\"id\":\"esop2020\",\"bibbaseid\":\"hajdu-jovanovi-smtfriendlyformalizationofthesoliditymemorymodel-2020\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/esop2020.pdf\",\" link\":\"https://link.springer.com/chapter/10.1007/978-3-030-44914-8_9\",\" slides\":\"https://hajduakos.github.io/publications/slides/smt2020.pdf\",\" video\":\"https://youtu.be/B3ML9vGituk?t=626\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"Workshop\",\"author\":[{\"firstnames\":[\"Ákos\"],\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Jovanović\"],\"firstnames\":[\"Dejan\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ciocarlie\"],\"firstnames\":[\"Gabriela\"],\"suffixes\":[]}],\"title\":\"Formal Specification and Verification of Solidity Contracts with Events (short paper)\",\"booktitle\":\"2nd Workshop on Formal Methods for Blockchains\",\"series\":\"OpenAccess Series in Informatics (OASIcs)\",\"volume\":\"84\",\"pages\":\"2:1–2:9\",\"publisher\":\"Schloss Dagstuhl–Leibniz-Zentrum für Informatik\",\"year\":\"2020\",\"isbn\":\"978-3-95977-169-6\",\"issn\":\"2190-6807\",\"doi\":\"10.4230/OASIcs.FMBC.2020.2\",\"url_pdf\":\"https://drops.dagstuhl.de/opus/volltexte/2020/13415/pdf/OASIcs-FMBC-2020-2.pdf\",\"url_link\":\"https://drops.dagstuhl.de/opus/volltexte/2020/13415/\",\"url_slides\":\"https://hajduakos.github.io/publications/slides/fmbc2020.pdf\",\"url_video\":\"https://youtu.be/NNytwVBZ1no\",\"abstract\":\"Events in the Solidity language provide a means of communication between the on-chain services of decentralized applications and the users of those services. Events are commonly used as an abstraction of contract execution that is relevant from the users' perspective. Users must, therefore, be able to understand the meaning and trust the validity of the emitted events. This paper presents a source-level approach for the formal specification and verification of Solidity contracts with the primary focus on events. Our approach allows the specification of events in terms of the on-chain data that they track, and the predicates that define the correspondence between the blockchain state and the abstract view provided by the events. The approach is implemented in solc-verify, a modular verifier for Solidity, and we demonstrate its applicability with various examples.\",\"bibtex\":\"@incollection{fmbc2020,\\n    author     = {{\\\\'A}kos Hajdu and Jovanovi{\\\\'c}, Dejan and Ciocarlie, Gabriela},\\n    title      = {Formal Specification and Verification of {S}olidity Contracts with Events (short paper)},\\n    booktitle  = {2nd Workshop on Formal Methods for Blockchains},\\n    series     = {OpenAccess Series in Informatics (OASIcs)},\\n    volume     = {84},\\n    pages      = {2:1--2:9},\\n    publisher  = {Schloss Dagstuhl--Leibniz-Zentrum f{\\\\\\\"u}r Informatik},\\n    year       = {2020},\\n    isbn       = {978-3-95977-169-6},\\n    issn       = {2190-6807},\\n    doi        = {10.4230/OASIcs.FMBC.2020.2},\\n\\n    type       = {Workshop},\\n\\n    url_pdf    = {https://drops.dagstuhl.de/opus/volltexte/2020/13415/pdf/OASIcs-FMBC-2020-2.pdf},\\n    url_link   = {https://drops.dagstuhl.de/opus/volltexte/2020/13415/},\\n    url_slides = {https://hajduakos.github.io/publications/slides/fmbc2020.pdf},\\n    url_video  = {https://youtu.be/NNytwVBZ1no},\\n    abstract   = {Events in the Solidity language provide a means of communication between the on-chain services of decentralized applications and the users of those services. Events are commonly used as an abstraction of contract execution that is relevant from the users' perspective. Users must, therefore, be able to understand the meaning and trust the validity of the emitted events. This paper presents a source-level approach for the formal specification and verification of Solidity contracts with the primary focus on events. Our approach allows the specification of events in terms of the on-chain data that they track, and the predicates that define the correspondence between the blockchain state and the abstract view provided by the events. The approach is implemented in solc-verify, a modular verifier for Solidity, and we demonstrate its applicability with various examples.}\\n}\\n\\n\",\"author_short\":[\"Hajdu, Á.\",\"Jovanović, D.\",\"Ciocarlie, G.\"],\"key\":\"fmbc2020\",\"id\":\"fmbc2020\",\"bibbaseid\":\"hajdu-jovanovi-ciocarlie-formalspecificationandverificationofsoliditycontractswitheventsshortpaper-2020\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://drops.dagstuhl.de/opus/volltexte/2020/13415/pdf/OASIcs-FMBC-2020-2.pdf\",\" link\":\"https://drops.dagstuhl.de/opus/volltexte/2020/13415/\",\" slides\":\"https://hajduakos.github.io/publications/slides/fmbc2020.pdf\",\" video\":\"https://youtu.be/NNytwVBZ1no\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":10,\"html\":\"\"},{\"bibtype\":\"misc\",\"type\":\"Patent application\",\"title\":\"MIDDLEWARE TO AUTOMATICALLY VERIFY SMART CONTRACTS ON BLOCKCHAINS\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ciocarlie\"],\"firstnames\":[\"Gabriela\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Eldefrawy\"],\"firstnames\":[\"Karim\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Lepoint\"],\"firstnames\":[\"Tancrede\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Navas\"],\"firstnames\":[\"Jorge\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Jovanović\"],\"firstnames\":[\"Dejan\"],\"suffixes\":[]}],\"year\":\"2020\",\"month\":\"June\",\"note\":\"US Patent App. 16/227,728\",\"url_link\":\"http://www.freepatentsonline.com/y2020/0201838.html\",\"abstract\":\"A method, apparatus and system for automated verification of a smart contract on a blockchain include translating operating properties of a smart contract annotated with contract specifications at a source code level into verification conditions in an intermediate verification language, discharging the verification conditions using an SMT solver, and reporting results of the discharged verification conditions, such as successes and failures of the discharged verification conditions. The translating can include mapping statements of the smart contract to statements of the intermediate verification language and mapping expressions of the smart contract to expressions of the intermediate verification language. \",\"bibtex\":\"@misc{patent2020,\\n    title     = {MIDDLEWARE TO AUTOMATICALLY VERIFY SMART CONTRACTS ON BLOCKCHAINS},\\n    author    = {Ciocarlie, Gabriela and Eldefrawy, Karim and Lepoint, Tancrede and Navas, Jorge and Hajdu, {\\\\'A}kos and Jovanovi{\\\\'c}, Dejan},\\n    year      = {2020},\\n    month     = {June},\\n    note      = {US Patent App. 16/227,728},\\n\\n    type      = {Patent application},\\n\\n    url_link  = {http://www.freepatentsonline.com/y2020/0201838.html},\\n    abstract  = {A method, apparatus and system for automated verification of a smart contract on a blockchain include translating operating properties of a smart contract annotated with contract specifications at a source code level into verification conditions in an intermediate verification language, discharging the verification conditions using an SMT solver, and reporting results of the discharged verification conditions, such as successes and failures of the discharged verification conditions. The translating can include mapping statements of the smart contract to statements of the intermediate verification language and mapping expressions of the smart contract to expressions of the intermediate verification language. }\\n}\\n\\n\",\"author_short\":[\"Ciocarlie, G.\",\"Eldefrawy, K.\",\"Lepoint, T.\",\"Navas, J.\",\"Hajdu, Á.\",\"Jovanović, D.\"],\"key\":\"patent2020\",\"id\":\"patent2020\",\"bibbaseid\":\"ciocarlie-eldefrawy-lepoint-navas-hajdu-jovanovi-middlewaretoautomaticallyverifysmartcontractsonblockchains-2020\",\"role\":\"author\",\"urls\":{\" link\":\"http://www.freepatentsonline.com/y2020/0201838.html\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":10,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"Workshop\",\"author\":[{\"firstnames\":[\"Benedek\"],\"propositions\":[],\"lastnames\":[\"Horváth\"],\"suffixes\":[]},{\"firstnames\":[\"Bence\"],\"propositions\":[],\"lastnames\":[\"Graics\"],\"suffixes\":[]},{\"firstnames\":[\"Ákos\"],\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"suffixes\":[]},{\"firstnames\":[\"Zoltán\"],\"propositions\":[],\"lastnames\":[\"Micskei\"],\"suffixes\":[]},{\"firstnames\":[\"Vince\"],\"propositions\":[],\"lastnames\":[\"Molnár\"],\"suffixes\":[]},{\"firstnames\":[\"István\"],\"propositions\":[],\"lastnames\":[\"Ráth\"],\"suffixes\":[]},{\"firstnames\":[\"Luigi\"],\"propositions\":[],\"lastnames\":[\"Andolfato\"],\"suffixes\":[]},{\"firstnames\":[\"Ivan\"],\"propositions\":[],\"lastnames\":[\"Gomes\"],\"suffixes\":[]},{\"firstnames\":[\"Robert\"],\"propositions\":[],\"lastnames\":[\"Karban\"],\"suffixes\":[]}],\"title\":\"Model Checking as a Service: Towards Pragmatic Hidden Formal Methods\",\"booktitle\":\"Proceedings of the 23rd ACM/IEEE International Conference on Model Driven Engineering Languages and Systems: Companion Proceedings\",\"articleno\":\"37\",\"numpages\":\"5\",\"year\":\"2020\",\"doi\":\"10.1145/3417990.3421407\",\"url_pdf\":\"https://hajduakos.github.io/publications/openmbee2020.pdf\",\"url_link\":\"https://doi.org/10.1145/3417990.3421407\",\"abstract\":\"Executable models can be used to support all engineering activities in Model-Based Systems Engineering. Testing and simulation of such models can provide early feedback about design choices. However, in today's complex systems, failures could arise due to subtle errors that are hard to find without checking all possible execution paths. Formal methods, and especially model checking can uncover such subtle errors, yet their usage in practice is limited due to the specialized expertise and high computing power required. Therefore we created an automated, cloud-based environment that can verify complex reachability properties on SysML State Machines using hidden model checkers. The approach and the prototype is illustrated using an example from the aerospace domain.\",\"bibtex\":\"@inproceedings{openmbee2020,\\n    author     = {Benedek Horv{\\\\'a}th and Bence Graics and {\\\\'A}kos Hajdu and Zolt{\\\\'a}n Micskei and Vince Moln{\\\\'a}r and Istv{\\\\'a}n R{\\\\'a}th and Luigi Andolfato and Ivan Gomes and Robert Karban},\\n    title      = {Model Checking as a Service: Towards Pragmatic Hidden Formal Methods},\\n    booktitle  = {Proceedings of the 23rd ACM/IEEE International Conference on Model Driven Engineering Languages and Systems: Companion Proceedings},\\n    articleno  = {37},\\n    numpages   = {5},\\n    year       = {2020},\\n    doi        = {10.1145/3417990.3421407},\\n\\n    type       = {Workshop},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/openmbee2020.pdf},\\n    url_link   = {https://doi.org/10.1145/3417990.3421407},\\n    abstract   = {Executable models can be used to support all engineering activities in Model-Based Systems Engineering. Testing and simulation of such models can provide early feedback about design choices. However, in today's complex systems, failures could arise due to subtle errors that are hard to find without checking all possible execution paths. Formal methods, and especially model checking can uncover such subtle errors, yet their usage in practice is limited due to the specialized expertise and high computing power required. Therefore we created an automated, cloud-based environment that can verify complex reachability properties on SysML State Machines using hidden model checkers. The approach and the prototype is illustrated using an example from the aerospace domain.},\\n}\\n\\n\",\"author_short\":[\"Horváth, B.\",\"Graics, B.\",\"Hajdu, Á.\",\"Micskei, Z.\",\"Molnár, V.\",\"Ráth, I.\",\"Andolfato, L.\",\"Gomes, I.\",\"Karban, R.\"],\"key\":\"openmbee2020\",\"id\":\"openmbee2020\",\"bibbaseid\":\"horvth-graics-hajdu-micskei-molnr-rth-andolfato-gomes-etal-modelcheckingasaservicetowardspragmatichiddenformalmethods-2020\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/openmbee2020.pdf\",\" link\":\"https://doi.org/10.1145/3417990.3421407\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\",\"graics, b\":\"https://ftsrg.mit.bme.hu/gamma/publications/\"}},\"downloads\":8,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"Journal\",\"author\":[{\"firstnames\":[\"Ákos\"],\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"suffixes\":[]},{\"firstnames\":[\"Naghmeh\"],\"propositions\":[],\"lastnames\":[\"Ivaki\"],\"suffixes\":[]},{\"firstnames\":[\"Imre\"],\"propositions\":[],\"lastnames\":[\"Kocsis\"],\"suffixes\":[]},{\"firstnames\":[\"Attila\"],\"propositions\":[],\"lastnames\":[\"Klenik\"],\"suffixes\":[]},{\"firstnames\":[\"László\"],\"propositions\":[],\"lastnames\":[\"Gönczy\"],\"suffixes\":[]},{\"firstnames\":[\"Nuno\"],\"propositions\":[],\"lastnames\":[\"Laranjeiro\"],\"suffixes\":[]},{\"firstnames\":[\"Henrique\"],\"propositions\":[],\"lastnames\":[\"Madeira\"],\"suffixes\":[]},{\"firstnames\":[\"András\"],\"propositions\":[],\"lastnames\":[\"Pataricza\"],\"suffixes\":[]}],\"title\":\"Using Fault Injection to Assess Blockchain Systems in Presence of Faulty Smart Contracts\",\"journal\":\"IEEE Access\",\"year\":\"2020\",\"volume\":\"8\",\"pages\":\"190760–190783\",\"doi\":\"10.1109/ACCESS.2020.3032239\",\"url_pdf\":\"https://arxiv.org/abs/2006.11597.pdf\",\"url_link\":\"https://ieeexplore.ieee.org/document/9229414\",\"abstract\":\"Blockchain has become particularly popular due to its promise to support businesscritical services in very different domains (e.g., retail, healthcare). Blockchain systems rely on complex middleware, like Ethereum or Hyperledger Fabric, that allow running smart contracts, which specify business logic in cooperative applications. The presence of software defects in these contracts has notably caused failures, including severe security problems. In this paper, we use software-implemented fault injection (SWIFI) to assess the behavior of permissioned blockchain systems in the presence of faulty smart contracts. We emulate the occurrence of general software faults and also blockchain-specific software faults (e.g., missing require on transaction sender) in smart contracts code and observe the impact on the overall system dependability in terms of reliability and integrity. We also analyze the effectiveness of formal verification and runtime protection mechanisms in detecting the injected faults. Results indicate that formal verification and runtime protections have to complement built-in platform checks to guarantee proper dependability of blockchain systems. The work presented in this paper allows smart contract developers to become aware of possible faults in smart contracts and to understand the impact of their presence. It also provides valuable information for middleware developers to improve the overall fault tolerance of their systems.\",\"bibtex\":\"@article{access2020,\\n    author     = {{\\\\'A}kos Hajdu and Naghmeh Ivaki and Imre Kocsis and Attila Klenik and L{\\\\'a}szl{\\\\'o} G{\\\\\\\"o}nczy and Nuno Laranjeiro and Henrique Madeira and Andr{\\\\'a}s Pataricza},\\n    title      = {Using Fault Injection to Assess Blockchain Systems in Presence of Faulty Smart Contracts},\\n    journal    = {IEEE Access},\\n    year       = {2020},\\n    volume     = {8},\\n    pages      = {190760--190783},\\n    doi        = {10.1109/ACCESS.2020.3032239},\\n\\n    type       = {Journal},\\n\\n    url_pdf    = {https://arxiv.org/abs/2006.11597.pdf},\\n    url_link   = {https://ieeexplore.ieee.org/document/9229414},\\n    abstract   = {Blockchain has become particularly popular due to its promise to support businesscritical services in very different domains (e.g., retail, healthcare). Blockchain systems rely on complex middleware, like Ethereum or Hyperledger Fabric, that allow running smart contracts, which specify business logic in cooperative applications. The presence of software defects in these contracts has notably caused failures, including severe security problems. In this paper, we use software-implemented fault injection (SWIFI) to assess the behavior of permissioned blockchain systems in the presence of faulty smart contracts. We emulate the occurrence of general software faults and also blockchain-specific software faults (e.g., missing require on transaction sender) in smart contracts code and observe the impact on the overall system dependability in terms of reliability and integrity. We also analyze the effectiveness of formal verification and runtime protection mechanisms in detecting the injected faults. Results indicate that formal verification and runtime protections have to complement built-in platform checks to guarantee proper dependability of blockchain systems. The work presented in this paper allows smart contract developers to become aware of possible faults in smart contracts and to understand the impact of their presence. It also provides valuable information for middleware developers to improve the overall fault tolerance of their systems.},\\n}\\n\\n\",\"author_short\":[\"Hajdu, Á.\",\"Ivaki, N.\",\"Kocsis, I.\",\"Klenik, A.\",\"Gönczy, L.\",\"Laranjeiro, N.\",\"Madeira, H.\",\"Pataricza, A.\"],\"key\":\"access2020\",\"id\":\"access2020\",\"bibbaseid\":\"hajdu-ivaki-kocsis-klenik-gnczy-laranjeiro-madeira-pataricza-usingfaultinjectiontoassessblockchainsystemsinpresenceoffaultysmartcontracts-2020\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://arxiv.org/abs/2006.11597.pdf\",\" link\":\"https://ieeexplore.ieee.org/document/9229414\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"Conference\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ádam\"],\"firstnames\":[\"Zsófia\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Sallai\"],\"firstnames\":[\"Gyula\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]}],\"title\":\"Gazer-Theta: LLVM-based Verifier Portfolio with BMC/CEGAR (Competition Contribution)\",\"year\":\"2021\",\"booktitle\":\"Tools and Algorithms for the Construction and Analysis of Systems\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"12652\",\"publisher\":\"Springer\",\"pages\":\"435–439\",\"doi\":\"10.1007/978-3-030-72013-1_27\",\"url_pdf\":\"https://hajduakos.github.io/publications/tacas2021.pdf\",\"url_video\":\"https://youtu.be/8DEtrRJixpA\",\"abstract\":\"Gazer-Theta is a software model checking toolchain including various analyses for state reachability. The frontend, namely Gazer, supports C programs through an LLVM-based transformation and optimization pipeline. Gazer includes an integrated bounded model checker (BMC) and can also employ the Theta backend, a generic verification framework based on abstraction-refinement (CEGAR). On SV-COMP 2021, a portfolio of BMC, explicit-value analysis, and predicate abstraction is applied sequentially in this order.\",\"bibtex\":\"@incollection{tacas2021,\\n    author     = {{\\\\'A}dam, Zs{\\\\'o}fia and Sallai, Gyula and Hajdu, {\\\\'A}kos},\\n    title      = {{G}azer-{T}heta: {LLVM}-based Verifier Portfolio with {BMC}/{CEGAR} (Competition Contribution)},\\n    year       = {2021},\\n    booktitle  = {Tools and Algorithms for the Construction and Analysis of Systems},\\n    series     = {Lecture Notes in Computer Science},\\n    volume     = {12652},\\n    publisher  = {Springer},\\n    pages      = {435--439},\\n    doi        = {10.1007/978-3-030-72013-1_27},\\n\\n    type       = {Conference},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/tacas2021.pdf},\\n    url_video  = {https://youtu.be/8DEtrRJixpA},\\n    abstract   = {Gazer-Theta is a software model checking toolchain including various analyses for state reachability. The frontend, namely Gazer, supports C programs through an LLVM-based transformation and optimization pipeline. Gazer includes an integrated bounded model checker (BMC) and can also employ the Theta backend, a generic verification framework based on abstraction-refinement (CEGAR). On SV-COMP 2021, a portfolio of BMC, explicit-value analysis, and predicate abstraction is applied sequentially in this order.},\\n}\\n\\n\",\"author_short\":[\"Ádam, Z.\",\"Sallai, G.\",\"Hajdu, Á.\"],\"key\":\"tacas2021\",\"id\":\"tacas2021\",\"bibbaseid\":\"dam-sallai-hajdu-gazerthetallvmbasedverifierportfoliowithbmccegarcompetitioncontribution-2021\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/tacas2021.pdf\",\" video\":\"https://youtu.be/8DEtrRJixpA\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":21,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"Workshop\",\"author\":[{\"firstnames\":[\"Mihály\"],\"propositions\":[],\"lastnames\":[\"Dobos-Kovács\"],\"suffixes\":[]},{\"firstnames\":[\"Ákos\"],\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"suffixes\":[]},{\"firstnames\":[\"András\"],\"propositions\":[],\"lastnames\":[\"Vörös\"],\"suffixes\":[]}],\"title\":\"Bitvector Support in the Theta Formal Verification Framework\",\"booktitle\":\"Proceedings of the 10th Latin-American Symposium on Dependable Computing\",\"year\":\"2021\",\"publisher\":\"IEEE\",\"doi\":\"10.1109/LADC53747.2021.9672595\",\"url_pdf\":\"https://hajduakos.github.io/publications/wafers2021.pdf\",\"url_link\":\"https://ieeexplore.ieee.org/document/9672595\",\"abstract\":\"The verification of safety-critical software systems has many challenges, such as the complex language constructs in embedded software. This paper addresses the verification problem of software systems using bitwise operations, and we present an extension to the Theta open-source formal verification framework. Our goal is to integrate bitvectors and bitwise operations in the abstraction-refinement-based formal verification methods in Theta. Supporting bitvectors is a step towards the verification of industrial embedded software systems. We extended the language support in Theta with formal semantics. In addition, the new language constructs and operators are transformed into the formal language inside Theta. We also need new algorithms to solve the verification problem: we implemented Newton-style refinement algorithms in Theta to verify software with bitvectors and bitwise operators efficiently.\",\"bibtex\":\"@inproceedings{wafers2021,\\n    author     = {Mih{\\\\'a}ly Dobos-Kov{\\\\'a}cs and {\\\\'A}kos Hajdu and Andr{\\\\'a}s V{\\\\\\\"o}r{\\\\\\\"o}s},\\n    title      = {Bitvector Support in the {T}heta Formal Verification Framework},\\n    booktitle  = {Proceedings of the 10th Latin-American Symposium on Dependable Computing},\\n    year       = {2021},\\n    publisher  = {IEEE},\\n    doi        = {10.1109/LADC53747.2021.9672595},\\n\\n    type       = {Workshop},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/wafers2021.pdf},\\n    url_link   = {https://ieeexplore.ieee.org/document/9672595},\\n    abstract   = {The verification of safety-critical software systems has many challenges, such as the complex language constructs in embedded software. This paper addresses the verification problem of software systems using bitwise operations, and we present an extension to the Theta open-source formal verification framework. Our goal is to integrate bitvectors and bitwise operations in the abstraction-refinement-based formal verification methods in Theta. Supporting bitvectors is a step towards the verification of industrial embedded software systems. We extended the language support in Theta with formal semantics. In addition, the new language constructs and operators are transformed into the formal language inside Theta. We also need new algorithms to solve the verification problem: we implemented Newton-style refinement algorithms in Theta to verify software with bitvectors and bitwise operators efficiently.},\\n}\\n\\n\",\"author_short\":[\"Dobos-Kovács, M.\",\"Hajdu, Á.\",\"Vörös, A.\"],\"key\":\"wafers2021\",\"id\":\"wafers2021\",\"bibbaseid\":\"doboskovcs-hajdu-vrs-bitvectorsupportinthethetaformalverificationframework-2021\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/wafers2021.pdf\",\" link\":\"https://ieeexplore.ieee.org/document/9672595\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"Conference\",\"author\":[{\"firstnames\":[\"Ke\"],\"propositions\":[],\"lastnames\":[\"Mao\"],\"suffixes\":[]},{\"firstnames\":[\"Timotej\"],\"propositions\":[],\"lastnames\":[\"Kapus\"],\"suffixes\":[]},{\"firstnames\":[\"Lambros\"],\"propositions\":[],\"lastnames\":[\"Petrou\"],\"suffixes\":[]},{\"firstnames\":[\"Ákos\"],\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"suffixes\":[]},{\"firstnames\":[\"Matteo\"],\"propositions\":[],\"lastnames\":[\"Marescotti\"],\"suffixes\":[]},{\"firstnames\":[\"Andreas\"],\"propositions\":[],\"lastnames\":[\"Löscher\"],\"suffixes\":[]},{\"firstnames\":[\"Mark\"],\"propositions\":[],\"lastnames\":[\"Harman\"],\"suffixes\":[]},{\"firstnames\":[\"Dino\"],\"propositions\":[],\"lastnames\":[\"Distefano\"],\"suffixes\":[]}],\"title\":\"FAUSTA: Scaling Dynamic Analysis with Traffic Generation at WhatsApp\",\"booktitle\":\"Proceedings of the 15th IEEE International Conference on Software Testing, Verification and Validation\",\"year\":\"2022\",\"publisher\":\"IEEE\",\"pages\":\"267–278\",\"doi\":\"10.1109/ICST53961.2022.00036\",\"url_pdf\":\"https://hajduakos.github.io/publications/icst2022.pdf\",\"url_link\":\"https://ieeexplore.ieee.org/document/9787859\",\"abstract\":\"We introduce Fausta, an algorithmic traffic gener-ation platform that enables analysis and testing at scale. Fausta has been deployed at Meta to analyze and test the WhatsApp plat-form infrastructure since September 2020, enabling WhatsApp developers to deploy reliable code changes to a code base of millions of lines of code, supporting over 2 billion users who rely on WhatsApp for their daily communications. Fausta covers expected and unexpected program behaviors in a privacy-safe controlled environment to support multiple use cases such as reliability testing, privacy analysis and performance regression detection. It currently supports three different algorithmic input generation strategies, each of which construct realistic backend server traffic that closely simulates production data, without replaying any real user data. Fausta has been deployed and closely integrated into the WhatsApp continuous integration process, catching bugs in development before they hit production. We report on the development and deployment of Fausta's reliability use case between September 2020 and August 2021. During this period it has found 1,876 unique reliability issues, with a fix rate of 74%, indicating a high degree of true positive fault revelation. We also report on the distribution of fault types revealed by Fausta, and the correlation between coverage and faults found. Overall, we do find evidence that higher coverage is correlated with fault revelation.\",\"bibtex\":\"@inproceedings{icst2022,\\n    author     = {Ke Mao and Timotej Kapus and Lambros Petrou and {\\\\'A}kos Hajdu and Matteo Marescotti and Andreas L{\\\\\\\"o}scher and Mark Harman and Dino Distefano},\\n    title      = {{FAUSTA}: Scaling Dynamic Analysis with Traffic Generation at {W}hats{A}pp},\\n    booktitle  = {Proceedings of the 15th IEEE International Conference on Software Testing, Verification and Validation},\\n    year       = {2022},\\n    publisher  = {IEEE},\\n    pages      = {267--278},\\n    doi        = {10.1109/ICST53961.2022.00036},\\n\\n    type       = {Conference},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/icst2022.pdf},\\n    url_link   = {https://ieeexplore.ieee.org/document/9787859},\\n    abstract   = {We introduce Fausta, an algorithmic traffic gener-ation platform that enables analysis and testing at scale. Fausta has been deployed at Meta to analyze and test the WhatsApp plat-form infrastructure since September 2020, enabling WhatsApp developers to deploy reliable code changes to a code base of millions of lines of code, supporting over 2 billion users who rely on WhatsApp for their daily communications. Fausta covers expected and unexpected program behaviors in a privacy-safe controlled environment to support multiple use cases such as reliability testing, privacy analysis and performance regression detection. It currently supports three different algorithmic input generation strategies, each of which construct realistic backend server traffic that closely simulates production data, without replaying any real user data. Fausta has been deployed and closely integrated into the WhatsApp continuous integration process, catching bugs in development before they hit production. We report on the development and deployment of Fausta's reliability use case between September 2020 and August 2021. During this period it has found 1,876 unique reliability issues, with a fix rate of 74%, indicating a high degree of true positive fault revelation. We also report on the distribution of fault types revealed by Fausta, and the correlation between coverage and faults found. Overall, we do find evidence that higher coverage is correlated with fault revelation.},\\n}\\n\\n\",\"author_short\":[\"Mao, K.\",\"Kapus, T.\",\"Petrou, L.\",\"Hajdu, Á.\",\"Marescotti, M.\",\"Löscher, A.\",\"Harman, M.\",\"Distefano, D.\"],\"key\":\"icst2022\",\"id\":\"icst2022\",\"bibbaseid\":\"mao-kapus-petrou-hajdu-marescotti-lscher-harman-distefano-faustascalingdynamicanalysiswithtrafficgenerationatwhatsapp-2022\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/icst2022.pdf\",\" link\":\"https://ieeexplore.ieee.org/document/9787859\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"Conference\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ádam\"],\"firstnames\":[\"Zsófia\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Levente\"],\"firstnames\":[\"Bajczi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Dobos-Kovács\"],\"firstnames\":[\"Mihály\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Molnár\"],\"firstnames\":[\"Vince\"],\"suffixes\":[]}],\"title\":\"Theta: portfolio of CEGAR-based analyses with dynamic algorithm selection (Competition Contribution)\",\"year\":\"2022\",\"booktitle\":\"Tools and Algorithms for the Construction and Analysis of Systems\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"13244\",\"pages\":\"474–478\",\"publisher\":\"Springer\",\"doi\":\"10.1007/978-3-030-99527-0_34\",\"url_pdf\":\"https://hajduakos.github.io/publications/tacas2022.pdf\",\"url_link\":\"https://link.springer.com/chapter/10.1007/978-3-030-99527-0_34\",\"abstract\":\"Theta is a model checking framework based on abstraction refinement algorithms. In SV-COMP 2022, we introduce: 1) reasoning at the source-level via a direct translation from C programs; 2) support for concurrent programs with interleaving semantics; 3) mitigation for non-progressing refinement loops; 4) support for SMT-LIB-compliant solvers. We combine all of the aforementioned techniques into a portfolio with dynamic algorithm selection.\",\"bibtex\":\"@incollection{tacas2022,\\n    author     = {{\\\\'A}dam, Zs{\\\\'o}fia and Levente, Bajczi and Dobos-Kov{\\\\'a}cs, Mih{\\\\'a}ly and Hajdu, {\\\\'A}kos and Moln{\\\\'a}r, Vince},\\n    title      = {{T}heta: portfolio of {CEGAR}-based analyses with dynamic algorithm selection (Competition Contribution)},\\n    year       = {2022},\\n    booktitle  = {Tools and Algorithms for the Construction and Analysis of Systems},\\n    series     = {Lecture Notes in Computer Science},\\n    volume     = {13244},\\n    pages      = {474--478},\\n    publisher  = {Springer},\\n    doi        = {10.1007/978-3-030-99527-0_34},\\n\\n    type       = {Conference},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/tacas2022.pdf},\\n    url_link   = {https://link.springer.com/chapter/10.1007/978-3-030-99527-0_34},\\n    abstract   = {Theta is a model checking framework based on abstraction refinement algorithms. In SV-COMP 2022, we introduce: 1) reasoning at the source-level via a direct translation from C programs; 2) support for concurrent programs with interleaving semantics; 3) mitigation for non-progressing refinement loops; 4) support for SMT-LIB-compliant solvers. We combine all of the aforementioned techniques into a portfolio with dynamic algorithm selection.},\\n}\\n\\n\",\"author_short\":[\"Ádam, Z.\",\"Levente, B.\",\"Dobos-Kovács, M.\",\"Hajdu, Á.\",\"Molnár, V.\"],\"key\":\"tacas2022\",\"id\":\"tacas2022\",\"bibbaseid\":\"dam-levente-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/tacas2022.pdf\",\" link\":\"https://link.springer.com/chapter/10.1007/978-3-030-99527-0_34\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"Workshop\",\"author\":[{\"firstnames\":[\"Ákos\"],\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"suffixes\":[]},{\"firstnames\":[\"Matteo\"],\"propositions\":[],\"lastnames\":[\"Marescotti\"],\"suffixes\":[]},{\"firstnames\":[\"Thibault\"],\"propositions\":[],\"lastnames\":[\"Suzanne\"],\"suffixes\":[]},{\"firstnames\":[\"Ke\"],\"propositions\":[],\"lastnames\":[\"Mao\"],\"suffixes\":[]},{\"firstnames\":[\"Radu\"],\"propositions\":[],\"lastnames\":[\"Grigore\"],\"suffixes\":[]},{\"firstnames\":[\"Per\"],\"propositions\":[],\"lastnames\":[\"Gustafsson\"],\"suffixes\":[]},{\"firstnames\":[\"Dino\"],\"propositions\":[],\"lastnames\":[\"Distefano\"],\"suffixes\":[]}],\"title\":\"InfERL: Scalable and Extensible Erlang Static Analysis\",\"year\":\"2022\",\"booktitle\":\"Proceedings of the 21st ACM SIGPLAN International Workshop on Erlang\",\"pages\":\"33–39\",\"publisher\":\"ACM\",\"doi\":\"10.1145/3546186.3549929\",\"url_pdf\":\"https://hajduakos.github.io/publications/erlang2022.pdf\",\"url_slides\":\"https://hajduakos.github.io/publications/slides/erlang2022.pdf\",\"url_link\":\"https://dl.acm.org/doi/abs/10.1145/3546186.3549929\",\"url_video\":\"https://www.youtube.com/watch?v=ZDZtauSxyaE\",\"abstract\":\"In this paper we introduce InfERL, an open source, scalable, and extensible static analyzer for Erlang, based on Meta's Infer tool. InfERL has been developed at WhatsApp and it is deployed to regularly scan WhatsApp server's Erlang codebase, detecting reliability issues and checking user-defined properties. The paper describes the Erlang specific technical challenges we had to address and our design choices. We also report on our experience in running InfERL on Erlang code at scale, supporting the messaging app used everyday by over 2 billion people.\",\"bibtex\":\"@inproceedings{erlang2022,\\n    author     = {{\\\\'A}kos Hajdu and Matteo Marescotti and Thibault Suzanne and Ke Mao and Radu Grigore and Per Gustafsson and Dino Distefano},\\n    title      = {{InfERL}: Scalable and Extensible {E}rlang Static Analysis},\\n    year       = {2022},\\n    booktitle  = {Proceedings of the 21st ACM SIGPLAN International Workshop on Erlang},\\n    pages      = {33--39},\\n    publisher  = {ACM},\\n    doi        = {10.1145/3546186.3549929},\\n\\n    type       = {Workshop},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/erlang2022.pdf},\\n    url_slides = {https://hajduakos.github.io/publications/slides/erlang2022.pdf},\\n    url_link   = {https://dl.acm.org/doi/abs/10.1145/3546186.3549929},\\n    url_video  = {https://www.youtube.com/watch?v=ZDZtauSxyaE},\\n    abstract   = {In this paper we introduce InfERL, an open source, scalable, and extensible static analyzer for Erlang, based on Meta's Infer tool. InfERL has been developed at WhatsApp and it is deployed to regularly scan WhatsApp server's Erlang codebase, detecting reliability issues and checking user-defined properties. The paper describes the Erlang specific technical challenges we had to address and our design choices. We also report on our experience in running InfERL on Erlang code at scale, supporting the messaging app used everyday by over 2 billion people.},\\n}\\n\\n\",\"author_short\":[\"Hajdu, Á.\",\"Marescotti, M.\",\"Suzanne, T.\",\"Mao, K.\",\"Grigore, R.\",\"Gustafsson, P.\",\"Distefano, D.\"],\"key\":\"erlang2022\",\"id\":\"erlang2022\",\"bibbaseid\":\"hajdu-marescotti-suzanne-mao-grigore-gustafsson-distefano-inferlscalableandextensibleerlangstaticanalysis-2022\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/erlang2022.pdf\",\" slides\":\"https://hajduakos.github.io/publications/slides/erlang2022.pdf\",\" link\":\"https://dl.acm.org/doi/abs/10.1145/3546186.3549929\",\" video\":\"https://www.youtube.com/watch?v=ZDZtauSxyaE\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":16,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"Journal\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Horváth\"],\"firstnames\":[\"Benedek\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Molnár\"],\"firstnames\":[\"Vince\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Graics\"],\"firstnames\":[\"Bence\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ráth\"],\"firstnames\":[\"István\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Horváth\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Karban\"],\"firstnames\":[\"Robert\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Trancho\"],\"firstnames\":[\"Gelys\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Micskei\"],\"firstnames\":[\"Zoltán\"],\"suffixes\":[]}],\"title\":\"Pragmatic verification and validation of industrial executable SysML models\",\"year\":\"2023\",\"journal\":\"Systems Engineering\",\"doi\":\"10.1002/sys.21679\",\"volume\":\"26\",\"number\":\"6\",\"pages\":\"693–714\",\"url_pdf\":\"https://hajduakos.github.io/publications/syseng2023.pdf\",\"url_link\":\"https://incose.onlinelibrary.wiley.com/doi/10.1002/sys.21679\",\"abstract\":\"In recent years, Model-Based Systems Engineering (MBSE) practices have been applied in various industries to design, simulate and verify complex systems. The verification and validation (V&V) of such systems engineering models are crucial to develop high-quality systems. However, this is a challenging problem due to the complexity of the models and semantic differences in how different tools interpret the models, which can undermine the validity of the obtained results if they go undiscovered. To address these issues, we propose (i) a subset of the SysML language for which the practical semantic integrity of tools can be achieved and (ii) a cloud-based V&V framework for this subset, lifting verification to an industrial scale. We demonstrate the feasibility of our approach on an industrial-scale model from the aerospace domain and summarize the lessons learned during transitioning formal verification tools to an industrial context.\",\"bibtex\":\"@article{syseng2023,\\n    author   = {Horv{\\\\'a}th, Benedek and Moln{\\\\'a}r, Vince and Graics, Bence and Hajdu, {\\\\'A}kos and R{\\\\'a}th, Istv{\\\\'a}n and Horv{\\\\'a}th, {\\\\'A}kos and Karban, Robert and Trancho, Gelys and Micskei, Zolt{\\\\'a}n},\\n    title    = {Pragmatic verification and validation of industrial executable {SysML} models},\\n    year     = {2023},\\n    journal  = {Systems Engineering},\\n    doi      = {10.1002/sys.21679},\\n    volume   = {26},\\n    number   = {6},\\n    pages    = {693--714},\\n\\n    type     = {Journal},\\n\\n    url_pdf  = {https://hajduakos.github.io/publications/syseng2023.pdf},\\n    url_link = {https://incose.onlinelibrary.wiley.com/doi/10.1002/sys.21679},\\n\\n    abstract = {In recent years, Model-Based Systems Engineering (MBSE) practices have been applied in various industries to design, simulate and verify complex systems. The verification and validation (V&V) of such systems engineering models are crucial to develop high-quality systems. However, this is a challenging problem due to the complexity of the models and semantic differences in how different tools interpret the models, which can undermine the validity of the obtained results if they go undiscovered. To address these issues, we propose (i) a subset of the SysML language for which the practical semantic integrity of tools can be achieved and (ii) a cloud-based V&V framework for this subset, lifting verification to an industrial scale. We demonstrate the feasibility of our approach on an industrial-scale model from the aerospace domain and summarize the lessons learned during transitioning formal verification tools to an industrial context.},\\n}\\n\\n\",\"author_short\":[\"Horváth, B.\",\"Molnár, V.\",\"Graics, B.\",\"Hajdu, Á.\",\"Ráth, I.\",\"Horváth, Á.\",\"Karban, R.\",\"Trancho, G.\",\"Micskei, Z.\"],\"key\":\"syseng2023\",\"id\":\"syseng2023\",\"bibbaseid\":\"horvth-molnr-graics-hajdu-rth-horvth-karban-trancho-etal-pragmaticverificationandvalidationofindustrialexecutablesysmlmodels-2023\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/syseng2023.pdf\",\" link\":\"https://incose.onlinelibrary.wiley.com/doi/10.1002/sys.21679\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"Conference\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Mao\"],\"firstnames\":[\"Ke\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Åhs\"],\"firstnames\":[\"Cons\",\"T\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cela\"],\"firstnames\":[\"Sopot\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Distefano\"],\"firstnames\":[\"Dino\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Gardner\"],\"firstnames\":[\"Nick\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Grigore\"],\"firstnames\":[\"Radu\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Gustafsson\"],\"firstnames\":[\"Per\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Kapus\"],\"firstnames\":[\"Timotej\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Marescotti\"],\"firstnames\":[\"Matteo\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cunha\",\"Sampaio\"],\"firstnames\":[\"Gabriela\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Suzanne\"],\"firstnames\":[\"Thibault\"],\"suffixes\":[]}],\"title\":\"PrivacyCAT: Privacy-Aware Code Analysis at Scale\",\"year\":\"2024\",\"booktitle\":\"Proceedings of the IEEE/ACM 46th International Conference on Software Engineering: Software Engineering in Practice\",\"note\":\"(Accepted)\",\"url_pdf\":\"https://hajduakos.github.io/publications/icse2024.pdf\",\"abstract\":\"Static and dynamic code analyses have been widely adopted in industry to enhance software reliability, security, and performance by automatically detecting bugs in the code. In this paper, we introduce PrivacyCAT, a code analysis system developed and deployed at WhatsApp to protect user privacy. PrivacyCAT automatically detects privacy defects in code at early stages (before reaching production and affecting users), and therefore, it prevents such vulnerabilities from evolving into privacy incidents. PrivacyCAT comprises of a collection of static and dynamic taint analysers. We report on the technical development of PrivacyCAT and the results of two years of its large-scale industrial deployment at WhatsApp. We present our experience in designing its system architecture, and continuous integration process. We discuss the unique challenges encountered in developing and deploying such kind of analyses within an industrial context. Since its deployment in 2021, PrivacyCAT has safeguarded data privacy in $74%$ of privacy site events (SEVs). It has prevented 493 potential privacy SEVs from being introduced into the codebases, enabling developers to maintain a high privacy standard for the code that supports over two billion WhatsApp users.\",\"bibtex\":\"@inproceedings{icse2024,\\n    author    = {Mao, Ke and {\\\\AA}hs, Cons T and Cela, Sopot and Distefano, Dino and Gardner, Nick and Grigore, Radu and Gustafsson, Per and Hajdu, \\\\'Akos and Kapus, Timotej and Marescotti, Matteo and Cunha Sampaio, Gabriela and Suzanne, Thibault},\\n    title     = {{P}rivacy{CAT}: Privacy-Aware Code Analysis at Scale},\\n    year      = {2024},\\n    booktitle = {Proceedings of the IEEE/ACM 46th International Conference on Software Engineering: Software Engineering in Practice},\\n    note      = {(Accepted)},\\n\\n    type      = {Conference},\\n\\n    url_pdf   = {https://hajduakos.github.io/publications/icse2024.pdf},\\n    abstract  = {Static and dynamic code analyses have been widely adopted in industry to enhance software reliability, security, and performance by automatically detecting bugs in the code. In this paper, we introduce PrivacyCAT, a code analysis system developed and deployed at WhatsApp to protect user privacy. PrivacyCAT automatically detects privacy defects in code at early stages (before reaching production and affecting users), and therefore, it prevents such vulnerabilities from evolving into privacy incidents. PrivacyCAT comprises of a collection of static and dynamic taint analysers. We report on the technical development of PrivacyCAT and the results of two years of its large-scale industrial deployment at WhatsApp. We present our experience in designing its system architecture, and continuous integration process. We discuss the unique challenges encountered in developing and deploying such kind of analyses within an industrial context. Since its deployment in 2021, PrivacyCAT has safeguarded data privacy in $74\\\\%$ of privacy site events (SEVs). It has prevented 493 potential privacy SEVs from being introduced into the codebases, enabling developers to maintain a high privacy standard for the code that supports over two billion WhatsApp users.},\\n}\\n\\n\",\"author_short\":[\"Mao, K.\",\"Åhs, C. T\",\"Cela, S.\",\"Distefano, D.\",\"Gardner, N.\",\"Grigore, R.\",\"Gustafsson, P.\",\"Hajdu, Á.\",\"Kapus, T.\",\"Marescotti, M.\",\"Cunha Sampaio, G.\",\"Suzanne, T.\"],\"key\":\"icse2024\",\"id\":\"icse2024\",\"bibbaseid\":\"mao-hs-cela-distefano-gardner-grigore-gustafsson-hajdu-etal-privacycatprivacyawarecodeanalysisatscale-2024\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/icse2024.pdf\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"Conference\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Cela\"],\"firstnames\":[\"Sopot\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ciancone\"],\"firstnames\":[\"Andrea\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Gustafsson\"],\"firstnames\":[\"Per\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Jia\"],\"firstnames\":[\"Yue\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Kapus\"],\"firstnames\":[\"Timotej\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Koshtenko\"],\"firstnames\":[\"Maksym\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Lewis\"],\"firstnames\":[\"Will\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Mao\"],\"firstnames\":[\"Ke\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Martac\"],\"firstnames\":[\"Dragos\"],\"suffixes\":[]}],\"title\":\"Automated End-to-End Dynamic Taint Analysis for WhatsApp\",\"year\":\"2024\",\"publisher\":\"ACM\",\"booktitle\":\"Companion Proceedings of the 32nd ACM Symposium on the Foundations of Software Engineering\",\"note\":\"(Accepted)\",\"url_pdf\":\"https://hajduakos.github.io/publications/fse2024.pdf\",\"abstract\":\"Taint analysis aims to track data flows in systems, with potential use cases for security, privacy and performance. This paper describes an end-to-end dynamic taint analysis solution for WhatsApp. We use exploratory UI testing to generate realistic interactions and inputs, serving as data sources on the clients and then we track data propagation towards sinks on both client and server sides. Finally, a reporting pipeline localizes tainted flows in the source code, applies deduplication, filters false positives based on production call sites, and files tasks to code owners. Applied to WhatsApp, our approach found 89 flows that were fixed by engineers, and caught 50% of all privacy-related flows that required escalation, including instances that would have been difficult to uncover by conventional testing.\",\"bibtex\":\"@inproceedings{fse2024,\\n    author    = {Cela, Sopot and Ciancone, Andrea and Gustafsson, Per and Hajdu, {\\\\'A}kos and Jia, Yue and Kapus, Timotej and Koshtenko, Maksym and Lewis, Will and Mao, Ke and Martac, Dragos},\\n    title     = {Automated End-to-End Dynamic Taint Analysis for {W}hats{A}pp},\\n    year      = {2024},\\n    publisher = {ACM},\\n    booktitle = {Companion Proceedings of the 32nd ACM Symposium on the Foundations of Software Engineering},\\n    note      = {(Accepted)},\\n\\n    type      = {Conference},\\n\\n    url_pdf    = {https://hajduakos.github.io/publications/fse2024.pdf},\\n    abstract  = {Taint analysis aims to track data flows in systems, with potential use cases for security, privacy and performance. This paper describes an end-to-end dynamic taint analysis solution for WhatsApp. We use exploratory UI testing to generate realistic interactions and inputs, serving as data sources on the clients and then we track data propagation towards sinks on both client and server sides. Finally, a reporting pipeline localizes tainted flows in the source code, applies deduplication, filters false positives based on production call sites, and files tasks to code owners. Applied to WhatsApp, our approach found 89 flows that were fixed by engineers, and caught 50% of all privacy-related flows that required escalation, including instances that would have been difficult to uncover by conventional testing.},\\n}\\n\",\"author_short\":[\"Cela, S.\",\"Ciancone, A.\",\"Gustafsson, P.\",\"Hajdu, Á.\",\"Jia, Y.\",\"Kapus, T.\",\"Koshtenko, M.\",\"Lewis, W.\",\"Mao, K.\",\"Martac, D.\"],\"key\":\"fse2024\",\"id\":\"fse2024\",\"bibbaseid\":\"cela-ciancone-gustafsson-hajdu-jia-kapus-koshtenko-lewis-etal-automatedendtoenddynamictaintanalysisforwhatsapp-2024\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://hajduakos.github.io/publications/fse2024.pdf\"},\"metadata\":{\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\"downloads\":2,\"html\":\"\"}],\n      metadata: {\"owner\":\"hajdu, á\",\"authorlinks\":{\"hajdu, á\":\"https://hajduakos.github.io/publications.html\"}},\n      ownerID: \"5LYbkbBcDuR3siWzy\"\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"publications.bib\" href=\"data:text/bibtex;base64,@inproceedings{splst2013,
    author     = {{\'A}kos Hajdu and Andr{\'a}s V{\"o}r{\"o}s and Tam{\'a}s Bartha and Zolt{\'a}n M{\'a}rtonka},
    title      = {Extensions to the {CEGAR} Approach on {P}etri Nets},
    year       = {2013},
    pages      = {274--288},
    publisher  = {University of Szeged},
    booktitle  = {Proceedings of the 13th Symposium on Programming Languages and Software Tools},
    isbn       = {978-963-306-228-9},

    type       = {Conference},

    url_pdf    = {https://hajduakos.github.io/publications/splst2013.pdf},
    url_link   = {http://www.inf.u-szeged.hu/projectdirs/splst13/splst13proc.pdf},
    url_slides = {https://hajduakos.github.io/publications/slides/splst2013.pdf},

    abstract   = {Formal verification is becoming more prevalent and often compulsory in the safety-critical system and software development processes. Reachability analysis can provide information about safety and invariant properties of the developed system. However, checking the reachability is a computationally hard problem, especially in the case of asynchronous or infinite state systems. Petri nets are widely used for the modeling and verification of such systems. In this paper we examine a recently published approach for the reachability checking of Petri net markings. We give proofs concerning the completeness and the correctness properties of the algorithm, and we introduce algorithmic improvements. We also extend the algorithm to handle new classes of problems: submarking coverability and reachability of Petri nets with inhibitor arcs.},
}



@article{acta2014,
    author   = {{\'A}kos Hajdu and Andr{\'a}s V{\"o}r{\"o}s and Tam{\'a}s Bartha and Zolt{\'a}n M{\'a}rtonka},
    title    = {Extensions to the {CEGAR} Approach on {P}etri Nets},
    year     = {2014},
    pages    = {401--417},
    journal  = {Acta Cybernetica},
    volume   = {21},
    number   = {3},
    issn     = {0324-721X},
    doi      = {10.14232/actacyb.21.3.2014.8},

    type     = {Journal},

    url_pdf  = {https://hajduakos.github.io/publications/acta2014.pdf},
    url_link = {http://www.inf.u-szeged.hu/actacybernetica/edb/vol21n3/pdf/Hajdu_2014_ActaCybernetica.pdf},

    abstract = {Formal verification is becoming more prevalent and often compulsory in the safety-critical system and software development processes. Reachability analysis can provide information about safety and invariant properties of the developed system. However, checking the reachability is a computationally hard problem, especially in the case of asynchronous or infinite state systems. Petri nets are widely used for the modeling and verification of such systems. In this paper we examine a recently published approach for the reachability checking of Petri net markings. We give proofs concerning the completeness and the correctness properties of the algorithm, and we introduce algorithmic improvements. We also extend the algorithm to handle new classes of problems: submarking coverability and reachability of Petri nets with inhibitor arcs.},
}



@inproceedings{asconikk2014,
    author     = {{\'A}kos Hajdu and R{\'o}bert N{\'e}met and Szilvia Varr{\'o}-Gyapay and Andr{\'a}s V{\"o}r{\"o}s},
    title      = {{P}etri Net Based Trajectory Optimization},
    booktitle  = {ASCONIKK 2014: Extended Abstracts. Future Internet Services},
    year       = {2014},
    location   = {Veszpr\'em, Hungary},
    publisher  = {University of Pannonia},
    pages      = {11--19},
    isbn       = {978-963-396-047-9},

    type       = {Conference},

    url_pdf    = {https://hajduakos.github.io/publications/vocal2014.pdf},
    url_link   = {http://nikk.mik.uni-pannon.hu/images/II_final_.pdf},
    url_slides = {https://hajduakos.github.io/publications/slides/vocal2014.pdf},

    abstract   = {Optimization problems are becoming more prevalent in the design of complex systems. Petri nets are widely used for the modeling of such systems. An optimization problem can be translated to find an optimal trajectory where a cost is assigned to each step. The reachability problem of Petri nets answers whether a given state is reachable from the initial state. However, reachability analysis is a computationally hard problem, especially in the case of asynchronous or infinite state systems. In this paper we examine a recently published algorithm that solves reachability using abstraction methods and we extend this approach to be able to handle optimal trajectory problems.},
}



@incollection{icatpn2015,
    author     = {{\'A}kos Hajdu and Andr{\'a}s V{\"o}r{\"o}s and Tam{\'a}s Bartha},
    title      = {New search strategies for the {P}etri net {CEGAR} approach},
    year       = {2015},
    booktitle  = {Application and Theory of Petri Nets and Concurrency},
    series     = {Lecture Notes in Computer Science},
    volume     = {9115},
    publisher  = {Springer},
    isbn       = {978-3-319-19488-2},
    pages      = {309--328},
    doi        = {10.1007/978-3-319-19488-2_16},

    type       = {Conference},

    url_pdf    = {https://hajduakos.github.io/publications/icatpn2015.pdf},
    url_link   = {http://link.springer.com/chapter/10.1007/978-3-319-19488-2_16},
    url_slides = {https://hajduakos.github.io/publications/slides/icatpn2015.pdf},

    abstract   = {Petri nets are a successful formal method for the modeling and verification of asynchronous, concurrent and distributed systems. Reachability analysis can provide important information about the behavior of the model. However, reachability analysis is a computationally hard problem, especially when the state space is infinite. Abstraction-based techniques are often applied to overcome complexity. In this paper we analyze an algorithm, which uses counterexample guided abstraction refinement. This algorithm proved its efficiency on the model checking contest. We examine the algorithm from a theoretical and practical point of view. On the theoretical side, we show that the algorithm cannot decide reachability for relatively simple instances. We propose a new iteration strategy to explore the invariant space, which extends the set of decidable problems. We also give proofs on the theoretical limits of our approach. On the practical side, we examine different search strategies and we present our new, complex strategy with superior performance compared to traditional strategies. Measurements show that our new contributions perform well for traditional benchmark models as well.},
}



@techreport{cern2015,
    author      = {Hajdu, {\'A}kos},
    title       = {Making the {TT}ree{R}eader interface more accessible},
    number      = {CERN-STUDENTS-Note-2015-039},
    year        = {2015},
    month       = {Aug},
    institution = {European Organization for Nuclear Research (CERN)},

    type        = {Tech. rep.},

    url_pdf     = {http://cds.cern.ch/record/2044503/files/report.pdf},
    url_link    = {http://cds.cern.ch/record/2044503},

    abstract    = {The ROOT framework is the main data analysis tool for High Energy Physics. One of its main features is TTree, a collection type enabling efficient analysis on petabytes of data. ROOT has a new interface called TTreeReader to access data in a type-safe and efficient way. This Summer Student project aims at implementing a utility interface to generate source file skeletons as a starting point for the users. This will make the TTreeReader much more accessible for the users of ROOT.},
}



@incollection{forte2016,
    author     = {Hajdu, {\'A}kos and T{\'o}th, Tam{\'a}s and V{\"o}r{\"o}s, Andr{\'a}s and Majzik, Istv{\'a}n},
    title      = {A Configurable {CEGAR} Framework with Interpolation-based Refinements},
    year       = {2016},
    booktitle  = {Formal Techniques for Distributed Objects, Components and Systems},
    series     = {Lecture Notes in Computer Science},
    volume     = {9688},
    pages      = {158--174},
    publisher  = {Springer},
    isbn       = {978-3-319-39570-8},
    doi        = {10.1007/978-3-319-39570-8_11},

    type       = {Conference},

    url_pdf    = {https://hajduakos.github.io/publications/forte2016.pdf},
    url_link   = {http://link.springer.com/chapter/10.1007/978-3-319-39570-8_11},
    url_slides = {https://hajduakos.github.io/publications/slides/forte2016.pdf},

    abstract   = {Correctness of software components in a distributed system is a key issue to ensure overall reliability. Formal verification techniques such as model checking can show design flaws at early stages of development. Abstraction is a key technique for reducing complexity by hiding information, which is not relevant for verification. Counterexample-Guided Abstraction Refinement (CEGAR) is a verification algorithm that starts from a coarse abstraction and refines it iteratively until the proper precision is obtained. Many abstraction types and refinement strategies exist for systems with different characteristics. In this paper we show how these algorithms can be combined into a configurable CEGAR framework. In our framework we also present a new CEGAR configuration based on a combination of abstractions, being able to perform better for certain models. We demonstrate the use of the framework by comparing several configurations of the algorithms on various problems, identifying their advantages and shortcomings.},
}



@incollection{icatpn2016,
    author    = {V{\"o}r{\"o}s, Andr{\'a}s and Darvas, D{\'a}niel and Moln{\'a}r, Vince and Klenik, Attila and Hajdu, {\'A}kos and J{\'a}mbor, Attila and Bartha, Tam{\'a}s and Majzik, Istv{\'a}n},
    title     = {{PetriDotNet} 1.5: Extensible {P}etri Net Editor and Analyser for Education and Research},
    year      = {2016},
    booktitle = {Application and Theory of Petri Nets and Concurrency},
    series    = {Lecture Notes in Computer Science},
    volume    = {9698},
    pages     = {123--132},
    publisher = {Springer},
    isbn      = {978-3-319-39086-4},
    doi       = {10.1007/978-3-319-39086-4_9},

    type      = {Conference},

    url_pdf   = {https://hajduakos.github.io/publications/icatpn2016.pdf},
    url_link  = {http://link.springer.com/chapter/10.1007/978-3-319-39086-4_9},

    abstract  = {PetriDotNet is an extensible Petri net editor and analysis tool originally developed to support the education of formal methods. The ease of use and simple extensibility fostered more and more algorithmic developments. Thanks to the continuous interest of developers (especially M.Sc. and Ph.D. students who choose PetriDotNet as the framework of their thesis project), by now PetriDotNet became an analysis platform, providing various cutting-edge model checking algorithms and stochastic analysis algorithms. As a result, industrial application of the tool also emerged in recent years. In this paper we overview the main features and the architecture of PetriDotNet, and compare it with other available tools.},
}



@inproceedings{minisy2017,
    author     = {Hajdu, {\'A}kos and Micskei, Zolt{\'a}n},
    title      = {Exploratory Analysis of the Performance of a Configurable {CEGAR} Framework},
    year       = {2017},
    booktitle  = {Proceedings of the 24th PhD Mini-Symposium},
    location   = {Budapest, Hungary},
    publisher  = {Budapest University of Technology and Economics, Department of Measurement and Information Systems},
    pages      = {34--37},
    doi        = {10.5281/zenodo.291895},
    isbn       = {978-963-313-243-2},

    type       = {Local event},

    url_pdf    = {https://hajduakos.github.io/publications/minisy2017.pdf},
    url_link   = {https://doi.org/10.5281/zenodo.291895},
    url_slides = {https://hajduakos.github.io/publications/slides/minisy2017.pdf},

    abstract   = {Formal verification techniques can check the correctness of systems in a mathematically precise way. However, their computational complexity often prevents their successful application. The counterexample-guided abstraction refinement (CEGAR) algorithm aims to overcome this problem by automatically building abstractions for the system to reduce its complexity. Previously, we developed a generic CEGAR framework, which incorporates many configurations of the algorithm. In this paper we focus on an exploratory analysis of our framework. We identify parameters of the systems and algorithm configurations, overview some possible analysis methods and present preliminary results. We show that different variants are more efficient for certain tasks and we also describe how the properties of the system and parameters of the algorithm affect the success of verification.},
}



@inproceedings{minisy2017fr,
    author     = {Farkas, Rebeka and Hajdu, {\'A}kos},
    title      = {Activity-Based Abstraction Refinement for Timed Systems},
    year       = {2017},
    booktitle  = {Proceedings of the 24th PhD Mini-Symposium},
    location   = {Budapest, Hungary},
    publisher  = {Budapest University of Technology and Economics, Department of Measurement and Information Systems},
    pages      = {18--21},
    doi        = {10.5281/zenodo.291891},
    isbn       = {978-963-313-243-2},

    type       = {Local event},

    url_pdf    = {https://hajduakos.github.io/publications/minisy2017fr.pdf},
    url_link   = {https://doi.org/10.5281/zenodo.291891},

    abstract   = {Formal analysis of real time systems is important as they are widely used in safety critical domains. Such systems combine discrete behaviours represented by control states and timed behaviours represented by clock variables. The counterexample-guided abstraction refinement (CEGAR) algorithm utilizes the fundamental technique of abstraction to system verification. We propose a CEGAR-based algorithm for reachability analysis of timed systems. The algorithm is specialized to handle the time related behaviours efficiently by introducing a refinement technique tailored specially to clock variables. The performance of the presented algorithm is demonstrated by runtime measurements on models commonly used for benchmarking such algorithms.},
}



@incollection{fesca2017,
    author     = {Czip{\'o}, Bence and Hajdu, {\'A}kos and T{\'o}th, Tam{\'a}s and Majzik, Istv{\'a}n},
    year       = {2017},
    title      = {Exploiting Hierarchy in the Abstraction-Based Verification of Statecharts Using {SMT} Solvers},
    booktitle  = {Proceedings of the 14th International Workshop on Formal Engineering Approaches to Software Components and Architectures},
    series     = {Electronic Proceedings in Theoretical Computer Science},
    volume     = {245},
    publisher  = {Open Publishing Association},
    pages      = {31--45},
    doi        = {10.4204/EPTCS.245.3},

    type       = {Workshop},

    url_pdf    = {https://hajduakos.github.io/publications/fesca2017.pdf},
    url_link   = {http://eptcs.web.cse.unsw.edu.au/paper.cgi?FESCA2017.3},
    url_slides = {https://hajduakos.github.io/publications/slides/fesca2017.pdf},

    abstract   = {Statecharts are frequently used as a modeling formalism in the design of state-based systems. Formal verification techniques are also often applied to prove certain properties about the behavior of the system. One of the most efficient techniques for formal verification is Counterexample-Guided Abstraction Refinement (CEGAR), which reduces the complexity of systems by automatically building and refining abstractions. In our paper we present a novel adaptation of the CEGAR approach to hierarchical statechart models. First we introduce an encoding of the statechart to logical formulas that preserves information about the state hierarchy. Based on this encoding we propose abstraction and refinement techniques that utilize the hierarchical structure of statecharts and also handle variables in the model. The encoding allows us to use SMT solvers for the systematic exploration and verification of the abstract model, including also bounded model checking. We demonstrate the applicability and efficiency of our abstraction techniques with measurements on an industry-motivated example.},
}



@incollection{vpt2017,
    author     = {Sallai, Gyula and Hajdu, {\'A}kos and T{\'o}th, Tam{\'a}s and Micskei, Zolt{\'a}n},
    year       = {2017},
    title      = {Towards Evaluating Size Reduction Techniques for Software Model Checking},
    booktitle  = {Proceedings of the Fifth International Workshop on Verification and Program Transformation},
    series     = {Electronic Proceedings in Theoretical Computer Science},
    volume     = {253},
    publisher  = {Open Publishing Association},
    pages      = {75--91},
    doi        = {10.4204/EPTCS.253.7},

    type       = {Workshop},

    url_pdf    = {https://hajduakos.github.io/publications/vpt2017.pdf},
    url_link   = {http://eptcs.web.cse.unsw.edu.au/paper.cgi?VPT2017.7},
    url_slides = {https://hajduakos.github.io/publications/slides/vpt2017.pdf},

    abstract   = {Formal verification techniques are widely used for detecting design flaws in software systems. Formal verification can be done by transforming an already implemented source code to a formal model and attempting to prove certain properties of the model (e.g. that no erroneous state can occur during execution). Unfortunately, transformations from source code to a formal model often yield large and complex models, making the verification process inefficient and costly. In order to reduce the size of the resulting model, optimization transformations can be used. Such optimizations include common algorithms known from compiler design and different program slicing techniques. Our paper describes a framework for transforming C programs to a formal model, enhanced by various optimizations for size reduction. We evaluate and compare several optimization algorithms regarding their effect on the size of the model and the efficiency of the verification. Results show that different optimizations are more suitable for certain models, justifying the need for a framework that includes several algorithms.}
}



@article{scp2017,
    author   = {Andr{\'a}s V\"{o}r\"{o}s and D{\'a}niel Darvas and {\'A}kos Hajdu and Attila Klenik and Krist{\'o}f Marussy and Vince Moln{\'a}r and Tam{\'a}s Bartha and Istv{\'a}n Majzik},
    title    = {Industrial Applications of the {P}etri{D}ot{N}et Modelling and Analysis Tool},
    year     = {2018},
    journal  = {Science of Computer Programming},
    volume   = {157},
    pages    = {17--40},
    issn     = {0167-6423},
    doi      = {10.1016/j.scico.2017.09.003},

    type     = {Journal},

    url_pdf  = {https://hajduakos.github.io/publications/scp2017.pdf},
    url_link = {http://www.sciencedirect.com/science/article/pii/S0167642317301910},

    abstract = {Since their invention, Petri nets have provided modelling and analysis methods to support the design of correct, reliable and robust systems. This motivated our work to develop PetriDotNet, a Petri net editor and analysis tool. In this paper we overview the supported modelling formalisms and the analysis methods included in PetriDotNet. Next, we present eight different industrial case studies, demonstrating the wide variety of scenarios where Petri nets and PetriDotNet can help the design, development and analysis of industrial systems. Our original goal with PetriDotNet was to provide an educational tool to our students, however our efforts led to a framework being able to serve both academic and industrial needs.},
}



@inproceedings{fmcad2017,
    author     = {T{\'o}th, Tam{\'a}s and Hajdu, {\'A}kos and V{\"o}r{\"o}s, Andr{\'a}s and Micskei, Zolt{\'a}n and Majzik, Istv{\'a}n},
    year       = {2017},
    title      = {Theta: a Framework for Abstraction Refinement-Based Model Checking},
    booktitle  = {Proceedings of the 17th Conference on Formal Methods in Computer-Aided Design},
    isbn       = {978-0-9835678-7-5},
    pages      = {176--179},
    doi        = {10.23919/FMCAD.2017.8102257},

    type       = {Conference},

    url_pdf    = {https://hajduakos.github.io/publications/fmcad2017.pdf},
    url_link   = {http://www.cs.utexas.edu/users/hunt/FMCAD/FMCAD17/proceedings/},
    url_slides = {https://hajduakos.github.io/publications/slides/fmcad2017.pdf},
    url_video  = {https://oc-presentation.ltcc.tuwien.ac.at/engage/theodul/ui/core.html?id=c658c37e-ae70-11e7-a0dd-bb49f3cb440c},

    abstract   = {In this paper, we present Theta, a configurable model checking framework. The goal of the framework is to support the design, execution and evaluation of abstraction refinement-based reachability analysis algorithms for models of different formalisms. It enables the definition of input formalisms, abstract domains, model interpreters, and strategies for abstraction and refinement. Currently it contains front-end support for transition systems, control flow automata and timed automata. The built-in abstract domains include predicates, explicit values, zones and their combinations, along with various refinement strategies implemented for each. The configurability of the framework allows the integration of several abstraction and refinement methods, this way supporting the evaluation of their advantages and shortcomings. We demonstrate the applicability of the framework by use cases for the safety checking of PLC, hardware, C programs and timed automata models.},
}



@inproceedings{minisy2018,
    author     = {Hajdu, {\'A}kos and Micskei, Zolt{\'a}n},
    title      = {A Preliminary Analysis on the Effect of Randomness in a {CEGAR} Framework},
    year       = {2018},
    booktitle  = {Proceedings of the 25th PhD Mini-Symposium},
    location   = {Budapest, Hungary},
    publisher  = {Budapest University of Technology and Economics, Department of Measurement and Information Systems},
    pages      = {32--35},
    doi        = {10.5281/zenodo.1219261},
    isbn       = {978-963-313-285-2},

    type       = {Local event},

    url_pdf    = {https://hajduakos.github.io/publications/minisy2018.pdf},
    url_link   = {https://doi.org/10.5281/zenodo.1219261},
    url_slides = {https://hajduakos.github.io/publications/slides/minisy2018.pdf},

    abstract   = {Formal verification techniques can check the correctness of systems in a mathematically precise way. Counterexample-Guided Abstraction Refinement (CEGAR) is an automatic algorithm that reduces the complexity of systems by constructing and refining abstractions. CEGAR is a generic approach, having many variants and strategies developed over the years. However, as the variants become more and more advanced, one may not be sure whether the performance of a strategy can be attributed to the strategy itself or to other, unintentional factors. In this paper we perform an experiment by evaluating the performance of different strategies while randomizing certain external factors such as the search strategy and variable naming. We show that randomization introduces a great variation in the output metrics, and that in several cases this might even influence whether the algorithm successfully terminates.},
}



@incollection{avocs2018,
    author     = {Farkas, Rebeka and T{\'o}th, Tam{\'a}s and Hajdu, {\'A}kos and V{\"o}r{\"o}s, Andr{\'a}s},
    title      = {Backward reachability analysis for timed automata with data variables},
    year       = {2018},
    booktitle  = {Proceedings of the 18th International Workshop on Automated Verification of Critical Systems},
    series     = {Electronic Communications of the EASST},
    issn       = {1863-2122},
    volume     = {76},
    publisher  = {EASST},
    pages      = {1--20},
    doi        = {10.14279/tuj.eceasst.76.1076},

    type       = {Workshop},

    url_pdf    = {https://hajduakos.github.io/publications/avocs2018.pdf},
    url_link   = {https://journal.ub.tu-berlin.de/eceasst/article/view/1076},

    abstract   = {Efficient techniques for reachability analysis of timed automata are zone-based methods that explore the reachable state space from the initial state, and SMT-based methods that perform backward search from the target states. It is also possible to perform backward exploration based on zones, but calculating predecessor states for systems with data variables is computationally expensive, prohibiting the successful application of this approach so far. In this paper we overcome this limitation by combining zone-based backward exploration with the weakest precondition operation for data variables. This combination allows us to handle diagonal constraints efficiently as opposed to zone-based forward search where most approaches require additional operations to ensure correctness. We demonstrate the applicability and compare the efficiency of the algorithm to existing forward exploration approaches by measurements performed on industrial case studies. Although the large number of states often prevents successful verification, we show that data variables can be efficienlty handled by the weakest precondition operation. This way our new approach complements existing techniques.}
}



@inproceedings{minisy2019,
    author     = {Bajkai, Vikt{\'o}ria Dorina and Hajdu, {\'A}kos},
    title      = {Software Model Checking with a Combination of Explicit Values and Predicates},
    year       = {2019},
    booktitle  = {Proceedings of the 26th PhD Mini-Symposium},
    location   = {Budapest, Hungary},
    publisher  = {Budapest University of Technology and Economics, Department of Measurement and Information Systems},
    pages      = {4--7},
    isbn       = {978-963-313-314-9},
    doi        = {10.5281/zenodo.2597969},

    type       = {Local event},

    url_pdf    = {https://hajduakos.github.io/publications/minisy2019.pdf},
    url_link   = {http://doi.org/10.5281/zenodo.2597969},

    abstract   = {Formal verification techniques can both reveal bugs or prove their absence in programs with a sound mathematical basis. However, their high computational complexity often prevents their application on real-world software. Counterexample-guided abstraction refinement (CEGAR) aims to improve efficiency by automatically constructing and refining abstractions for the program. There are several existing abstract domains, such as explicit-values and predicates, but different abstract domains are suitable for different kinds of software. Therefore, product domains have also emerged, which combine different kinds of abstractions in a single algorithm. In this paper, we present a new variant of the CEGAR algorithm, which is a combination of explicit-value analysis and predicate abstraction. We perform an experiment with a wide range of software systems and we compare the results to the existing methods. Measurements show that our new algorithm can efficiently combine the advantages of the different domains.},
}



@incollection{vstte2019,
    author     = {Hajdu, {\'A}kos and Jovanovi{\'c}, Dejan},
    title      = {solc-verify: A Modular Verifier for {S}olidity Smart Contracts},
    year       = {2020},
    booktitle  = {Verified Software. Theories, Tools, and Experiments},
    pages      = {161--179},
    series     = {Lecture Notes in Computer Science},
    volume     = {12301},
    publisher  = {Springer},
    doi        = {10.1007/978-3-030-41600-3_11},
    isbn       = {978-3-030-41600-3},

    type       = {Conference},

    url_pdf    = {https://hajduakos.github.io/publications/vstte2019.pdf},
    url_link   = {https://link.springer.com/chapter/10.1007/978-3-030-41600-3_11},
    url_slides = {https://hajduakos.github.io/publications/slides/vstte2019.pdf},

    abstract   = {We present solc-verify, a source-level verification tool for Ethereum smart contracts. Solc-verify takes smart contracts written in Solidity and discharges verification conditions using modular program analysis and SMT solvers. Built on top of the Solidity compiler, solc-verify reasons at the level of the contract source code, as opposed to the more common approaches that operate at the level of Ethereum bytecode. This enables solc-verify to effectively reason about high-level contract properties while modeling low-level language semantics precisely. The contract properties, such as contract invariants, loop invariants, and function pre- and post-conditions, can be provided as annotations in the code by the developer. This enables automated, yet user-friendly formal verification for smart contracts. We demonstrate solc-verify by examining real-world examples where our tool can effectively find bugs and prove correctness of non-trivial properties with minimal user effort.},
}



@article{jar2019,
    author   = {{\'A}kos Hajdu and Zolt{\'a}n Micskei},
    title    = {Efficient Strategies for {CEGAR}-based Model Checking},
    journal  = {Journal of Automated Reasoning},
    volume   = {64},
    number   = {6},
    pages    = {1051--1091},
    year     = {2020},
    doi      = {10.1007/s10817-019-09535-x},

    type     = {Journal},

    url_pdf  = {https://link.springer.com/content/pdf/10.1007%2Fs10817-019-09535-x.pdf},
    url_link = {https://link.springer.com/article/10.1007/s10817-019-09535-x},

    abstract = {Automated formal verification is often based on the Counterexample-Guided Abstraction Refinement (CEGAR) approach. Many variants of CEGAR have been developed over the years as different problem domains usually require different strategies for efficient verification. This has lead to generic and configurable CEGAR frameworks, which can incorporate various algorithms. In our paper we propose six novel improvements to different aspects of the CEGAR approach, including both abstraction and refinement. We implement our new contributions in the Theta framework allowing us to compare them with state-of-the-art algorithms. We conduct an experiment on a diverse set of models to address research questions related to the effectiveness and efficiency of our new strategies. Results show that our new contributions perform well in general. Moreover, we highlight certain cases where performance could not be increased or where a remarkable improvement is achieved.},
}



@incollection{esop2020,
    author     = {Hajdu, {\'A}kos and Jovanovi{\'c}, Dejan},
    title      = {{SMT}-Friendly Formalization of the {S}olidity Memory Model},
    year       = {2020},
    booktitle  = {Programming Languages and Systems},
    series     = {Lecture Notes in Computer Science},
    volume     = {12075},
    pages      = {224--250},
    publisher  = {Springer},
    doi        = {10.1007/978-3-030-44914-8_9},

    type       = {Conference},

    url_pdf    = {https://hajduakos.github.io/publications/esop2020.pdf},
    url_link   = {https://link.springer.com/chapter/10.1007/978-3-030-44914-8_9},
    url_slides = {https://hajduakos.github.io/publications/slides/smt2020.pdf},
    url_video  = {https://youtu.be/B3ML9vGituk?t=626},
    abstract   = {Solidity is the dominant programming language for Ethereum smart contracts. This paper presents a high-level formalization of the Solidity language with a focus on the memory model. The presented formalization covers all features of the language related to managing state and memory. In addition, the formalization we provide is effective: all but few features can be encoded in the quantifier-free fragment of standard SMT theories. This enables precise and efficient reasoning about the state of smart contracts written in Solidity. The formalization is implemented in the solc-verify verifier and we provide an extensive set of tests that covers the breadth of the required semantics. We also provide an evaluation on the test set that validates the semantics and shows the novelty of the approach compared to other Solidity-level contract analysis tools. },
}



@incollection{fmbc2020,
    author     = {{\'A}kos Hajdu and Jovanovi{\'c}, Dejan and Ciocarlie, Gabriela},
    title      = {Formal Specification and Verification of {S}olidity Contracts with Events (short paper)},
    booktitle  = {2nd Workshop on Formal Methods for Blockchains},
    series     = {OpenAccess Series in Informatics (OASIcs)},
    volume     = {84},
    pages      = {2:1--2:9},
    publisher  = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
    year       = {2020},
    isbn       = {978-3-95977-169-6},
    issn       = {2190-6807},
    doi        = {10.4230/OASIcs.FMBC.2020.2},

    type       = {Workshop},

    url_pdf    = {https://drops.dagstuhl.de/opus/volltexte/2020/13415/pdf/OASIcs-FMBC-2020-2.pdf},
    url_link   = {https://drops.dagstuhl.de/opus/volltexte/2020/13415/},
    url_slides = {https://hajduakos.github.io/publications/slides/fmbc2020.pdf},
    url_video  = {https://youtu.be/NNytwVBZ1no},
    abstract   = {Events in the Solidity language provide a means of communication between the on-chain services of decentralized applications and the users of those services. Events are commonly used as an abstraction of contract execution that is relevant from the users' perspective. Users must, therefore, be able to understand the meaning and trust the validity of the emitted events. This paper presents a source-level approach for the formal specification and verification of Solidity contracts with the primary focus on events. Our approach allows the specification of events in terms of the on-chain data that they track, and the predicates that define the correspondence between the blockchain state and the abstract view provided by the events. The approach is implemented in solc-verify, a modular verifier for Solidity, and we demonstrate its applicability with various examples.}
}



@misc{patent2020,
    title     = {MIDDLEWARE TO AUTOMATICALLY VERIFY SMART CONTRACTS ON BLOCKCHAINS},
    author    = {Ciocarlie, Gabriela and Eldefrawy, Karim and Lepoint, Tancrede and Navas, Jorge and Hajdu, {\'A}kos and Jovanovi{\'c}, Dejan},
    year      = {2020},
    month     = {June},
    note      = {US Patent App. 16/227,728},

    type      = {Patent application},

    url_link  = {http://www.freepatentsonline.com/y2020/0201838.html},
    abstract  = {A method, apparatus and system for automated verification of a smart contract on a blockchain include translating operating properties of a smart contract annotated with contract specifications at a source code level into verification conditions in an intermediate verification language, discharging the verification conditions using an SMT solver, and reporting results of the discharged verification conditions, such as successes and failures of the discharged verification conditions. The translating can include mapping statements of the smart contract to statements of the intermediate verification language and mapping expressions of the smart contract to expressions of the intermediate verification language. }
}



@inproceedings{openmbee2020,
    author     = {Benedek Horv{\'a}th and Bence Graics and {\'A}kos Hajdu and Zolt{\'a}n Micskei and Vince Moln{\'a}r and Istv{\'a}n R{\'a}th and Luigi Andolfato and Ivan Gomes and Robert Karban},
    title      = {Model Checking as a Service: Towards Pragmatic Hidden Formal Methods},
    booktitle  = {Proceedings of the 23rd ACM/IEEE International Conference on Model Driven Engineering Languages and Systems: Companion Proceedings},
    articleno  = {37},
    numpages   = {5},
    year       = {2020},
    doi        = {10.1145/3417990.3421407},

    type       = {Workshop},

    url_pdf    = {https://hajduakos.github.io/publications/openmbee2020.pdf},
    url_link   = {https://doi.org/10.1145/3417990.3421407},
    abstract   = {Executable models can be used to support all engineering activities in Model-Based Systems Engineering. Testing and simulation of such models can provide early feedback about design choices. However, in today's complex systems, failures could arise due to subtle errors that are hard to find without checking all possible execution paths. Formal methods, and especially model checking can uncover such subtle errors, yet their usage in practice is limited due to the specialized expertise and high computing power required. Therefore we created an automated, cloud-based environment that can verify complex reachability properties on SysML State Machines using hidden model checkers. The approach and the prototype is illustrated using an example from the aerospace domain.},
}



@article{access2020,
    author     = {{\'A}kos Hajdu and Naghmeh Ivaki and Imre Kocsis and Attila Klenik and L{\'a}szl{\'o} G{\"o}nczy and Nuno Laranjeiro and Henrique Madeira and Andr{\'a}s Pataricza},
    title      = {Using Fault Injection to Assess Blockchain Systems in Presence of Faulty Smart Contracts},
    journal    = {IEEE Access},
    year       = {2020},
    volume     = {8},
    pages      = {190760--190783},
    doi        = {10.1109/ACCESS.2020.3032239},

    type       = {Journal},

    url_pdf    = {https://arxiv.org/abs/2006.11597.pdf},
    url_link   = {https://ieeexplore.ieee.org/document/9229414},
    abstract   = {Blockchain has become particularly popular due to its promise to support businesscritical services in very different domains (e.g., retail, healthcare). Blockchain systems rely on complex middleware, like Ethereum or Hyperledger Fabric, that allow running smart contracts, which specify business logic in cooperative applications. The presence of software defects in these contracts has notably caused failures, including severe security problems. In this paper, we use software-implemented fault injection (SWIFI) to assess the behavior of permissioned blockchain systems in the presence of faulty smart contracts. We emulate the occurrence of general software faults and also blockchain-specific software faults (e.g., missing require on transaction sender) in smart contracts code and observe the impact on the overall system dependability in terms of reliability and integrity. We also analyze the effectiveness of formal verification and runtime protection mechanisms in detecting the injected faults. Results indicate that formal verification and runtime protections have to complement built-in platform checks to guarantee proper dependability of blockchain systems. The work presented in this paper allows smart contract developers to become aware of possible faults in smart contracts and to understand the impact of their presence. It also provides valuable information for middleware developers to improve the overall fault tolerance of their systems.},
}



@incollection{tacas2021,
    author     = {{\'A}dam, Zs{\'o}fia and Sallai, Gyula and Hajdu, {\'A}kos},
    title      = {{G}azer-{T}heta: {LLVM}-based Verifier Portfolio with {BMC}/{CEGAR} (Competition Contribution)},
    year       = {2021},
    booktitle  = {Tools and Algorithms for the Construction and Analysis of Systems},
    series     = {Lecture Notes in Computer Science},
    volume     = {12652},
    publisher  = {Springer},
    pages      = {435--439},
    doi        = {10.1007/978-3-030-72013-1_27},

    type       = {Conference},

    url_pdf    = {https://hajduakos.github.io/publications/tacas2021.pdf},
    url_video  = {https://youtu.be/8DEtrRJixpA},
    abstract   = {Gazer-Theta is a software model checking toolchain including various analyses for state reachability. The frontend, namely Gazer, supports C programs through an LLVM-based transformation and optimization pipeline. Gazer includes an integrated bounded model checker (BMC) and can also employ the Theta backend, a generic verification framework based on abstraction-refinement (CEGAR). On SV-COMP 2021, a portfolio of BMC, explicit-value analysis, and predicate abstraction is applied sequentially in this order.},
}



@inproceedings{wafers2021,
    author     = {Mih{\'a}ly Dobos-Kov{\'a}cs and {\'A}kos Hajdu and Andr{\'a}s V{\"o}r{\"o}s},
    title      = {Bitvector Support in the {T}heta Formal Verification Framework},
    booktitle  = {Proceedings of the 10th Latin-American Symposium on Dependable Computing},
    year       = {2021},
    publisher  = {IEEE},
    doi        = {10.1109/LADC53747.2021.9672595},

    type       = {Workshop},

    url_pdf    = {https://hajduakos.github.io/publications/wafers2021.pdf},
    url_link   = {https://ieeexplore.ieee.org/document/9672595},
    abstract   = {The verification of safety-critical software systems has many challenges, such as the complex language constructs in embedded software. This paper addresses the verification problem of software systems using bitwise operations, and we present an extension to the Theta open-source formal verification framework. Our goal is to integrate bitvectors and bitwise operations in the abstraction-refinement-based formal verification methods in Theta. Supporting bitvectors is a step towards the verification of industrial embedded software systems. We extended the language support in Theta with formal semantics. In addition, the new language constructs and operators are transformed into the formal language inside Theta. We also need new algorithms to solve the verification problem: we implemented Newton-style refinement algorithms in Theta to verify software with bitvectors and bitwise operators efficiently.},
}



@inproceedings{icst2022,
    author     = {Ke Mao and Timotej Kapus and Lambros Petrou and {\'A}kos Hajdu and Matteo Marescotti and Andreas L{\"o}scher and Mark Harman and Dino Distefano},
    title      = {{FAUSTA}: Scaling Dynamic Analysis with Traffic Generation at {W}hats{A}pp},
    booktitle  = {Proceedings of the 15th IEEE International Conference on Software Testing, Verification and Validation},
    year       = {2022},
    publisher  = {IEEE},
    pages      = {267--278},
    doi        = {10.1109/ICST53961.2022.00036},

    type       = {Conference},

    url_pdf    = {https://hajduakos.github.io/publications/icst2022.pdf},
    url_link   = {https://ieeexplore.ieee.org/document/9787859},
    abstract   = {We introduce Fausta, an algorithmic traffic gener-ation platform that enables analysis and testing at scale. Fausta has been deployed at Meta to analyze and test the WhatsApp plat-form infrastructure since September 2020, enabling WhatsApp developers to deploy reliable code changes to a code base of millions of lines of code, supporting over 2 billion users who rely on WhatsApp for their daily communications. Fausta covers expected and unexpected program behaviors in a privacy-safe controlled environment to support multiple use cases such as reliability testing, privacy analysis and performance regression detection. It currently supports three different algorithmic input generation strategies, each of which construct realistic backend server traffic that closely simulates production data, without replaying any real user data. Fausta has been deployed and closely integrated into the WhatsApp continuous integration process, catching bugs in development before they hit production. We report on the development and deployment of Fausta's reliability use case between September 2020 and August 2021. During this period it has found 1,876 unique reliability issues, with a fix rate of 74%, indicating a high degree of true positive fault revelation. We also report on the distribution of fault types revealed by Fausta, and the correlation between coverage and faults found. Overall, we do find evidence that higher coverage is correlated with fault revelation.},
}



@incollection{tacas2022,
    author     = {{\'A}dam, Zs{\'o}fia and Levente, Bajczi and Dobos-Kov{\'a}cs, Mih{\'a}ly and Hajdu, {\'A}kos and Moln{\'a}r, Vince},
    title      = {{T}heta: portfolio of {CEGAR}-based analyses with dynamic algorithm selection (Competition Contribution)},
    year       = {2022},
    booktitle  = {Tools and Algorithms for the Construction and Analysis of Systems},
    series     = {Lecture Notes in Computer Science},
    volume     = {13244},
    pages      = {474--478},
    publisher  = {Springer},
    doi        = {10.1007/978-3-030-99527-0_34},

    type       = {Conference},

    url_pdf    = {https://hajduakos.github.io/publications/tacas2022.pdf},
    url_link   = {https://link.springer.com/chapter/10.1007/978-3-030-99527-0_34},
    abstract   = {Theta is a model checking framework based on abstraction refinement algorithms. In SV-COMP 2022, we introduce: 1) reasoning at the source-level via a direct translation from C programs; 2) support for concurrent programs with interleaving semantics; 3) mitigation for non-progressing refinement loops; 4) support for SMT-LIB-compliant solvers. We combine all of the aforementioned techniques into a portfolio with dynamic algorithm selection.},
}



@inproceedings{erlang2022,
    author     = {{\'A}kos Hajdu and Matteo Marescotti and Thibault Suzanne and Ke Mao and Radu Grigore and Per Gustafsson and Dino Distefano},
    title      = {{InfERL}: Scalable and Extensible {E}rlang Static Analysis},
    year       = {2022},
    booktitle  = {Proceedings of the 21st ACM SIGPLAN International Workshop on Erlang},
    pages      = {33--39},
    publisher  = {ACM},
    doi        = {10.1145/3546186.3549929},

    type       = {Workshop},

    url_pdf    = {https://hajduakos.github.io/publications/erlang2022.pdf},
    url_slides = {https://hajduakos.github.io/publications/slides/erlang2022.pdf},
    url_link   = {https://dl.acm.org/doi/abs/10.1145/3546186.3549929},
    url_video  = {https://www.youtube.com/watch?v=ZDZtauSxyaE},
    abstract   = {In this paper we introduce InfERL, an open source, scalable, and extensible static analyzer for Erlang, based on Meta's Infer tool. InfERL has been developed at WhatsApp and it is deployed to regularly scan WhatsApp server's Erlang codebase, detecting reliability issues and checking user-defined properties. The paper describes the Erlang specific technical challenges we had to address and our design choices. We also report on our experience in running InfERL on Erlang code at scale, supporting the messaging app used everyday by over 2 billion people.},
}



@article{syseng2023,
    author   = {Horv{\'a}th, Benedek and Moln{\'a}r, Vince and Graics, Bence and Hajdu, {\'A}kos and R{\'a}th, Istv{\'a}n and Horv{\'a}th, {\'A}kos and Karban, Robert and Trancho, Gelys and Micskei, Zolt{\'a}n},
    title    = {Pragmatic verification and validation of industrial executable {SysML} models},
    year     = {2023},
    journal  = {Systems Engineering},
    doi      = {10.1002/sys.21679},
    volume   = {26},
    number   = {6},
    pages    = {693--714},

    type     = {Journal},

    url_pdf  = {https://hajduakos.github.io/publications/syseng2023.pdf},
    url_link = {https://incose.onlinelibrary.wiley.com/doi/10.1002/sys.21679},

    abstract = {In recent years, Model-Based Systems Engineering (MBSE) practices have been applied in various industries to design, simulate and verify complex systems. The verification and validation (V&V) of such systems engineering models are crucial to develop high-quality systems. However, this is a challenging problem due to the complexity of the models and semantic differences in how different tools interpret the models, which can undermine the validity of the obtained results if they go undiscovered. To address these issues, we propose (i) a subset of the SysML language for which the practical semantic integrity of tools can be achieved and (ii) a cloud-based V&V framework for this subset, lifting verification to an industrial scale. We demonstrate the feasibility of our approach on an industrial-scale model from the aerospace domain and summarize the lessons learned during transitioning formal verification tools to an industrial context.},
}



@inproceedings{icse2024,
    author    = {Mao, Ke and {\AA}hs, Cons T and Cela, Sopot and Distefano, Dino and Gardner, Nick and Grigore, Radu and Gustafsson, Per and Hajdu, \'Akos and Kapus, Timotej and Marescotti, Matteo and Cunha Sampaio, Gabriela and Suzanne, Thibault},
    title     = {{P}rivacy{CAT}: Privacy-Aware Code Analysis at Scale},
    year      = {2024},
    booktitle = {Proceedings of the IEEE/ACM 46th International Conference on Software Engineering: Software Engineering in Practice},
    note      = {(Accepted)},

    type      = {Conference},

    url_pdf   = {https://hajduakos.github.io/publications/icse2024.pdf},
    abstract  = {Static and dynamic code analyses have been widely adopted in industry to enhance software reliability, security, and performance by automatically detecting bugs in the code. In this paper, we introduce PrivacyCAT, a code analysis system developed and deployed at WhatsApp to protect user privacy. PrivacyCAT automatically detects privacy defects in code at early stages (before reaching production and affecting users), and therefore, it prevents such vulnerabilities from evolving into privacy incidents. PrivacyCAT comprises of a collection of static and dynamic taint analysers. We report on the technical development of PrivacyCAT and the results of two years of its large-scale industrial deployment at WhatsApp. We present our experience in designing its system architecture, and continuous integration process. We discuss the unique challenges encountered in developing and deploying such kind of analyses within an industrial context. Since its deployment in 2021, PrivacyCAT has safeguarded data privacy in $74\%$ of privacy site events (SEVs). It has prevented 493 potential privacy SEVs from being introduced into the codebases, enabling developers to maintain a high privacy standard for the code that supports over two billion WhatsApp users.},
}



@inproceedings{fse2024,
    author    = {Cela, Sopot and Ciancone, Andrea and Gustafsson, Per and Hajdu, {\'A}kos and Jia, Yue and Kapus, Timotej and Koshtenko, Maksym and Lewis, Will and Mao, Ke and Martac, Dragos},
    title     = {Automated End-to-End Dynamic Taint Analysis for {W}hats{A}pp},
    year      = {2024},
    publisher = {ACM},
    booktitle = {Companion Proceedings of the 32nd ACM Symposium on the Foundations of Software Engineering},
    note      = {(Accepted)},

    type      = {Conference},

    url_pdf    = {https://hajduakos.github.io/publications/fse2024.pdf},
    abstract  = {Taint analysis aims to track data flows in systems, with potential use cases for security, privacy and performance. This paper describes an end-to-end dynamic taint analysis solution for WhatsApp. We use exploratory UI testing to generate realistic interactions and inputs, serving as data sources on the clients and then we track data propagation towards sinks on both client and server sides. Finally, a reporting pipeline localizes tainted flows in the source code, applies deduplication, filters false positives based on production call sites, and files tasks to code owners. Applied to WhatsApp, our approach found 89 flows that were fixed by engineers, and caught 50% of all privacy-related flows that required escalation, including instances that would have been difficult to uncover by conventional testing.},
}
\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=https://hajduakos.github.io/publications.bib\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=https://hajduakos.github.io/publications.bib\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=https://hajduakos.github.io%2Fpublications.bib&amp;jsonp=1&amp;theme=side&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=https://hajduakos.github.io%2Fpublications.bib&amp;jsonp=1&amp;theme=side\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=https://hajduakos.github.io%2Fpublications.bib&amp;jsonp=1&amp;theme=side\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2024\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2024')\"\n      onkeypress=\"toggleGroup('group_2024')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2024</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"mao-hs-cela-distefano-gardner-grigore-gustafsson-hajdu-etal-privacycatprivacyawarecodeanalysisatscale-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/icse2024.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'mao-hs-cela-distefano-gardner-grigore-gustafsson-hajdu-etal-privacycatprivacyawarecodeanalysisatscale-2024', 'https://hajduakos.github.io/publications/icse2024.pdf', event);\">\n    PrivacyCAT: Privacy-Aware Code Analysis at Scale.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Mao, K.; Åhs, C. T; Cela, S.; Distefano, D.; Gardner, N.; Grigore, R.; Gustafsson, P.; <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Kapus, T.; Marescotti, M.; Cunha Sampaio, G.;  and Suzanne, T.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the IEEE/ACM 46th International Conference on Software Engineering: Software Engineering in Practice</i>,  2024. \n  <span class=\"note\">(Accepted)</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/icse2024.pdf\"\n     onclick=\"log_download('mao-hs-cela-distefano-gardner-grigore-gustafsson-hajdu-etal-privacycatprivacyawarecodeanalysisatscale-2024', 'https://hajduakos.github.io/publications/icse2024.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"PrivacyCAT: Privacy-Aware Code Analysis at Scale [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mao-hs-cela-distefano-gardner-grigore-gustafsson-hajdu-etal-privacycatprivacyawarecodeanalysisatscale-2024\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mao-hs-cela-distefano-gardner-grigore-gustafsson-hajdu-etal-privacycatprivacyawarecodeanalysisatscale-2024')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{icse2024,\n    author    = {Mao, Ke and {\\AA}hs, Cons T and Cela, Sopot and Distefano, Dino and Gardner, Nick and Grigore, Radu and Gustafsson, Per and Hajdu, \\&#x27;Akos and Kapus, Timotej and Marescotti, Matteo and Cunha Sampaio, Gabriela and Suzanne, Thibault},\n    title     = {{P}rivacy{CAT}: Privacy-Aware Code Analysis at Scale},\n    year      = {2024},\n    booktitle = {Proceedings of the IEEE/ACM 46th International Conference on Software Engineering: Software Engineering in Practice},\n    note      = {(Accepted)},\n\n    type      = {Conference},\n\n    url_pdf   = {https://hajduakos.github.io/publications/icse2024.pdf},\n    abstract  = {Static and dynamic code analyses have been widely adopted in industry to enhance software reliability, security, and performance by automatically detecting bugs in the code. In this paper, we introduce PrivacyCAT, a code analysis system developed and deployed at WhatsApp to protect user privacy. PrivacyCAT automatically detects privacy defects in code at early stages (before reaching production and affecting users), and therefore, it prevents such vulnerabilities from evolving into privacy incidents. PrivacyCAT comprises of a collection of static and dynamic taint analysers. We report on the technical development of PrivacyCAT and the results of two years of its large-scale industrial deployment at WhatsApp. We present our experience in designing its system architecture, and continuous integration process. We discuss the unique challenges encountered in developing and deploying such kind of analyses within an industrial context. Since its deployment in 2021, PrivacyCAT has safeguarded data privacy in $74\\%$ of privacy site events (SEVs). It has prevented 493 potential privacy SEVs from being introduced into the codebases, enabling developers to maintain a high privacy standard for the code that supports over two billion WhatsApp users.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Static and dynamic code analyses have been widely adopted in industry to enhance software reliability, security, and performance by automatically detecting bugs in the code. In this paper, we introduce PrivacyCAT, a code analysis system developed and deployed at WhatsApp to protect user privacy. PrivacyCAT automatically detects privacy defects in code at early stages (before reaching production and affecting users), and therefore, it prevents such vulnerabilities from evolving into privacy incidents. PrivacyCAT comprises of a collection of static and dynamic taint analysers. We report on the technical development of PrivacyCAT and the results of two years of its large-scale industrial deployment at WhatsApp. We present our experience in designing its system architecture, and continuous integration process. We discuss the unique challenges encountered in developing and deploying such kind of analyses within an industrial context. Since its deployment in 2021, PrivacyCAT has safeguarded data privacy in $74%$ of privacy site events (SEVs). It has prevented 493 potential privacy SEVs from being introduced into the codebases, enabling developers to maintain a high privacy standard for the code that supports over two billion WhatsApp users.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cela-ciancone-gustafsson-hajdu-jia-kapus-koshtenko-lewis-etal-automatedendtoenddynamictaintanalysisforwhatsapp-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/fse2024.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cela-ciancone-gustafsson-hajdu-jia-kapus-koshtenko-lewis-etal-automatedendtoenddynamictaintanalysisforwhatsapp-2024', 'https://hajduakos.github.io/publications/fse2024.pdf', event);\">\n    Automated End-to-End Dynamic Taint Analysis for WhatsApp.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Cela, S.; Ciancone, A.; Gustafsson, P.; <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Jia, Y.; Kapus, T.; Koshtenko, M.; Lewis, W.; Mao, K.;  and Martac, D.\n</span>\n\n  \n\n</span>\n\n  In <i>Companion Proceedings of the 32nd ACM Symposium on the Foundations of Software Engineering</i>,  2024. ACM\n  <span class=\"note\">(Accepted)</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/fse2024.pdf\"\n     onclick=\"log_download('cela-ciancone-gustafsson-hajdu-jia-kapus-koshtenko-lewis-etal-automatedendtoenddynamictaintanalysisforwhatsapp-2024', 'https://hajduakos.github.io/publications/fse2024.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Automated End-to-End Dynamic Taint Analysis for WhatsApp [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cela-ciancone-gustafsson-hajdu-jia-kapus-koshtenko-lewis-etal-automatedendtoenddynamictaintanalysisforwhatsapp-2024\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cela-ciancone-gustafsson-hajdu-jia-kapus-koshtenko-lewis-etal-automatedendtoenddynamictaintanalysisforwhatsapp-2024')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{fse2024,\n    author    = {Cela, Sopot and Ciancone, Andrea and Gustafsson, Per and Hajdu, {\\&#x27;A}kos and Jia, Yue and Kapus, Timotej and Koshtenko, Maksym and Lewis, Will and Mao, Ke and Martac, Dragos},\n    title     = {Automated End-to-End Dynamic Taint Analysis for {W}hats{A}pp},\n    year      = {2024},\n    publisher = {ACM},\n    booktitle = {Companion Proceedings of the 32nd ACM Symposium on the Foundations of Software Engineering},\n    note      = {(Accepted)},\n\n    type      = {Conference},\n\n    url_pdf    = {https://hajduakos.github.io/publications/fse2024.pdf},\n    abstract  = {Taint analysis aims to track data flows in systems, with potential use cases for security, privacy and performance. This paper describes an end-to-end dynamic taint analysis solution for WhatsApp. We use exploratory UI testing to generate realistic interactions and inputs, serving as data sources on the clients and then we track data propagation towards sinks on both client and server sides. Finally, a reporting pipeline localizes tainted flows in the source code, applies deduplication, filters false positives based on production call sites, and files tasks to code owners. Applied to WhatsApp, our approach found 89 flows that were fixed by engineers, and caught 50% of all privacy-related flows that required escalation, including instances that would have been difficult to uncover by conventional testing.},\n}\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Taint analysis aims to track data flows in systems, with potential use cases for security, privacy and performance. This paper describes an end-to-end dynamic taint analysis solution for WhatsApp. We use exploratory UI testing to generate realistic interactions and inputs, serving as data sources on the clients and then we track data propagation towards sinks on both client and server sides. Finally, a reporting pipeline localizes tainted flows in the source code, applies deduplication, filters false positives based on production call sites, and files tasks to code owners. Applied to WhatsApp, our approach found 89 flows that were fixed by engineers, and caught 50% of all privacy-related flows that required escalation, including instances that would have been difficult to uncover by conventional testing.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2023\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2023')\"\n      onkeypress=\"toggleGroup('group_2023')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2023</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"horvth-molnr-graics-hajdu-rth-horvth-karban-trancho-etal-pragmaticverificationandvalidationofindustrialexecutablesysmlmodels-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/syseng2023.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'horvth-molnr-graics-hajdu-rth-horvth-karban-trancho-etal-pragmaticverificationandvalidationofindustrialexecutablesysmlmodels-2023', 'https://hajduakos.github.io/publications/syseng2023.pdf', event);\">\n    Pragmatic verification and validation of industrial executable SysML models.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Horváth, B.; Molnár, V.; Graics, B.; <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Ráth, I.; Horváth, Á.; Karban, R.; Trancho, G.;  and Micskei, Z.\n</span>\n\n  \n\n</span>\n\n  <i>Systems Engineering</i>, 26(6): 693–714.  2023.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/syseng2023.pdf\"\n     onclick=\"log_download('horvth-molnr-graics-hajdu-rth-horvth-karban-trancho-etal-pragmaticverificationandvalidationofindustrialexecutablesysmlmodels-2023', 'https://hajduakos.github.io/publications/syseng2023.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Pragmatic verification and validation of industrial executable SysML models [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://incose.onlinelibrary.wiley.com/doi/10.1002/sys.21679\"\n     onclick=\"log_download('horvth-molnr-graics-hajdu-rth-horvth-karban-trancho-etal-pragmaticverificationandvalidationofindustrialexecutablesysmlmodels-2023', 'https://incose.onlinelibrary.wiley.com/doi/10.1002/sys.21679', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Pragmatic verification and validation of industrial executable SysML models [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1002/sys.21679\"\n     onclick=\"log_download('horvth-molnr-graics-hajdu-rth-horvth-karban-trancho-etal-pragmaticverificationandvalidationofindustrialexecutablesysmlmodels-2023', 'http://doi.org/10.1002/sys.21679', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/horvth-molnr-graics-hajdu-rth-horvth-karban-trancho-etal-pragmaticverificationandvalidationofindustrialexecutablesysmlmodels-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('horvth-molnr-graics-hajdu-rth-horvth-karban-trancho-etal-pragmaticverificationandvalidationofindustrialexecutablesysmlmodels-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{syseng2023,\n    author   = {Horv{\\&#x27;a}th, Benedek and Moln{\\&#x27;a}r, Vince and Graics, Bence and Hajdu, {\\&#x27;A}kos and R{\\&#x27;a}th, Istv{\\&#x27;a}n and Horv{\\&#x27;a}th, {\\&#x27;A}kos and Karban, Robert and Trancho, Gelys and Micskei, Zolt{\\&#x27;a}n},\n    title    = {Pragmatic verification and validation of industrial executable {SysML} models},\n    year     = {2023},\n    journal  = {Systems Engineering},\n    doi      = {10.1002/sys.21679},\n    volume   = {26},\n    number   = {6},\n    pages    = {693--714},\n\n    type     = {Journal},\n\n    url_pdf  = {https://hajduakos.github.io/publications/syseng2023.pdf},\n    url_link = {https://incose.onlinelibrary.wiley.com/doi/10.1002/sys.21679},\n\n    abstract = {In recent years, Model-Based Systems Engineering (MBSE) practices have been applied in various industries to design, simulate and verify complex systems. The verification and validation (V&amp;V) of such systems engineering models are crucial to develop high-quality systems. However, this is a challenging problem due to the complexity of the models and semantic differences in how different tools interpret the models, which can undermine the validity of the obtained results if they go undiscovered. To address these issues, we propose (i) a subset of the SysML language for which the practical semantic integrity of tools can be achieved and (ii) a cloud-based V&amp;V framework for this subset, lifting verification to an industrial scale. We demonstrate the feasibility of our approach on an industrial-scale model from the aerospace domain and summarize the lessons learned during transitioning formal verification tools to an industrial context.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In recent years, Model-Based Systems Engineering (MBSE) practices have been applied in various industries to design, simulate and verify complex systems. The verification and validation (V&V) of such systems engineering models are crucial to develop high-quality systems. However, this is a challenging problem due to the complexity of the models and semantic differences in how different tools interpret the models, which can undermine the validity of the obtained results if they go undiscovered. To address these issues, we propose (i) a subset of the SysML language for which the practical semantic integrity of tools can be achieved and (ii) a cloud-based V&V framework for this subset, lifting verification to an industrial scale. We demonstrate the feasibility of our approach on an industrial-scale model from the aerospace domain and summarize the lessons learned during transitioning formal verification tools to an industrial context.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2022\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2022')\"\n      onkeypress=\"toggleGroup('group_2022')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2022</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"mao-kapus-petrou-hajdu-marescotti-lscher-harman-distefano-faustascalingdynamicanalysiswithtrafficgenerationatwhatsapp-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/icst2022.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'mao-kapus-petrou-hajdu-marescotti-lscher-harman-distefano-faustascalingdynamicanalysiswithtrafficgenerationatwhatsapp-2022', 'https://hajduakos.github.io/publications/icst2022.pdf', event);\">\n    FAUSTA: Scaling Dynamic Analysis with Traffic Generation at WhatsApp.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Mao, K.; Kapus, T.; Petrou, L.; <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Marescotti, M.; Löscher, A.; Harman, M.;  and Distefano, D.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 15th IEEE International Conference on Software Testing, Verification and Validation</i>, pages 267–278,  2022. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/icst2022.pdf\"\n     onclick=\"log_download('mao-kapus-petrou-hajdu-marescotti-lscher-harman-distefano-faustascalingdynamicanalysiswithtrafficgenerationatwhatsapp-2022', 'https://hajduakos.github.io/publications/icst2022.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"FAUSTA: Scaling Dynamic Analysis with Traffic Generation at WhatsApp [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://ieeexplore.ieee.org/document/9787859\"\n     onclick=\"log_download('mao-kapus-petrou-hajdu-marescotti-lscher-harman-distefano-faustascalingdynamicanalysiswithtrafficgenerationatwhatsapp-2022', 'https://ieeexplore.ieee.org/document/9787859', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"FAUSTA: Scaling Dynamic Analysis with Traffic Generation at WhatsApp [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ICST53961.2022.00036\"\n     onclick=\"log_download('mao-kapus-petrou-hajdu-marescotti-lscher-harman-distefano-faustascalingdynamicanalysiswithtrafficgenerationatwhatsapp-2022', 'http://doi.org/10.1109/ICST53961.2022.00036', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mao-kapus-petrou-hajdu-marescotti-lscher-harman-distefano-faustascalingdynamicanalysiswithtrafficgenerationatwhatsapp-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mao-kapus-petrou-hajdu-marescotti-lscher-harman-distefano-faustascalingdynamicanalysiswithtrafficgenerationatwhatsapp-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{icst2022,\n    author     = {Ke Mao and Timotej Kapus and Lambros Petrou and {\\&#x27;A}kos Hajdu and Matteo Marescotti and Andreas L{\\&quot;o}scher and Mark Harman and Dino Distefano},\n    title      = {{FAUSTA}: Scaling Dynamic Analysis with Traffic Generation at {W}hats{A}pp},\n    booktitle  = {Proceedings of the 15th IEEE International Conference on Software Testing, Verification and Validation},\n    year       = {2022},\n    publisher  = {IEEE},\n    pages      = {267--278},\n    doi        = {10.1109/ICST53961.2022.00036},\n\n    type       = {Conference},\n\n    url_pdf    = {https://hajduakos.github.io/publications/icst2022.pdf},\n    url_link   = {https://ieeexplore.ieee.org/document/9787859},\n    abstract   = {We introduce Fausta, an algorithmic traffic gener-ation platform that enables analysis and testing at scale. Fausta has been deployed at Meta to analyze and test the WhatsApp plat-form infrastructure since September 2020, enabling WhatsApp developers to deploy reliable code changes to a code base of millions of lines of code, supporting over 2 billion users who rely on WhatsApp for their daily communications. Fausta covers expected and unexpected program behaviors in a privacy-safe controlled environment to support multiple use cases such as reliability testing, privacy analysis and performance regression detection. It currently supports three different algorithmic input generation strategies, each of which construct realistic backend server traffic that closely simulates production data, without replaying any real user data. Fausta has been deployed and closely integrated into the WhatsApp continuous integration process, catching bugs in development before they hit production. We report on the development and deployment of Fausta&#x27;s reliability use case between September 2020 and August 2021. During this period it has found 1,876 unique reliability issues, with a fix rate of 74%, indicating a high degree of true positive fault revelation. We also report on the distribution of fault types revealed by Fausta, and the correlation between coverage and faults found. Overall, we do find evidence that higher coverage is correlated with fault revelation.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We introduce Fausta, an algorithmic traffic gener-ation platform that enables analysis and testing at scale. Fausta has been deployed at Meta to analyze and test the WhatsApp plat-form infrastructure since September 2020, enabling WhatsApp developers to deploy reliable code changes to a code base of millions of lines of code, supporting over 2 billion users who rely on WhatsApp for their daily communications. Fausta covers expected and unexpected program behaviors in a privacy-safe controlled environment to support multiple use cases such as reliability testing, privacy analysis and performance regression detection. It currently supports three different algorithmic input generation strategies, each of which construct realistic backend server traffic that closely simulates production data, without replaying any real user data. Fausta has been deployed and closely integrated into the WhatsApp continuous integration process, catching bugs in development before they hit production. We report on the development and deployment of Fausta's reliability use case between September 2020 and August 2021. During this period it has found 1,876 unique reliability issues, with a fix rate of 74%, indicating a high degree of true positive fault revelation. We also report on the distribution of fault types revealed by Fausta, and the correlation between coverage and faults found. Overall, we do find evidence that higher coverage is correlated with fault revelation.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"dam-levente-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/tacas2022.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'dam-levente-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022', 'https://hajduakos.github.io/publications/tacas2022.pdf', event);\">\n    Theta: portfolio of CEGAR-based analyses with dynamic algorithm selection (Competition Contribution).\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Ádam, Z.; Levente, B.; Dobos-Kovács, M.; <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>;  and Molnár, V.\n</span>\n\n  \n\n</span>\n\n  In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, volume 13244, of Lecture Notes in Computer Science, pages 474–478. Springer,  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/tacas2022.pdf\"\n     onclick=\"log_download('dam-levente-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022', 'https://hajduakos.github.io/publications/tacas2022.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Theta: portfolio of CEGAR-based analyses with dynamic algorithm selection (Competition Contribution) [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://link.springer.com/chapter/10.1007/978-3-030-99527-0_34\"\n     onclick=\"log_download('dam-levente-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022', 'https://link.springer.com/chapter/10.1007/978-3-030-99527-0_34', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Theta: portfolio of CEGAR-based analyses with dynamic algorithm selection (Competition Contribution) [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-030-99527-0_34\"\n     onclick=\"log_download('dam-levente-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022', 'http://doi.org/10.1007/978-3-030-99527-0_34', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dam-levente-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dam-levente-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@incollection{tacas2022,\n    author     = {{\\&#x27;A}dam, Zs{\\&#x27;o}fia and Levente, Bajczi and Dobos-Kov{\\&#x27;a}cs, Mih{\\&#x27;a}ly and Hajdu, {\\&#x27;A}kos and Moln{\\&#x27;a}r, Vince},\n    title      = {{T}heta: portfolio of {CEGAR}-based analyses with dynamic algorithm selection (Competition Contribution)},\n    year       = {2022},\n    booktitle  = {Tools and Algorithms for the Construction and Analysis of Systems},\n    series     = {Lecture Notes in Computer Science},\n    volume     = {13244},\n    pages      = {474--478},\n    publisher  = {Springer},\n    doi        = {10.1007/978-3-030-99527-0_34},\n\n    type       = {Conference},\n\n    url_pdf    = {https://hajduakos.github.io/publications/tacas2022.pdf},\n    url_link   = {https://link.springer.com/chapter/10.1007/978-3-030-99527-0_34},\n    abstract   = {Theta is a model checking framework based on abstraction refinement algorithms. In SV-COMP 2022, we introduce: 1) reasoning at the source-level via a direct translation from C programs; 2) support for concurrent programs with interleaving semantics; 3) mitigation for non-progressing refinement loops; 4) support for SMT-LIB-compliant solvers. We combine all of the aforementioned techniques into a portfolio with dynamic algorithm selection.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Theta is a model checking framework based on abstraction refinement algorithms. In SV-COMP 2022, we introduce: 1) reasoning at the source-level via a direct translation from C programs; 2) support for concurrent programs with interleaving semantics; 3) mitigation for non-progressing refinement loops; 4) support for SMT-LIB-compliant solvers. We combine all of the aforementioned techniques into a portfolio with dynamic algorithm selection.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hajdu-marescotti-suzanne-mao-grigore-gustafsson-distefano-inferlscalableandextensibleerlangstaticanalysis-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/erlang2022.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hajdu-marescotti-suzanne-mao-grigore-gustafsson-distefano-inferlscalableandextensibleerlangstaticanalysis-2022', 'https://hajduakos.github.io/publications/erlang2022.pdf', event);\">\n    InfERL: Scalable and Extensible Erlang Static Analysis.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Marescotti, M.; Suzanne, T.; Mao, K.; Grigore, R.; Gustafsson, P.;  and Distefano, D.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 21st ACM SIGPLAN International Workshop on Erlang</i>, pages 33–39,  2022. ACM\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/erlang2022.pdf\"\n     onclick=\"log_download('hajdu-marescotti-suzanne-mao-grigore-gustafsson-distefano-inferlscalableandextensibleerlangstaticanalysis-2022', 'https://hajduakos.github.io/publications/erlang2022.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"InfERL: Scalable and Extensible Erlang Static Analysis [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://hajduakos.github.io/publications/slides/erlang2022.pdf\"\n     onclick=\"log_download('hajdu-marescotti-suzanne-mao-grigore-gustafsson-distefano-inferlscalableandextensibleerlangstaticanalysis-2022', 'https://hajduakos.github.io/publications/slides/erlang2022.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"InfERL: Scalable and Extensible Erlang Static Analysis [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n  <a href=\"https://dl.acm.org/doi/abs/10.1145/3546186.3549929\"\n     onclick=\"log_download('hajdu-marescotti-suzanne-mao-grigore-gustafsson-distefano-inferlscalableandextensibleerlangstaticanalysis-2022', 'https://dl.acm.org/doi/abs/10.1145/3546186.3549929', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"InfERL: Scalable and Extensible Erlang Static Analysis [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n  <a href=\"https://www.youtube.com/watch?v=ZDZtauSxyaE\"\n     onclick=\"log_download('hajdu-marescotti-suzanne-mao-grigore-gustafsson-distefano-inferlscalableandextensibleerlangstaticanalysis-2022', 'https://www.youtube.com/watch?v=ZDZtauSxyaE', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"InfERL: Scalable and Extensible Erlang Static Analysis [link]\"\n       title=\" video\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> video</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1145/3546186.3549929\"\n     onclick=\"log_download('hajdu-marescotti-suzanne-mao-grigore-gustafsson-distefano-inferlscalableandextensibleerlangstaticanalysis-2022', 'http://doi.org/10.1145/3546186.3549929', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hajdu-marescotti-suzanne-mao-grigore-gustafsson-distefano-inferlscalableandextensibleerlangstaticanalysis-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>16 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hajdu-marescotti-suzanne-mao-grigore-gustafsson-distefano-inferlscalableandextensibleerlangstaticanalysis-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{erlang2022,\n    author     = {{\\&#x27;A}kos Hajdu and Matteo Marescotti and Thibault Suzanne and Ke Mao and Radu Grigore and Per Gustafsson and Dino Distefano},\n    title      = {{InfERL}: Scalable and Extensible {E}rlang Static Analysis},\n    year       = {2022},\n    booktitle  = {Proceedings of the 21st ACM SIGPLAN International Workshop on Erlang},\n    pages      = {33--39},\n    publisher  = {ACM},\n    doi        = {10.1145/3546186.3549929},\n\n    type       = {Workshop},\n\n    url_pdf    = {https://hajduakos.github.io/publications/erlang2022.pdf},\n    url_slides = {https://hajduakos.github.io/publications/slides/erlang2022.pdf},\n    url_link   = {https://dl.acm.org/doi/abs/10.1145/3546186.3549929},\n    url_video  = {https://www.youtube.com/watch?v=ZDZtauSxyaE},\n    abstract   = {In this paper we introduce InfERL, an open source, scalable, and extensible static analyzer for Erlang, based on Meta&#x27;s Infer tool. InfERL has been developed at WhatsApp and it is deployed to regularly scan WhatsApp server&#x27;s Erlang codebase, detecting reliability issues and checking user-defined properties. The paper describes the Erlang specific technical challenges we had to address and our design choices. We also report on our experience in running InfERL on Erlang code at scale, supporting the messaging app used everyday by over 2 billion people.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we introduce InfERL, an open source, scalable, and extensible static analyzer for Erlang, based on Meta's Infer tool. InfERL has been developed at WhatsApp and it is deployed to regularly scan WhatsApp server's Erlang codebase, detecting reliability issues and checking user-defined properties. The paper describes the Erlang specific technical challenges we had to address and our design choices. We also report on our experience in running InfERL on Erlang code at scale, supporting the messaging app used everyday by over 2 billion people.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2021\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2021')\"\n      onkeypress=\"toggleGroup('group_2021')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2021</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"dam-sallai-hajdu-gazerthetallvmbasedverifierportfoliowithbmccegarcompetitioncontribution-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/tacas2021.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'dam-sallai-hajdu-gazerthetallvmbasedverifierportfoliowithbmccegarcompetitioncontribution-2021', 'https://hajduakos.github.io/publications/tacas2021.pdf', event);\">\n    Gazer-Theta: LLVM-based Verifier Portfolio with BMC/CEGAR (Competition Contribution).\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Ádam, Z.; Sallai, G.;  and <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, volume 12652, of Lecture Notes in Computer Science, pages 435–439. Springer,  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/tacas2021.pdf\"\n     onclick=\"log_download('dam-sallai-hajdu-gazerthetallvmbasedverifierportfoliowithbmccegarcompetitioncontribution-2021', 'https://hajduakos.github.io/publications/tacas2021.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Gazer-Theta: LLVM-based Verifier Portfolio with BMC/CEGAR (Competition Contribution) [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://youtu.be/8DEtrRJixpA\"\n     onclick=\"log_download('dam-sallai-hajdu-gazerthetallvmbasedverifierportfoliowithbmccegarcompetitioncontribution-2021', 'https://youtu.be/8DEtrRJixpA', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Gazer-Theta: LLVM-based Verifier Portfolio with BMC/CEGAR (Competition Contribution) [link]\"\n       title=\" video\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> video</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-030-72013-1_27\"\n     onclick=\"log_download('dam-sallai-hajdu-gazerthetallvmbasedverifierportfoliowithbmccegarcompetitioncontribution-2021', 'http://doi.org/10.1007/978-3-030-72013-1_27', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dam-sallai-hajdu-gazerthetallvmbasedverifierportfoliowithbmccegarcompetitioncontribution-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>21 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dam-sallai-hajdu-gazerthetallvmbasedverifierportfoliowithbmccegarcompetitioncontribution-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@incollection{tacas2021,\n    author     = {{\\&#x27;A}dam, Zs{\\&#x27;o}fia and Sallai, Gyula and Hajdu, {\\&#x27;A}kos},\n    title      = {{G}azer-{T}heta: {LLVM}-based Verifier Portfolio with {BMC}/{CEGAR} (Competition Contribution)},\n    year       = {2021},\n    booktitle  = {Tools and Algorithms for the Construction and Analysis of Systems},\n    series     = {Lecture Notes in Computer Science},\n    volume     = {12652},\n    publisher  = {Springer},\n    pages      = {435--439},\n    doi        = {10.1007/978-3-030-72013-1_27},\n\n    type       = {Conference},\n\n    url_pdf    = {https://hajduakos.github.io/publications/tacas2021.pdf},\n    url_video  = {https://youtu.be/8DEtrRJixpA},\n    abstract   = {Gazer-Theta is a software model checking toolchain including various analyses for state reachability. The frontend, namely Gazer, supports C programs through an LLVM-based transformation and optimization pipeline. Gazer includes an integrated bounded model checker (BMC) and can also employ the Theta backend, a generic verification framework based on abstraction-refinement (CEGAR). On SV-COMP 2021, a portfolio of BMC, explicit-value analysis, and predicate abstraction is applied sequentially in this order.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Gazer-Theta is a software model checking toolchain including various analyses for state reachability. The frontend, namely Gazer, supports C programs through an LLVM-based transformation and optimization pipeline. Gazer includes an integrated bounded model checker (BMC) and can also employ the Theta backend, a generic verification framework based on abstraction-refinement (CEGAR). On SV-COMP 2021, a portfolio of BMC, explicit-value analysis, and predicate abstraction is applied sequentially in this order.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"doboskovcs-hajdu-vrs-bitvectorsupportinthethetaformalverificationframework-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/wafers2021.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'doboskovcs-hajdu-vrs-bitvectorsupportinthethetaformalverificationframework-2021', 'https://hajduakos.github.io/publications/wafers2021.pdf', event);\">\n    Bitvector Support in the Theta Formal Verification Framework.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Dobos-Kovács, M.; <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>;  and Vörös, A.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 10th Latin-American Symposium on Dependable Computing</i>,  2021. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/wafers2021.pdf\"\n     onclick=\"log_download('doboskovcs-hajdu-vrs-bitvectorsupportinthethetaformalverificationframework-2021', 'https://hajduakos.github.io/publications/wafers2021.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Bitvector Support in the Theta Formal Verification Framework [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://ieeexplore.ieee.org/document/9672595\"\n     onclick=\"log_download('doboskovcs-hajdu-vrs-bitvectorsupportinthethetaformalverificationframework-2021', 'https://ieeexplore.ieee.org/document/9672595', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Bitvector Support in the Theta Formal Verification Framework [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/LADC53747.2021.9672595\"\n     onclick=\"log_download('doboskovcs-hajdu-vrs-bitvectorsupportinthethetaformalverificationframework-2021', 'http://doi.org/10.1109/LADC53747.2021.9672595', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/doboskovcs-hajdu-vrs-bitvectorsupportinthethetaformalverificationframework-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('doboskovcs-hajdu-vrs-bitvectorsupportinthethetaformalverificationframework-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{wafers2021,\n    author     = {Mih{\\&#x27;a}ly Dobos-Kov{\\&#x27;a}cs and {\\&#x27;A}kos Hajdu and Andr{\\&#x27;a}s V{\\&quot;o}r{\\&quot;o}s},\n    title      = {Bitvector Support in the {T}heta Formal Verification Framework},\n    booktitle  = {Proceedings of the 10th Latin-American Symposium on Dependable Computing},\n    year       = {2021},\n    publisher  = {IEEE},\n    doi        = {10.1109/LADC53747.2021.9672595},\n\n    type       = {Workshop},\n\n    url_pdf    = {https://hajduakos.github.io/publications/wafers2021.pdf},\n    url_link   = {https://ieeexplore.ieee.org/document/9672595},\n    abstract   = {The verification of safety-critical software systems has many challenges, such as the complex language constructs in embedded software. This paper addresses the verification problem of software systems using bitwise operations, and we present an extension to the Theta open-source formal verification framework. Our goal is to integrate bitvectors and bitwise operations in the abstraction-refinement-based formal verification methods in Theta. Supporting bitvectors is a step towards the verification of industrial embedded software systems. We extended the language support in Theta with formal semantics. In addition, the new language constructs and operators are transformed into the formal language inside Theta. We also need new algorithms to solve the verification problem: we implemented Newton-style refinement algorithms in Theta to verify software with bitvectors and bitwise operators efficiently.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The verification of safety-critical software systems has many challenges, such as the complex language constructs in embedded software. This paper addresses the verification problem of software systems using bitwise operations, and we present an extension to the Theta open-source formal verification framework. Our goal is to integrate bitvectors and bitwise operations in the abstraction-refinement-based formal verification methods in Theta. Supporting bitvectors is a step towards the verification of industrial embedded software systems. We extended the language support in Theta with formal semantics. In addition, the new language constructs and operators are transformed into the formal language inside Theta. We also need new algorithms to solve the verification problem: we implemented Newton-style refinement algorithms in Theta to verify software with bitvectors and bitwise operators efficiently.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2020\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2020')\"\n      onkeypress=\"toggleGroup('group_2020')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2020</span>\n      <span class=\"bibbase_group_count\">\n        \n        (7)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"hajdu-jovanovi-solcverifyamodularverifierforsoliditysmartcontracts-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/vstte2019.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hajdu-jovanovi-solcverifyamodularverifierforsoliditysmartcontracts-2020', 'https://hajduakos.github.io/publications/vstte2019.pdf', event);\">\n    solc-verify: A Modular Verifier for Solidity Smart Contracts.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>;  and Jovanović, D.\n</span>\n\n  \n\n</span>\n\n  In <i>Verified Software. Theories, Tools, and Experiments</i>, volume 12301, of Lecture Notes in Computer Science, pages 161–179. Springer,  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/vstte2019.pdf\"\n     onclick=\"log_download('hajdu-jovanovi-solcverifyamodularverifierforsoliditysmartcontracts-2020', 'https://hajduakos.github.io/publications/vstte2019.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"solc-verify: A Modular Verifier for Solidity Smart Contracts [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://link.springer.com/chapter/10.1007/978-3-030-41600-3_11\"\n     onclick=\"log_download('hajdu-jovanovi-solcverifyamodularverifierforsoliditysmartcontracts-2020', 'https://link.springer.com/chapter/10.1007/978-3-030-41600-3_11', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"solc-verify: A Modular Verifier for Solidity Smart Contracts [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n  <a href=\"https://hajduakos.github.io/publications/slides/vstte2019.pdf\"\n     onclick=\"log_download('hajdu-jovanovi-solcverifyamodularverifierforsoliditysmartcontracts-2020', 'https://hajduakos.github.io/publications/slides/vstte2019.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"solc-verify: A Modular Verifier for Solidity Smart Contracts [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-030-41600-3_11\"\n     onclick=\"log_download('hajdu-jovanovi-solcverifyamodularverifierforsoliditysmartcontracts-2020', 'http://doi.org/10.1007/978-3-030-41600-3_11', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hajdu-jovanovi-solcverifyamodularverifierforsoliditysmartcontracts-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hajdu-jovanovi-solcverifyamodularverifierforsoliditysmartcontracts-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@incollection{vstte2019,\n    author     = {Hajdu, {\\&#x27;A}kos and Jovanovi{\\&#x27;c}, Dejan},\n    title      = {solc-verify: A Modular Verifier for {S}olidity Smart Contracts},\n    year       = {2020},\n    booktitle  = {Verified Software. Theories, Tools, and Experiments},\n    pages      = {161--179},\n    series     = {Lecture Notes in Computer Science},\n    volume     = {12301},\n    publisher  = {Springer},\n    doi        = {10.1007/978-3-030-41600-3_11},\n    isbn       = {978-3-030-41600-3},\n\n    type       = {Conference},\n\n    url_pdf    = {https://hajduakos.github.io/publications/vstte2019.pdf},\n    url_link   = {https://link.springer.com/chapter/10.1007/978-3-030-41600-3_11},\n    url_slides = {https://hajduakos.github.io/publications/slides/vstte2019.pdf},\n\n    abstract   = {We present solc-verify, a source-level verification tool for Ethereum smart contracts. Solc-verify takes smart contracts written in Solidity and discharges verification conditions using modular program analysis and SMT solvers. Built on top of the Solidity compiler, solc-verify reasons at the level of the contract source code, as opposed to the more common approaches that operate at the level of Ethereum bytecode. This enables solc-verify to effectively reason about high-level contract properties while modeling low-level language semantics precisely. The contract properties, such as contract invariants, loop invariants, and function pre- and post-conditions, can be provided as annotations in the code by the developer. This enables automated, yet user-friendly formal verification for smart contracts. We demonstrate solc-verify by examining real-world examples where our tool can effectively find bugs and prove correctness of non-trivial properties with minimal user effort.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We present solc-verify, a source-level verification tool for Ethereum smart contracts. Solc-verify takes smart contracts written in Solidity and discharges verification conditions using modular program analysis and SMT solvers. Built on top of the Solidity compiler, solc-verify reasons at the level of the contract source code, as opposed to the more common approaches that operate at the level of Ethereum bytecode. This enables solc-verify to effectively reason about high-level contract properties while modeling low-level language semantics precisely. The contract properties, such as contract invariants, loop invariants, and function pre- and post-conditions, can be provided as annotations in the code by the developer. This enables automated, yet user-friendly formal verification for smart contracts. We demonstrate solc-verify by examining real-world examples where our tool can effectively find bugs and prove correctness of non-trivial properties with minimal user effort.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hajdu-micskei-efficientstrategiesforcegarbasedmodelchecking-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://link.springer.com/content/pdf/10.1007%2Fs10817-019-09535-x.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hajdu-micskei-efficientstrategiesforcegarbasedmodelchecking-2020', 'https://link.springer.com/content/pdf/10.1007%2Fs10817-019-09535-x.pdf', event);\">\n    Efficient Strategies for CEGAR-based Model Checking.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>;  and Micskei, Z.\n</span>\n\n  \n\n</span>\n\n  <i>Journal of Automated Reasoning</i>, 64(6): 1051–1091.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://link.springer.com/content/pdf/10.1007%2Fs10817-019-09535-x.pdf\"\n     onclick=\"log_download('hajdu-micskei-efficientstrategiesforcegarbasedmodelchecking-2020', 'https://link.springer.com/content/pdf/10.1007%2Fs10817-019-09535-x.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Efficient Strategies for CEGAR-based Model Checking [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://link.springer.com/article/10.1007/s10817-019-09535-x\"\n     onclick=\"log_download('hajdu-micskei-efficientstrategiesforcegarbasedmodelchecking-2020', 'https://link.springer.com/article/10.1007/s10817-019-09535-x', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Efficient Strategies for CEGAR-based Model Checking [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/s10817-019-09535-x\"\n     onclick=\"log_download('hajdu-micskei-efficientstrategiesforcegarbasedmodelchecking-2020', 'http://doi.org/10.1007/s10817-019-09535-x', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hajdu-micskei-efficientstrategiesforcegarbasedmodelchecking-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>13 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hajdu-micskei-efficientstrategiesforcegarbasedmodelchecking-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{jar2019,\n    author   = {{\\&#x27;A}kos Hajdu and Zolt{\\&#x27;a}n Micskei},\n    title    = {Efficient Strategies for {CEGAR}-based Model Checking},\n    journal  = {Journal of Automated Reasoning},\n    volume   = {64},\n    number   = {6},\n    pages    = {1051--1091},\n    year     = {2020},\n    doi      = {10.1007/s10817-019-09535-x},\n\n    type     = {Journal},\n\n    url_pdf  = {https://link.springer.com/content/pdf/10.1007%2Fs10817-019-09535-x.pdf},\n    url_link = {https://link.springer.com/article/10.1007/s10817-019-09535-x},\n\n    abstract = {Automated formal verification is often based on the Counterexample-Guided Abstraction Refinement (CEGAR) approach. Many variants of CEGAR have been developed over the years as different problem domains usually require different strategies for efficient verification. This has lead to generic and configurable CEGAR frameworks, which can incorporate various algorithms. In our paper we propose six novel improvements to different aspects of the CEGAR approach, including both abstraction and refinement. We implement our new contributions in the Theta framework allowing us to compare them with state-of-the-art algorithms. We conduct an experiment on a diverse set of models to address research questions related to the effectiveness and efficiency of our new strategies. Results show that our new contributions perform well in general. Moreover, we highlight certain cases where performance could not be increased or where a remarkable improvement is achieved.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Automated formal verification is often based on the Counterexample-Guided Abstraction Refinement (CEGAR) approach. Many variants of CEGAR have been developed over the years as different problem domains usually require different strategies for efficient verification. This has lead to generic and configurable CEGAR frameworks, which can incorporate various algorithms. In our paper we propose six novel improvements to different aspects of the CEGAR approach, including both abstraction and refinement. We implement our new contributions in the Theta framework allowing us to compare them with state-of-the-art algorithms. We conduct an experiment on a diverse set of models to address research questions related to the effectiveness and efficiency of our new strategies. Results show that our new contributions perform well in general. Moreover, we highlight certain cases where performance could not be increased or where a remarkable improvement is achieved.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hajdu-jovanovi-smtfriendlyformalizationofthesoliditymemorymodel-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/esop2020.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hajdu-jovanovi-smtfriendlyformalizationofthesoliditymemorymodel-2020', 'https://hajduakos.github.io/publications/esop2020.pdf', event);\">\n    SMT-Friendly Formalization of the Solidity Memory Model.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>;  and Jovanović, D.\n</span>\n\n  \n\n</span>\n\n  In <i>Programming Languages and Systems</i>, volume 12075, of Lecture Notes in Computer Science, pages 224–250. Springer,  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/esop2020.pdf\"\n     onclick=\"log_download('hajdu-jovanovi-smtfriendlyformalizationofthesoliditymemorymodel-2020', 'https://hajduakos.github.io/publications/esop2020.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"SMT-Friendly Formalization of the Solidity Memory Model [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://link.springer.com/chapter/10.1007/978-3-030-44914-8_9\"\n     onclick=\"log_download('hajdu-jovanovi-smtfriendlyformalizationofthesoliditymemorymodel-2020', 'https://link.springer.com/chapter/10.1007/978-3-030-44914-8_9', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"SMT-Friendly Formalization of the Solidity Memory Model [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n  <a href=\"https://hajduakos.github.io/publications/slides/smt2020.pdf\"\n     onclick=\"log_download('hajdu-jovanovi-smtfriendlyformalizationofthesoliditymemorymodel-2020', 'https://hajduakos.github.io/publications/slides/smt2020.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"SMT-Friendly Formalization of the Solidity Memory Model [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n  <a href=\"https://youtu.be/B3ML9vGituk?t=626\"\n     onclick=\"log_download('hajdu-jovanovi-smtfriendlyformalizationofthesoliditymemorymodel-2020', 'https://youtu.be/B3ML9vGituk?t=626', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"SMT-Friendly Formalization of the Solidity Memory Model [link]\"\n       title=\" video\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> video</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-030-44914-8_9\"\n     onclick=\"log_download('hajdu-jovanovi-smtfriendlyformalizationofthesoliditymemorymodel-2020', 'http://doi.org/10.1007/978-3-030-44914-8_9', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hajdu-jovanovi-smtfriendlyformalizationofthesoliditymemorymodel-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hajdu-jovanovi-smtfriendlyformalizationofthesoliditymemorymodel-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@incollection{esop2020,\n    author     = {Hajdu, {\\&#x27;A}kos and Jovanovi{\\&#x27;c}, Dejan},\n    title      = {{SMT}-Friendly Formalization of the {S}olidity Memory Model},\n    year       = {2020},\n    booktitle  = {Programming Languages and Systems},\n    series     = {Lecture Notes in Computer Science},\n    volume     = {12075},\n    pages      = {224--250},\n    publisher  = {Springer},\n    doi        = {10.1007/978-3-030-44914-8_9},\n\n    type       = {Conference},\n\n    url_pdf    = {https://hajduakos.github.io/publications/esop2020.pdf},\n    url_link   = {https://link.springer.com/chapter/10.1007/978-3-030-44914-8_9},\n    url_slides = {https://hajduakos.github.io/publications/slides/smt2020.pdf},\n    url_video  = {https://youtu.be/B3ML9vGituk?t=626},\n    abstract   = {Solidity is the dominant programming language for Ethereum smart contracts. This paper presents a high-level formalization of the Solidity language with a focus on the memory model. The presented formalization covers all features of the language related to managing state and memory. In addition, the formalization we provide is effective: all but few features can be encoded in the quantifier-free fragment of standard SMT theories. This enables precise and efficient reasoning about the state of smart contracts written in Solidity. The formalization is implemented in the solc-verify verifier and we provide an extensive set of tests that covers the breadth of the required semantics. We also provide an evaluation on the test set that validates the semantics and shows the novelty of the approach compared to other Solidity-level contract analysis tools. },\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Solidity is the dominant programming language for Ethereum smart contracts. This paper presents a high-level formalization of the Solidity language with a focus on the memory model. The presented formalization covers all features of the language related to managing state and memory. In addition, the formalization we provide is effective: all but few features can be encoded in the quantifier-free fragment of standard SMT theories. This enables precise and efficient reasoning about the state of smart contracts written in Solidity. The formalization is implemented in the solc-verify verifier and we provide an extensive set of tests that covers the breadth of the required semantics. We also provide an evaluation on the test set that validates the semantics and shows the novelty of the approach compared to other Solidity-level contract analysis tools. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hajdu-jovanovi-ciocarlie-formalspecificationandverificationofsoliditycontractswitheventsshortpaper-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drops.dagstuhl.de/opus/volltexte/2020/13415/pdf/OASIcs-FMBC-2020-2.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hajdu-jovanovi-ciocarlie-formalspecificationandverificationofsoliditycontractswitheventsshortpaper-2020', 'https://drops.dagstuhl.de/opus/volltexte/2020/13415/pdf/OASIcs-FMBC-2020-2.pdf', event);\">\n    Formal Specification and Verification of Solidity Contracts with Events (short paper).\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Jovanović, D.;  and Ciocarlie, G.\n</span>\n\n  \n\n</span>\n\n  In <i>2nd Workshop on Formal Methods for Blockchains</i>, volume 84, of OpenAccess Series in Informatics (OASIcs), pages 2:1–2:9. Schloss Dagstuhl–Leibniz-Zentrum für Informatik,  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drops.dagstuhl.de/opus/volltexte/2020/13415/pdf/OASIcs-FMBC-2020-2.pdf\"\n     onclick=\"log_download('hajdu-jovanovi-ciocarlie-formalspecificationandverificationofsoliditycontractswitheventsshortpaper-2020', 'https://drops.dagstuhl.de/opus/volltexte/2020/13415/pdf/OASIcs-FMBC-2020-2.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Formal Specification and Verification of Solidity Contracts with Events (short paper) [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://drops.dagstuhl.de/opus/volltexte/2020/13415/\"\n     onclick=\"log_download('hajdu-jovanovi-ciocarlie-formalspecificationandverificationofsoliditycontractswitheventsshortpaper-2020', 'https://drops.dagstuhl.de/opus/volltexte/2020/13415/', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Formal Specification and Verification of Solidity Contracts with Events (short paper) [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n  <a href=\"https://hajduakos.github.io/publications/slides/fmbc2020.pdf\"\n     onclick=\"log_download('hajdu-jovanovi-ciocarlie-formalspecificationandverificationofsoliditycontractswitheventsshortpaper-2020', 'https://hajduakos.github.io/publications/slides/fmbc2020.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Formal Specification and Verification of Solidity Contracts with Events (short paper) [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n  <a href=\"https://youtu.be/NNytwVBZ1no\"\n     onclick=\"log_download('hajdu-jovanovi-ciocarlie-formalspecificationandverificationofsoliditycontractswitheventsshortpaper-2020', 'https://youtu.be/NNytwVBZ1no', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Formal Specification and Verification of Solidity Contracts with Events (short paper) [link]\"\n       title=\" video\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> video</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.4230/OASIcs.FMBC.2020.2\"\n     onclick=\"log_download('hajdu-jovanovi-ciocarlie-formalspecificationandverificationofsoliditycontractswitheventsshortpaper-2020', 'http://doi.org/10.4230/OASIcs.FMBC.2020.2', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hajdu-jovanovi-ciocarlie-formalspecificationandverificationofsoliditycontractswitheventsshortpaper-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>10 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hajdu-jovanovi-ciocarlie-formalspecificationandverificationofsoliditycontractswitheventsshortpaper-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@incollection{fmbc2020,\n    author     = {{\\&#x27;A}kos Hajdu and Jovanovi{\\&#x27;c}, Dejan and Ciocarlie, Gabriela},\n    title      = {Formal Specification and Verification of {S}olidity Contracts with Events (short paper)},\n    booktitle  = {2nd Workshop on Formal Methods for Blockchains},\n    series     = {OpenAccess Series in Informatics (OASIcs)},\n    volume     = {84},\n    pages      = {2:1--2:9},\n    publisher  = {Schloss Dagstuhl--Leibniz-Zentrum f{\\&quot;u}r Informatik},\n    year       = {2020},\n    isbn       = {978-3-95977-169-6},\n    issn       = {2190-6807},\n    doi        = {10.4230/OASIcs.FMBC.2020.2},\n\n    type       = {Workshop},\n\n    url_pdf    = {https://drops.dagstuhl.de/opus/volltexte/2020/13415/pdf/OASIcs-FMBC-2020-2.pdf},\n    url_link   = {https://drops.dagstuhl.de/opus/volltexte/2020/13415/},\n    url_slides = {https://hajduakos.github.io/publications/slides/fmbc2020.pdf},\n    url_video  = {https://youtu.be/NNytwVBZ1no},\n    abstract   = {Events in the Solidity language provide a means of communication between the on-chain services of decentralized applications and the users of those services. Events are commonly used as an abstraction of contract execution that is relevant from the users&#x27; perspective. Users must, therefore, be able to understand the meaning and trust the validity of the emitted events. This paper presents a source-level approach for the formal specification and verification of Solidity contracts with the primary focus on events. Our approach allows the specification of events in terms of the on-chain data that they track, and the predicates that define the correspondence between the blockchain state and the abstract view provided by the events. The approach is implemented in solc-verify, a modular verifier for Solidity, and we demonstrate its applicability with various examples.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Events in the Solidity language provide a means of communication between the on-chain services of decentralized applications and the users of those services. Events are commonly used as an abstraction of contract execution that is relevant from the users' perspective. Users must, therefore, be able to understand the meaning and trust the validity of the emitted events. This paper presents a source-level approach for the formal specification and verification of Solidity contracts with the primary focus on events. Our approach allows the specification of events in terms of the on-chain data that they track, and the predicates that define the correspondence between the blockchain state and the abstract view provided by the events. The approach is implemented in solc-verify, a modular verifier for Solidity, and we demonstrate its applicability with various examples.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ciocarlie-eldefrawy-lepoint-navas-hajdu-jovanovi-middlewaretoautomaticallyverifysmartcontractsonblockchains-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.freepatentsonline.com/y2020/0201838.html\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'ciocarlie-eldefrawy-lepoint-navas-hajdu-jovanovi-middlewaretoautomaticallyverifysmartcontractsonblockchains-2020', 'http://www.freepatentsonline.com/y2020/0201838.html', event);\">\n    MIDDLEWARE TO AUTOMATICALLY VERIFY SMART CONTRACTS ON BLOCKCHAINS.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Ciocarlie, G.; Eldefrawy, K.; Lepoint, T.; Navas, J.; <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>;  and Jovanović, D.\n</span>\n\n  \n\n</span>\n\n  June 2020.\n  <span class=\"note\">US Patent App. 16/227,728</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.freepatentsonline.com/y2020/0201838.html\"\n     onclick=\"log_download('ciocarlie-eldefrawy-lepoint-navas-hajdu-jovanovi-middlewaretoautomaticallyverifysmartcontractsonblockchains-2020', 'http://www.freepatentsonline.com/y2020/0201838.html', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"MIDDLEWARE TO AUTOMATICALLY VERIFY SMART CONTRACTS ON BLOCKCHAINS [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ciocarlie-eldefrawy-lepoint-navas-hajdu-jovanovi-middlewaretoautomaticallyverifysmartcontractsonblockchains-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>10 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ciocarlie-eldefrawy-lepoint-navas-hajdu-jovanovi-middlewaretoautomaticallyverifysmartcontractsonblockchains-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@misc{patent2020,\n    title     = {MIDDLEWARE TO AUTOMATICALLY VERIFY SMART CONTRACTS ON BLOCKCHAINS},\n    author    = {Ciocarlie, Gabriela and Eldefrawy, Karim and Lepoint, Tancrede and Navas, Jorge and Hajdu, {\\&#x27;A}kos and Jovanovi{\\&#x27;c}, Dejan},\n    year      = {2020},\n    month     = {June},\n    note      = {US Patent App. 16/227,728},\n\n    type      = {Patent application},\n\n    url_link  = {http://www.freepatentsonline.com/y2020/0201838.html},\n    abstract  = {A method, apparatus and system for automated verification of a smart contract on a blockchain include translating operating properties of a smart contract annotated with contract specifications at a source code level into verification conditions in an intermediate verification language, discharging the verification conditions using an SMT solver, and reporting results of the discharged verification conditions, such as successes and failures of the discharged verification conditions. The translating can include mapping statements of the smart contract to statements of the intermediate verification language and mapping expressions of the smart contract to expressions of the intermediate verification language. }\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  A method, apparatus and system for automated verification of a smart contract on a blockchain include translating operating properties of a smart contract annotated with contract specifications at a source code level into verification conditions in an intermediate verification language, discharging the verification conditions using an SMT solver, and reporting results of the discharged verification conditions, such as successes and failures of the discharged verification conditions. The translating can include mapping statements of the smart contract to statements of the intermediate verification language and mapping expressions of the smart contract to expressions of the intermediate verification language. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"horvth-graics-hajdu-micskei-molnr-rth-andolfato-gomes-etal-modelcheckingasaservicetowardspragmatichiddenformalmethods-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/openmbee2020.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'horvth-graics-hajdu-micskei-molnr-rth-andolfato-gomes-etal-modelcheckingasaservicetowardspragmatichiddenformalmethods-2020', 'https://hajduakos.github.io/publications/openmbee2020.pdf', event);\">\n    Model Checking as a Service: Towards Pragmatic Hidden Formal Methods.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Horváth, B.; <a class=\"bibbase author link\" href=\"https://ftsrg.mit.bme.hu/gamma/publications/\">Graics, B.</a>; <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Micskei, Z.; Molnár, V.; Ráth, I.; Andolfato, L.; Gomes, I.;  and Karban, R.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 23rd ACM/IEEE International Conference on Model Driven Engineering Languages and Systems: Companion Proceedings</i>,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/openmbee2020.pdf\"\n     onclick=\"log_download('horvth-graics-hajdu-micskei-molnr-rth-andolfato-gomes-etal-modelcheckingasaservicetowardspragmatichiddenformalmethods-2020', 'https://hajduakos.github.io/publications/openmbee2020.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Model Checking as a Service: Towards Pragmatic Hidden Formal Methods [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://doi.org/10.1145/3417990.3421407\"\n     onclick=\"log_download('horvth-graics-hajdu-micskei-molnr-rth-andolfato-gomes-etal-modelcheckingasaservicetowardspragmatichiddenformalmethods-2020', 'https://doi.org/10.1145/3417990.3421407', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Model Checking as a Service: Towards Pragmatic Hidden Formal Methods [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1145/3417990.3421407\"\n     onclick=\"log_download('horvth-graics-hajdu-micskei-molnr-rth-andolfato-gomes-etal-modelcheckingasaservicetowardspragmatichiddenformalmethods-2020', 'http://doi.org/10.1145/3417990.3421407', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/horvth-graics-hajdu-micskei-molnr-rth-andolfato-gomes-etal-modelcheckingasaservicetowardspragmatichiddenformalmethods-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>8 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('horvth-graics-hajdu-micskei-molnr-rth-andolfato-gomes-etal-modelcheckingasaservicetowardspragmatichiddenformalmethods-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{openmbee2020,\n    author     = {Benedek Horv{\\&#x27;a}th and Bence Graics and {\\&#x27;A}kos Hajdu and Zolt{\\&#x27;a}n Micskei and Vince Moln{\\&#x27;a}r and Istv{\\&#x27;a}n R{\\&#x27;a}th and Luigi Andolfato and Ivan Gomes and Robert Karban},\n    title      = {Model Checking as a Service: Towards Pragmatic Hidden Formal Methods},\n    booktitle  = {Proceedings of the 23rd ACM/IEEE International Conference on Model Driven Engineering Languages and Systems: Companion Proceedings},\n    articleno  = {37},\n    numpages   = {5},\n    year       = {2020},\n    doi        = {10.1145/3417990.3421407},\n\n    type       = {Workshop},\n\n    url_pdf    = {https://hajduakos.github.io/publications/openmbee2020.pdf},\n    url_link   = {https://doi.org/10.1145/3417990.3421407},\n    abstract   = {Executable models can be used to support all engineering activities in Model-Based Systems Engineering. Testing and simulation of such models can provide early feedback about design choices. However, in today&#x27;s complex systems, failures could arise due to subtle errors that are hard to find without checking all possible execution paths. Formal methods, and especially model checking can uncover such subtle errors, yet their usage in practice is limited due to the specialized expertise and high computing power required. Therefore we created an automated, cloud-based environment that can verify complex reachability properties on SysML State Machines using hidden model checkers. The approach and the prototype is illustrated using an example from the aerospace domain.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Executable models can be used to support all engineering activities in Model-Based Systems Engineering. Testing and simulation of such models can provide early feedback about design choices. However, in today's complex systems, failures could arise due to subtle errors that are hard to find without checking all possible execution paths. Formal methods, and especially model checking can uncover such subtle errors, yet their usage in practice is limited due to the specialized expertise and high computing power required. Therefore we created an automated, cloud-based environment that can verify complex reachability properties on SysML State Machines using hidden model checkers. The approach and the prototype is illustrated using an example from the aerospace domain.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hajdu-ivaki-kocsis-klenik-gnczy-laranjeiro-madeira-pataricza-usingfaultinjectiontoassessblockchainsystemsinpresenceoffaultysmartcontracts-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/2006.11597.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hajdu-ivaki-kocsis-klenik-gnczy-laranjeiro-madeira-pataricza-usingfaultinjectiontoassessblockchainsystemsinpresenceoffaultysmartcontracts-2020', 'https://arxiv.org/abs/2006.11597.pdf', event);\">\n    Using Fault Injection to Assess Blockchain Systems in Presence of Faulty Smart Contracts.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Ivaki, N.; Kocsis, I.; Klenik, A.; Gönczy, L.; Laranjeiro, N.; Madeira, H.;  and Pataricza, A.\n</span>\n\n  \n\n</span>\n\n  <i>IEEE Access</i>, 8: 190760–190783.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/2006.11597.pdf\"\n     onclick=\"log_download('hajdu-ivaki-kocsis-klenik-gnczy-laranjeiro-madeira-pataricza-usingfaultinjectiontoassessblockchainsystemsinpresenceoffaultysmartcontracts-2020', 'https://arxiv.org/abs/2006.11597.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Using Fault Injection to Assess Blockchain Systems in Presence of Faulty Smart Contracts [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://ieeexplore.ieee.org/document/9229414\"\n     onclick=\"log_download('hajdu-ivaki-kocsis-klenik-gnczy-laranjeiro-madeira-pataricza-usingfaultinjectiontoassessblockchainsystemsinpresenceoffaultysmartcontracts-2020', 'https://ieeexplore.ieee.org/document/9229414', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Using Fault Injection to Assess Blockchain Systems in Presence of Faulty Smart Contracts [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ACCESS.2020.3032239\"\n     onclick=\"log_download('hajdu-ivaki-kocsis-klenik-gnczy-laranjeiro-madeira-pataricza-usingfaultinjectiontoassessblockchainsystemsinpresenceoffaultysmartcontracts-2020', 'http://doi.org/10.1109/ACCESS.2020.3032239', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hajdu-ivaki-kocsis-klenik-gnczy-laranjeiro-madeira-pataricza-usingfaultinjectiontoassessblockchainsystemsinpresenceoffaultysmartcontracts-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hajdu-ivaki-kocsis-klenik-gnczy-laranjeiro-madeira-pataricza-usingfaultinjectiontoassessblockchainsystemsinpresenceoffaultysmartcontracts-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{access2020,\n    author     = {{\\&#x27;A}kos Hajdu and Naghmeh Ivaki and Imre Kocsis and Attila Klenik and L{\\&#x27;a}szl{\\&#x27;o} G{\\&quot;o}nczy and Nuno Laranjeiro and Henrique Madeira and Andr{\\&#x27;a}s Pataricza},\n    title      = {Using Fault Injection to Assess Blockchain Systems in Presence of Faulty Smart Contracts},\n    journal    = {IEEE Access},\n    year       = {2020},\n    volume     = {8},\n    pages      = {190760--190783},\n    doi        = {10.1109/ACCESS.2020.3032239},\n\n    type       = {Journal},\n\n    url_pdf    = {https://arxiv.org/abs/2006.11597.pdf},\n    url_link   = {https://ieeexplore.ieee.org/document/9229414},\n    abstract   = {Blockchain has become particularly popular due to its promise to support businesscritical services in very different domains (e.g., retail, healthcare). Blockchain systems rely on complex middleware, like Ethereum or Hyperledger Fabric, that allow running smart contracts, which specify business logic in cooperative applications. The presence of software defects in these contracts has notably caused failures, including severe security problems. In this paper, we use software-implemented fault injection (SWIFI) to assess the behavior of permissioned blockchain systems in the presence of faulty smart contracts. We emulate the occurrence of general software faults and also blockchain-specific software faults (e.g., missing require on transaction sender) in smart contracts code and observe the impact on the overall system dependability in terms of reliability and integrity. We also analyze the effectiveness of formal verification and runtime protection mechanisms in detecting the injected faults. Results indicate that formal verification and runtime protections have to complement built-in platform checks to guarantee proper dependability of blockchain systems. The work presented in this paper allows smart contract developers to become aware of possible faults in smart contracts and to understand the impact of their presence. It also provides valuable information for middleware developers to improve the overall fault tolerance of their systems.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Blockchain has become particularly popular due to its promise to support businesscritical services in very different domains (e.g., retail, healthcare). Blockchain systems rely on complex middleware, like Ethereum or Hyperledger Fabric, that allow running smart contracts, which specify business logic in cooperative applications. The presence of software defects in these contracts has notably caused failures, including severe security problems. In this paper, we use software-implemented fault injection (SWIFI) to assess the behavior of permissioned blockchain systems in the presence of faulty smart contracts. We emulate the occurrence of general software faults and also blockchain-specific software faults (e.g., missing require on transaction sender) in smart contracts code and observe the impact on the overall system dependability in terms of reliability and integrity. We also analyze the effectiveness of formal verification and runtime protection mechanisms in detecting the injected faults. Results indicate that formal verification and runtime protections have to complement built-in platform checks to guarantee proper dependability of blockchain systems. The work presented in this paper allows smart contract developers to become aware of possible faults in smart contracts and to understand the impact of their presence. It also provides valuable information for middleware developers to improve the overall fault tolerance of their systems.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2019\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2019')\"\n      onkeypress=\"toggleGroup('group_2019')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2019</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"bajkai-hajdu-softwaremodelcheckingwithacombinationofexplicitvaluesandpredicates-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/minisy2019.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bajkai-hajdu-softwaremodelcheckingwithacombinationofexplicitvaluesandpredicates-2019', 'https://hajduakos.github.io/publications/minisy2019.pdf', event);\">\n    Software Model Checking with a Combination of Explicit Values and Predicates.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bajkai, V. D.;  and <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 26th PhD Mini-Symposium</i>, pages 4–7,  2019. Budapest University of Technology and Economics, Department of Measurement and Information Systems\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/minisy2019.pdf\"\n     onclick=\"log_download('bajkai-hajdu-softwaremodelcheckingwithacombinationofexplicitvaluesandpredicates-2019', 'https://hajduakos.github.io/publications/minisy2019.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Software Model Checking with a Combination of Explicit Values and Predicates [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"http://doi.org/10.5281/zenodo.2597969\"\n     onclick=\"log_download('bajkai-hajdu-softwaremodelcheckingwithacombinationofexplicitvaluesandpredicates-2019', 'http://doi.org/10.5281/zenodo.2597969', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Software Model Checking with a Combination of Explicit Values and Predicates [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.5281/zenodo.2597969\"\n     onclick=\"log_download('bajkai-hajdu-softwaremodelcheckingwithacombinationofexplicitvaluesandpredicates-2019', 'http://doi.org/10.5281/zenodo.2597969', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bajkai-hajdu-softwaremodelcheckingwithacombinationofexplicitvaluesandpredicates-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bajkai-hajdu-softwaremodelcheckingwithacombinationofexplicitvaluesandpredicates-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{minisy2019,\n    author     = {Bajkai, Vikt{\\&#x27;o}ria Dorina and Hajdu, {\\&#x27;A}kos},\n    title      = {Software Model Checking with a Combination of Explicit Values and Predicates},\n    year       = {2019},\n    booktitle  = {Proceedings of the 26th PhD Mini-Symposium},\n    location   = {Budapest, Hungary},\n    publisher  = {Budapest University of Technology and Economics, Department of Measurement and Information Systems},\n    pages      = {4--7},\n    isbn       = {978-963-313-314-9},\n    doi        = {10.5281/zenodo.2597969},\n\n    type       = {Local event},\n\n    url_pdf    = {https://hajduakos.github.io/publications/minisy2019.pdf},\n    url_link   = {http://doi.org/10.5281/zenodo.2597969},\n\n    abstract   = {Formal verification techniques can both reveal bugs or prove their absence in programs with a sound mathematical basis. However, their high computational complexity often prevents their application on real-world software. Counterexample-guided abstraction refinement (CEGAR) aims to improve efficiency by automatically constructing and refining abstractions for the program. There are several existing abstract domains, such as explicit-values and predicates, but different abstract domains are suitable for different kinds of software. Therefore, product domains have also emerged, which combine different kinds of abstractions in a single algorithm. In this paper, we present a new variant of the CEGAR algorithm, which is a combination of explicit-value analysis and predicate abstraction. We perform an experiment with a wide range of software systems and we compare the results to the existing methods. Measurements show that our new algorithm can efficiently combine the advantages of the different domains.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Formal verification techniques can both reveal bugs or prove their absence in programs with a sound mathematical basis. However, their high computational complexity often prevents their application on real-world software. Counterexample-guided abstraction refinement (CEGAR) aims to improve efficiency by automatically constructing and refining abstractions for the program. There are several existing abstract domains, such as explicit-values and predicates, but different abstract domains are suitable for different kinds of software. Therefore, product domains have also emerged, which combine different kinds of abstractions in a single algorithm. In this paper, we present a new variant of the CEGAR algorithm, which is a combination of explicit-value analysis and predicate abstraction. We perform an experiment with a wide range of software systems and we compare the results to the existing methods. Measurements show that our new algorithm can efficiently combine the advantages of the different domains.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2018\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2018')\"\n      onkeypress=\"toggleGroup('group_2018')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2018</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"vrs-darvas-hajdu-klenik-marussy-molnr-bartha-majzik-industrialapplicationsofthepetridotnetmodellingandanalysistool-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/scp2017.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'vrs-darvas-hajdu-klenik-marussy-molnr-bartha-majzik-industrialapplicationsofthepetridotnetmodellingandanalysistool-2018', 'https://hajduakos.github.io/publications/scp2017.pdf', event);\">\n    Industrial Applications of the PetriDotNet Modelling and Analysis Tool.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Vörös, A.; Darvas, D.; <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Klenik, A.; Marussy, K.; Molnár, V.; Bartha, T.;  and Majzik, I.\n</span>\n\n  \n\n</span>\n\n  <i>Science of Computer Programming</i>, 157: 17–40.  2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/scp2017.pdf\"\n     onclick=\"log_download('vrs-darvas-hajdu-klenik-marussy-molnr-bartha-majzik-industrialapplicationsofthepetridotnetmodellingandanalysistool-2018', 'https://hajduakos.github.io/publications/scp2017.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Industrial Applications of the PetriDotNet Modelling and Analysis Tool [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S0167642317301910\"\n     onclick=\"log_download('vrs-darvas-hajdu-klenik-marussy-molnr-bartha-majzik-industrialapplicationsofthepetridotnetmodellingandanalysistool-2018', 'http://www.sciencedirect.com/science/article/pii/S0167642317301910', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Industrial Applications of the PetriDotNet Modelling and Analysis Tool [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.scico.2017.09.003\"\n     onclick=\"log_download('vrs-darvas-hajdu-klenik-marussy-molnr-bartha-majzik-industrialapplicationsofthepetridotnetmodellingandanalysistool-2018', 'http://doi.org/10.1016/j.scico.2017.09.003', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/vrs-darvas-hajdu-klenik-marussy-molnr-bartha-majzik-industrialapplicationsofthepetridotnetmodellingandanalysistool-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('vrs-darvas-hajdu-klenik-marussy-molnr-bartha-majzik-industrialapplicationsofthepetridotnetmodellingandanalysistool-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{scp2017,\n    author   = {Andr{\\&#x27;a}s V\\&quot;{o}r\\&quot;{o}s and D{\\&#x27;a}niel Darvas and {\\&#x27;A}kos Hajdu and Attila Klenik and Krist{\\&#x27;o}f Marussy and Vince Moln{\\&#x27;a}r and Tam{\\&#x27;a}s Bartha and Istv{\\&#x27;a}n Majzik},\n    title    = {Industrial Applications of the {P}etri{D}ot{N}et Modelling and Analysis Tool},\n    year     = {2018},\n    journal  = {Science of Computer Programming},\n    volume   = {157},\n    pages    = {17--40},\n    issn     = {0167-6423},\n    doi      = {10.1016/j.scico.2017.09.003},\n\n    type     = {Journal},\n\n    url_pdf  = {https://hajduakos.github.io/publications/scp2017.pdf},\n    url_link = {http://www.sciencedirect.com/science/article/pii/S0167642317301910},\n\n    abstract = {Since their invention, Petri nets have provided modelling and analysis methods to support the design of correct, reliable and robust systems. This motivated our work to develop PetriDotNet, a Petri net editor and analysis tool. In this paper we overview the supported modelling formalisms and the analysis methods included in PetriDotNet. Next, we present eight different industrial case studies, demonstrating the wide variety of scenarios where Petri nets and PetriDotNet can help the design, development and analysis of industrial systems. Our original goal with PetriDotNet was to provide an educational tool to our students, however our efforts led to a framework being able to serve both academic and industrial needs.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Since their invention, Petri nets have provided modelling and analysis methods to support the design of correct, reliable and robust systems. This motivated our work to develop PetriDotNet, a Petri net editor and analysis tool. In this paper we overview the supported modelling formalisms and the analysis methods included in PetriDotNet. Next, we present eight different industrial case studies, demonstrating the wide variety of scenarios where Petri nets and PetriDotNet can help the design, development and analysis of industrial systems. Our original goal with PetriDotNet was to provide an educational tool to our students, however our efforts led to a framework being able to serve both academic and industrial needs.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hajdu-micskei-apreliminaryanalysisontheeffectofrandomnessinacegarframework-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/minisy2018.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hajdu-micskei-apreliminaryanalysisontheeffectofrandomnessinacegarframework-2018', 'https://hajduakos.github.io/publications/minisy2018.pdf', event);\">\n    A Preliminary Analysis on the Effect of Randomness in a CEGAR Framework.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>;  and Micskei, Z.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 25th PhD Mini-Symposium</i>, pages 32–35,  2018. Budapest University of Technology and Economics, Department of Measurement and Information Systems\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/minisy2018.pdf\"\n     onclick=\"log_download('hajdu-micskei-apreliminaryanalysisontheeffectofrandomnessinacegarframework-2018', 'https://hajduakos.github.io/publications/minisy2018.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A Preliminary Analysis on the Effect of Randomness in a CEGAR Framework [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://doi.org/10.5281/zenodo.1219261\"\n     onclick=\"log_download('hajdu-micskei-apreliminaryanalysisontheeffectofrandomnessinacegarframework-2018', 'https://doi.org/10.5281/zenodo.1219261', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"A Preliminary Analysis on the Effect of Randomness in a CEGAR Framework [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n  <a href=\"https://hajduakos.github.io/publications/slides/minisy2018.pdf\"\n     onclick=\"log_download('hajdu-micskei-apreliminaryanalysisontheeffectofrandomnessinacegarframework-2018', 'https://hajduakos.github.io/publications/slides/minisy2018.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A Preliminary Analysis on the Effect of Randomness in a CEGAR Framework [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.5281/zenodo.1219261\"\n     onclick=\"log_download('hajdu-micskei-apreliminaryanalysisontheeffectofrandomnessinacegarframework-2018', 'http://doi.org/10.5281/zenodo.1219261', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hajdu-micskei-apreliminaryanalysisontheeffectofrandomnessinacegarframework-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hajdu-micskei-apreliminaryanalysisontheeffectofrandomnessinacegarframework-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{minisy2018,\n    author     = {Hajdu, {\\&#x27;A}kos and Micskei, Zolt{\\&#x27;a}n},\n    title      = {A Preliminary Analysis on the Effect of Randomness in a {CEGAR} Framework},\n    year       = {2018},\n    booktitle  = {Proceedings of the 25th PhD Mini-Symposium},\n    location   = {Budapest, Hungary},\n    publisher  = {Budapest University of Technology and Economics, Department of Measurement and Information Systems},\n    pages      = {32--35},\n    doi        = {10.5281/zenodo.1219261},\n    isbn       = {978-963-313-285-2},\n\n    type       = {Local event},\n\n    url_pdf    = {https://hajduakos.github.io/publications/minisy2018.pdf},\n    url_link   = {https://doi.org/10.5281/zenodo.1219261},\n    url_slides = {https://hajduakos.github.io/publications/slides/minisy2018.pdf},\n\n    abstract   = {Formal verification techniques can check the correctness of systems in a mathematically precise way. Counterexample-Guided Abstraction Refinement (CEGAR) is an automatic algorithm that reduces the complexity of systems by constructing and refining abstractions. CEGAR is a generic approach, having many variants and strategies developed over the years. However, as the variants become more and more advanced, one may not be sure whether the performance of a strategy can be attributed to the strategy itself or to other, unintentional factors. In this paper we perform an experiment by evaluating the performance of different strategies while randomizing certain external factors such as the search strategy and variable naming. We show that randomization introduces a great variation in the output metrics, and that in several cases this might even influence whether the algorithm successfully terminates.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Formal verification techniques can check the correctness of systems in a mathematically precise way. Counterexample-Guided Abstraction Refinement (CEGAR) is an automatic algorithm that reduces the complexity of systems by constructing and refining abstractions. CEGAR is a generic approach, having many variants and strategies developed over the years. However, as the variants become more and more advanced, one may not be sure whether the performance of a strategy can be attributed to the strategy itself or to other, unintentional factors. In this paper we perform an experiment by evaluating the performance of different strategies while randomizing certain external factors such as the search strategy and variable naming. We show that randomization introduces a great variation in the output metrics, and that in several cases this might even influence whether the algorithm successfully terminates.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"farkas-tth-hajdu-vrs-backwardreachabilityanalysisfortimedautomatawithdatavariables-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/avocs2018.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'farkas-tth-hajdu-vrs-backwardreachabilityanalysisfortimedautomatawithdatavariables-2018', 'https://hajduakos.github.io/publications/avocs2018.pdf', event);\">\n    Backward reachability analysis for timed automata with data variables.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Farkas, R.; Tóth, T.; <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>;  and Vörös, A.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 18th International Workshop on Automated Verification of Critical Systems</i>, volume 76, of Electronic Communications of the EASST, pages 1–20. EASST,  2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/avocs2018.pdf\"\n     onclick=\"log_download('farkas-tth-hajdu-vrs-backwardreachabilityanalysisfortimedautomatawithdatavariables-2018', 'https://hajduakos.github.io/publications/avocs2018.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Backward reachability analysis for timed automata with data variables [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://journal.ub.tu-berlin.de/eceasst/article/view/1076\"\n     onclick=\"log_download('farkas-tth-hajdu-vrs-backwardreachabilityanalysisfortimedautomatawithdatavariables-2018', 'https://journal.ub.tu-berlin.de/eceasst/article/view/1076', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Backward reachability analysis for timed automata with data variables [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.14279/tuj.eceasst.76.1076\"\n     onclick=\"log_download('farkas-tth-hajdu-vrs-backwardreachabilityanalysisfortimedautomatawithdatavariables-2018', 'http://doi.org/10.14279/tuj.eceasst.76.1076', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/farkas-tth-hajdu-vrs-backwardreachabilityanalysisfortimedautomatawithdatavariables-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('farkas-tth-hajdu-vrs-backwardreachabilityanalysisfortimedautomatawithdatavariables-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@incollection{avocs2018,\n    author     = {Farkas, Rebeka and T{\\&#x27;o}th, Tam{\\&#x27;a}s and Hajdu, {\\&#x27;A}kos and V{\\&quot;o}r{\\&quot;o}s, Andr{\\&#x27;a}s},\n    title      = {Backward reachability analysis for timed automata with data variables},\n    year       = {2018},\n    booktitle  = {Proceedings of the 18th International Workshop on Automated Verification of Critical Systems},\n    series     = {Electronic Communications of the EASST},\n    issn       = {1863-2122},\n    volume     = {76},\n    publisher  = {EASST},\n    pages      = {1--20},\n    doi        = {10.14279/tuj.eceasst.76.1076},\n\n    type       = {Workshop},\n\n    url_pdf    = {https://hajduakos.github.io/publications/avocs2018.pdf},\n    url_link   = {https://journal.ub.tu-berlin.de/eceasst/article/view/1076},\n\n    abstract   = {Efficient techniques for reachability analysis of timed automata are zone-based methods that explore the reachable state space from the initial state, and SMT-based methods that perform backward search from the target states. It is also possible to perform backward exploration based on zones, but calculating predecessor states for systems with data variables is computationally expensive, prohibiting the successful application of this approach so far. In this paper we overcome this limitation by combining zone-based backward exploration with the weakest precondition operation for data variables. This combination allows us to handle diagonal constraints efficiently as opposed to zone-based forward search where most approaches require additional operations to ensure correctness. We demonstrate the applicability and compare the efficiency of the algorithm to existing forward exploration approaches by measurements performed on industrial case studies. Although the large number of states often prevents successful verification, we show that data variables can be efficienlty handled by the weakest precondition operation. This way our new approach complements existing techniques.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Efficient techniques for reachability analysis of timed automata are zone-based methods that explore the reachable state space from the initial state, and SMT-based methods that perform backward search from the target states. It is also possible to perform backward exploration based on zones, but calculating predecessor states for systems with data variables is computationally expensive, prohibiting the successful application of this approach so far. In this paper we overcome this limitation by combining zone-based backward exploration with the weakest precondition operation for data variables. This combination allows us to handle diagonal constraints efficiently as opposed to zone-based forward search where most approaches require additional operations to ensure correctness. We demonstrate the applicability and compare the efficiency of the algorithm to existing forward exploration approaches by measurements performed on industrial case studies. Although the large number of states often prevents successful verification, we show that data variables can be efficienlty handled by the weakest precondition operation. This way our new approach complements existing techniques.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2017\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2017')\"\n      onkeypress=\"toggleGroup('group_2017')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2017</span>\n      <span class=\"bibbase_group_count\">\n        \n        (5)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"hajdu-micskei-exploratoryanalysisoftheperformanceofaconfigurablecegarframework-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/minisy2017.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hajdu-micskei-exploratoryanalysisoftheperformanceofaconfigurablecegarframework-2017', 'https://hajduakos.github.io/publications/minisy2017.pdf', event);\">\n    Exploratory Analysis of the Performance of a Configurable CEGAR Framework.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>;  and Micskei, Z.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 24th PhD Mini-Symposium</i>, pages 34–37,  2017. Budapest University of Technology and Economics, Department of Measurement and Information Systems\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/minisy2017.pdf\"\n     onclick=\"log_download('hajdu-micskei-exploratoryanalysisoftheperformanceofaconfigurablecegarframework-2017', 'https://hajduakos.github.io/publications/minisy2017.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Exploratory Analysis of the Performance of a Configurable CEGAR Framework [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://doi.org/10.5281/zenodo.291895\"\n     onclick=\"log_download('hajdu-micskei-exploratoryanalysisoftheperformanceofaconfigurablecegarframework-2017', 'https://doi.org/10.5281/zenodo.291895', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Exploratory Analysis of the Performance of a Configurable CEGAR Framework [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n  <a href=\"https://hajduakos.github.io/publications/slides/minisy2017.pdf\"\n     onclick=\"log_download('hajdu-micskei-exploratoryanalysisoftheperformanceofaconfigurablecegarframework-2017', 'https://hajduakos.github.io/publications/slides/minisy2017.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Exploratory Analysis of the Performance of a Configurable CEGAR Framework [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.5281/zenodo.291895\"\n     onclick=\"log_download('hajdu-micskei-exploratoryanalysisoftheperformanceofaconfigurablecegarframework-2017', 'http://doi.org/10.5281/zenodo.291895', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hajdu-micskei-exploratoryanalysisoftheperformanceofaconfigurablecegarframework-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hajdu-micskei-exploratoryanalysisoftheperformanceofaconfigurablecegarframework-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{minisy2017,\n    author     = {Hajdu, {\\&#x27;A}kos and Micskei, Zolt{\\&#x27;a}n},\n    title      = {Exploratory Analysis of the Performance of a Configurable {CEGAR} Framework},\n    year       = {2017},\n    booktitle  = {Proceedings of the 24th PhD Mini-Symposium},\n    location   = {Budapest, Hungary},\n    publisher  = {Budapest University of Technology and Economics, Department of Measurement and Information Systems},\n    pages      = {34--37},\n    doi        = {10.5281/zenodo.291895},\n    isbn       = {978-963-313-243-2},\n\n    type       = {Local event},\n\n    url_pdf    = {https://hajduakos.github.io/publications/minisy2017.pdf},\n    url_link   = {https://doi.org/10.5281/zenodo.291895},\n    url_slides = {https://hajduakos.github.io/publications/slides/minisy2017.pdf},\n\n    abstract   = {Formal verification techniques can check the correctness of systems in a mathematically precise way. However, their computational complexity often prevents their successful application. The counterexample-guided abstraction refinement (CEGAR) algorithm aims to overcome this problem by automatically building abstractions for the system to reduce its complexity. Previously, we developed a generic CEGAR framework, which incorporates many configurations of the algorithm. In this paper we focus on an exploratory analysis of our framework. We identify parameters of the systems and algorithm configurations, overview some possible analysis methods and present preliminary results. We show that different variants are more efficient for certain tasks and we also describe how the properties of the system and parameters of the algorithm affect the success of verification.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Formal verification techniques can check the correctness of systems in a mathematically precise way. However, their computational complexity often prevents their successful application. The counterexample-guided abstraction refinement (CEGAR) algorithm aims to overcome this problem by automatically building abstractions for the system to reduce its complexity. Previously, we developed a generic CEGAR framework, which incorporates many configurations of the algorithm. In this paper we focus on an exploratory analysis of our framework. We identify parameters of the systems and algorithm configurations, overview some possible analysis methods and present preliminary results. We show that different variants are more efficient for certain tasks and we also describe how the properties of the system and parameters of the algorithm affect the success of verification.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"farkas-hajdu-activitybasedabstractionrefinementfortimedsystems-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/minisy2017fr.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'farkas-hajdu-activitybasedabstractionrefinementfortimedsystems-2017', 'https://hajduakos.github.io/publications/minisy2017fr.pdf', event);\">\n    Activity-Based Abstraction Refinement for Timed Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Farkas, R.;  and <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 24th PhD Mini-Symposium</i>, pages 18–21,  2017. Budapest University of Technology and Economics, Department of Measurement and Information Systems\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/minisy2017fr.pdf\"\n     onclick=\"log_download('farkas-hajdu-activitybasedabstractionrefinementfortimedsystems-2017', 'https://hajduakos.github.io/publications/minisy2017fr.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Activity-Based Abstraction Refinement for Timed Systems [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://doi.org/10.5281/zenodo.291891\"\n     onclick=\"log_download('farkas-hajdu-activitybasedabstractionrefinementfortimedsystems-2017', 'https://doi.org/10.5281/zenodo.291891', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Activity-Based Abstraction Refinement for Timed Systems [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.5281/zenodo.291891\"\n     onclick=\"log_download('farkas-hajdu-activitybasedabstractionrefinementfortimedsystems-2017', 'http://doi.org/10.5281/zenodo.291891', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/farkas-hajdu-activitybasedabstractionrefinementfortimedsystems-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('farkas-hajdu-activitybasedabstractionrefinementfortimedsystems-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{minisy2017fr,\n    author     = {Farkas, Rebeka and Hajdu, {\\&#x27;A}kos},\n    title      = {Activity-Based Abstraction Refinement for Timed Systems},\n    year       = {2017},\n    booktitle  = {Proceedings of the 24th PhD Mini-Symposium},\n    location   = {Budapest, Hungary},\n    publisher  = {Budapest University of Technology and Economics, Department of Measurement and Information Systems},\n    pages      = {18--21},\n    doi        = {10.5281/zenodo.291891},\n    isbn       = {978-963-313-243-2},\n\n    type       = {Local event},\n\n    url_pdf    = {https://hajduakos.github.io/publications/minisy2017fr.pdf},\n    url_link   = {https://doi.org/10.5281/zenodo.291891},\n\n    abstract   = {Formal analysis of real time systems is important as they are widely used in safety critical domains. Such systems combine discrete behaviours represented by control states and timed behaviours represented by clock variables. The counterexample-guided abstraction refinement (CEGAR) algorithm utilizes the fundamental technique of abstraction to system verification. We propose a CEGAR-based algorithm for reachability analysis of timed systems. The algorithm is specialized to handle the time related behaviours efficiently by introducing a refinement technique tailored specially to clock variables. The performance of the presented algorithm is demonstrated by runtime measurements on models commonly used for benchmarking such algorithms.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Formal analysis of real time systems is important as they are widely used in safety critical domains. Such systems combine discrete behaviours represented by control states and timed behaviours represented by clock variables. The counterexample-guided abstraction refinement (CEGAR) algorithm utilizes the fundamental technique of abstraction to system verification. We propose a CEGAR-based algorithm for reachability analysis of timed systems. The algorithm is specialized to handle the time related behaviours efficiently by introducing a refinement technique tailored specially to clock variables. The performance of the presented algorithm is demonstrated by runtime measurements on models commonly used for benchmarking such algorithms.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"czip-hajdu-tth-majzik-exploitinghierarchyintheabstractionbasedverificationofstatechartsusingsmtsolvers-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/fesca2017.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'czip-hajdu-tth-majzik-exploitinghierarchyintheabstractionbasedverificationofstatechartsusingsmtsolvers-2017', 'https://hajduakos.github.io/publications/fesca2017.pdf', event);\">\n    Exploiting Hierarchy in the Abstraction-Based Verification of Statecharts Using SMT Solvers.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Czipó, B.; <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Tóth, T.;  and Majzik, I.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 14th International Workshop on Formal Engineering Approaches to Software Components and Architectures</i>, volume 245, of Electronic Proceedings in Theoretical Computer Science, pages 31–45. Open Publishing Association,  2017.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/fesca2017.pdf\"\n     onclick=\"log_download('czip-hajdu-tth-majzik-exploitinghierarchyintheabstractionbasedverificationofstatechartsusingsmtsolvers-2017', 'https://hajduakos.github.io/publications/fesca2017.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Exploiting Hierarchy in the Abstraction-Based Verification of Statecharts Using SMT Solvers [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"http://eptcs.web.cse.unsw.edu.au/paper.cgi?FESCA2017.3\"\n     onclick=\"log_download('czip-hajdu-tth-majzik-exploitinghierarchyintheabstractionbasedverificationofstatechartsusingsmtsolvers-2017', 'http://eptcs.web.cse.unsw.edu.au/paper.cgi?FESCA2017.3', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Exploiting Hierarchy in the Abstraction-Based Verification of Statecharts Using SMT Solvers [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n  <a href=\"https://hajduakos.github.io/publications/slides/fesca2017.pdf\"\n     onclick=\"log_download('czip-hajdu-tth-majzik-exploitinghierarchyintheabstractionbasedverificationofstatechartsusingsmtsolvers-2017', 'https://hajduakos.github.io/publications/slides/fesca2017.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Exploiting Hierarchy in the Abstraction-Based Verification of Statecharts Using SMT Solvers [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.4204/EPTCS.245.3\"\n     onclick=\"log_download('czip-hajdu-tth-majzik-exploitinghierarchyintheabstractionbasedverificationofstatechartsusingsmtsolvers-2017', 'http://doi.org/10.4204/EPTCS.245.3', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/czip-hajdu-tth-majzik-exploitinghierarchyintheabstractionbasedverificationofstatechartsusingsmtsolvers-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('czip-hajdu-tth-majzik-exploitinghierarchyintheabstractionbasedverificationofstatechartsusingsmtsolvers-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@incollection{fesca2017,\n    author     = {Czip{\\&#x27;o}, Bence and Hajdu, {\\&#x27;A}kos and T{\\&#x27;o}th, Tam{\\&#x27;a}s and Majzik, Istv{\\&#x27;a}n},\n    year       = {2017},\n    title      = {Exploiting Hierarchy in the Abstraction-Based Verification of Statecharts Using {SMT} Solvers},\n    booktitle  = {Proceedings of the 14th International Workshop on Formal Engineering Approaches to Software Components and Architectures},\n    series     = {Electronic Proceedings in Theoretical Computer Science},\n    volume     = {245},\n    publisher  = {Open Publishing Association},\n    pages      = {31--45},\n    doi        = {10.4204/EPTCS.245.3},\n\n    type       = {Workshop},\n\n    url_pdf    = {https://hajduakos.github.io/publications/fesca2017.pdf},\n    url_link   = {http://eptcs.web.cse.unsw.edu.au/paper.cgi?FESCA2017.3},\n    url_slides = {https://hajduakos.github.io/publications/slides/fesca2017.pdf},\n\n    abstract   = {Statecharts are frequently used as a modeling formalism in the design of state-based systems. Formal verification techniques are also often applied to prove certain properties about the behavior of the system. One of the most efficient techniques for formal verification is Counterexample-Guided Abstraction Refinement (CEGAR), which reduces the complexity of systems by automatically building and refining abstractions. In our paper we present a novel adaptation of the CEGAR approach to hierarchical statechart models. First we introduce an encoding of the statechart to logical formulas that preserves information about the state hierarchy. Based on this encoding we propose abstraction and refinement techniques that utilize the hierarchical structure of statecharts and also handle variables in the model. The encoding allows us to use SMT solvers for the systematic exploration and verification of the abstract model, including also bounded model checking. We demonstrate the applicability and efficiency of our abstraction techniques with measurements on an industry-motivated example.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Statecharts are frequently used as a modeling formalism in the design of state-based systems. Formal verification techniques are also often applied to prove certain properties about the behavior of the system. One of the most efficient techniques for formal verification is Counterexample-Guided Abstraction Refinement (CEGAR), which reduces the complexity of systems by automatically building and refining abstractions. In our paper we present a novel adaptation of the CEGAR approach to hierarchical statechart models. First we introduce an encoding of the statechart to logical formulas that preserves information about the state hierarchy. Based on this encoding we propose abstraction and refinement techniques that utilize the hierarchical structure of statecharts and also handle variables in the model. The encoding allows us to use SMT solvers for the systematic exploration and verification of the abstract model, including also bounded model checking. We demonstrate the applicability and efficiency of our abstraction techniques with measurements on an industry-motivated example.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sallai-hajdu-tth-micskei-towardsevaluatingsizereductiontechniquesforsoftwaremodelchecking-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/vpt2017.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'sallai-hajdu-tth-micskei-towardsevaluatingsizereductiontechniquesforsoftwaremodelchecking-2017', 'https://hajduakos.github.io/publications/vpt2017.pdf', event);\">\n    Towards Evaluating Size Reduction Techniques for Software Model Checking.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Sallai, G.; <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Tóth, T.;  and Micskei, Z.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the Fifth International Workshop on Verification and Program Transformation</i>, volume 253, of Electronic Proceedings in Theoretical Computer Science, pages 75–91. Open Publishing Association,  2017.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/vpt2017.pdf\"\n     onclick=\"log_download('sallai-hajdu-tth-micskei-towardsevaluatingsizereductiontechniquesforsoftwaremodelchecking-2017', 'https://hajduakos.github.io/publications/vpt2017.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Towards Evaluating Size Reduction Techniques for Software Model Checking [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"http://eptcs.web.cse.unsw.edu.au/paper.cgi?VPT2017.7\"\n     onclick=\"log_download('sallai-hajdu-tth-micskei-towardsevaluatingsizereductiontechniquesforsoftwaremodelchecking-2017', 'http://eptcs.web.cse.unsw.edu.au/paper.cgi?VPT2017.7', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Towards Evaluating Size Reduction Techniques for Software Model Checking [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n  <a href=\"https://hajduakos.github.io/publications/slides/vpt2017.pdf\"\n     onclick=\"log_download('sallai-hajdu-tth-micskei-towardsevaluatingsizereductiontechniquesforsoftwaremodelchecking-2017', 'https://hajduakos.github.io/publications/slides/vpt2017.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Towards Evaluating Size Reduction Techniques for Software Model Checking [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.4204/EPTCS.253.7\"\n     onclick=\"log_download('sallai-hajdu-tth-micskei-towardsevaluatingsizereductiontechniquesforsoftwaremodelchecking-2017', 'http://doi.org/10.4204/EPTCS.253.7', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sallai-hajdu-tth-micskei-towardsevaluatingsizereductiontechniquesforsoftwaremodelchecking-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sallai-hajdu-tth-micskei-towardsevaluatingsizereductiontechniquesforsoftwaremodelchecking-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@incollection{vpt2017,\n    author     = {Sallai, Gyula and Hajdu, {\\&#x27;A}kos and T{\\&#x27;o}th, Tam{\\&#x27;a}s and Micskei, Zolt{\\&#x27;a}n},\n    year       = {2017},\n    title      = {Towards Evaluating Size Reduction Techniques for Software Model Checking},\n    booktitle  = {Proceedings of the Fifth International Workshop on Verification and Program Transformation},\n    series     = {Electronic Proceedings in Theoretical Computer Science},\n    volume     = {253},\n    publisher  = {Open Publishing Association},\n    pages      = {75--91},\n    doi        = {10.4204/EPTCS.253.7},\n\n    type       = {Workshop},\n\n    url_pdf    = {https://hajduakos.github.io/publications/vpt2017.pdf},\n    url_link   = {http://eptcs.web.cse.unsw.edu.au/paper.cgi?VPT2017.7},\n    url_slides = {https://hajduakos.github.io/publications/slides/vpt2017.pdf},\n\n    abstract   = {Formal verification techniques are widely used for detecting design flaws in software systems. Formal verification can be done by transforming an already implemented source code to a formal model and attempting to prove certain properties of the model (e.g. that no erroneous state can occur during execution). Unfortunately, transformations from source code to a formal model often yield large and complex models, making the verification process inefficient and costly. In order to reduce the size of the resulting model, optimization transformations can be used. Such optimizations include common algorithms known from compiler design and different program slicing techniques. Our paper describes a framework for transforming C programs to a formal model, enhanced by various optimizations for size reduction. We evaluate and compare several optimization algorithms regarding their effect on the size of the model and the efficiency of the verification. Results show that different optimizations are more suitable for certain models, justifying the need for a framework that includes several algorithms.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Formal verification techniques are widely used for detecting design flaws in software systems. Formal verification can be done by transforming an already implemented source code to a formal model and attempting to prove certain properties of the model (e.g. that no erroneous state can occur during execution). Unfortunately, transformations from source code to a formal model often yield large and complex models, making the verification process inefficient and costly. In order to reduce the size of the resulting model, optimization transformations can be used. Such optimizations include common algorithms known from compiler design and different program slicing techniques. Our paper describes a framework for transforming C programs to a formal model, enhanced by various optimizations for size reduction. We evaluate and compare several optimization algorithms regarding their effect on the size of the model and the efficiency of the verification. Results show that different optimizations are more suitable for certain models, justifying the need for a framework that includes several algorithms.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"tth-hajdu-vrs-micskei-majzik-thetaaframeworkforabstractionrefinementbasedmodelchecking-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/fmcad2017.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'tth-hajdu-vrs-micskei-majzik-thetaaframeworkforabstractionrefinementbasedmodelchecking-2017', 'https://hajduakos.github.io/publications/fmcad2017.pdf', event);\">\n    Theta: a Framework for Abstraction Refinement-Based Model Checking.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Tóth, T.; <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Vörös, A.; Micskei, Z.;  and Majzik, I.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 17th Conference on Formal Methods in Computer-Aided Design</i>, pages 176–179,  2017. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/fmcad2017.pdf\"\n     onclick=\"log_download('tth-hajdu-vrs-micskei-majzik-thetaaframeworkforabstractionrefinementbasedmodelchecking-2017', 'https://hajduakos.github.io/publications/fmcad2017.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Theta: a Framework for Abstraction Refinement-Based Model Checking [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"http://www.cs.utexas.edu/users/hunt/FMCAD/FMCAD17/proceedings/\"\n     onclick=\"log_download('tth-hajdu-vrs-micskei-majzik-thetaaframeworkforabstractionrefinementbasedmodelchecking-2017', 'http://www.cs.utexas.edu/users/hunt/FMCAD/FMCAD17/proceedings/', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Theta: a Framework for Abstraction Refinement-Based Model Checking [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n  <a href=\"https://hajduakos.github.io/publications/slides/fmcad2017.pdf\"\n     onclick=\"log_download('tth-hajdu-vrs-micskei-majzik-thetaaframeworkforabstractionrefinementbasedmodelchecking-2017', 'https://hajduakos.github.io/publications/slides/fmcad2017.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Theta: a Framework for Abstraction Refinement-Based Model Checking [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n  <a href=\"https://oc-presentation.ltcc.tuwien.ac.at/engage/theodul/ui/core.html?id=c658c37e-ae70-11e7-a0dd-bb49f3cb440c\"\n     onclick=\"log_download('tth-hajdu-vrs-micskei-majzik-thetaaframeworkforabstractionrefinementbasedmodelchecking-2017', 'https://oc-presentation.ltcc.tuwien.ac.at/engage/theodul/ui/core.html?id=c658c37e-ae70-11e7-a0dd-bb49f3cb440c', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Theta: a Framework for Abstraction Refinement-Based Model Checking [link]\"\n       title=\" video\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> video</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.23919/FMCAD.2017.8102257\"\n     onclick=\"log_download('tth-hajdu-vrs-micskei-majzik-thetaaframeworkforabstractionrefinementbasedmodelchecking-2017', 'http://doi.org/10.23919/FMCAD.2017.8102257', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/tth-hajdu-vrs-micskei-majzik-thetaaframeworkforabstractionrefinementbasedmodelchecking-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('tth-hajdu-vrs-micskei-majzik-thetaaframeworkforabstractionrefinementbasedmodelchecking-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{fmcad2017,\n    author     = {T{\\&#x27;o}th, Tam{\\&#x27;a}s and Hajdu, {\\&#x27;A}kos and V{\\&quot;o}r{\\&quot;o}s, Andr{\\&#x27;a}s and Micskei, Zolt{\\&#x27;a}n and Majzik, Istv{\\&#x27;a}n},\n    year       = {2017},\n    title      = {Theta: a Framework for Abstraction Refinement-Based Model Checking},\n    booktitle  = {Proceedings of the 17th Conference on Formal Methods in Computer-Aided Design},\n    isbn       = {978-0-9835678-7-5},\n    pages      = {176--179},\n    doi        = {10.23919/FMCAD.2017.8102257},\n\n    type       = {Conference},\n\n    url_pdf    = {https://hajduakos.github.io/publications/fmcad2017.pdf},\n    url_link   = {http://www.cs.utexas.edu/users/hunt/FMCAD/FMCAD17/proceedings/},\n    url_slides = {https://hajduakos.github.io/publications/slides/fmcad2017.pdf},\n    url_video  = {https://oc-presentation.ltcc.tuwien.ac.at/engage/theodul/ui/core.html?id=c658c37e-ae70-11e7-a0dd-bb49f3cb440c},\n\n    abstract   = {In this paper, we present Theta, a configurable model checking framework. The goal of the framework is to support the design, execution and evaluation of abstraction refinement-based reachability analysis algorithms for models of different formalisms. It enables the definition of input formalisms, abstract domains, model interpreters, and strategies for abstraction and refinement. Currently it contains front-end support for transition systems, control flow automata and timed automata. The built-in abstract domains include predicates, explicit values, zones and their combinations, along with various refinement strategies implemented for each. The configurability of the framework allows the integration of several abstraction and refinement methods, this way supporting the evaluation of their advantages and shortcomings. We demonstrate the applicability of the framework by use cases for the safety checking of PLC, hardware, C programs and timed automata models.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we present Theta, a configurable model checking framework. The goal of the framework is to support the design, execution and evaluation of abstraction refinement-based reachability analysis algorithms for models of different formalisms. It enables the definition of input formalisms, abstract domains, model interpreters, and strategies for abstraction and refinement. Currently it contains front-end support for transition systems, control flow automata and timed automata. The built-in abstract domains include predicates, explicit values, zones and their combinations, along with various refinement strategies implemented for each. The configurability of the framework allows the integration of several abstraction and refinement methods, this way supporting the evaluation of their advantages and shortcomings. We demonstrate the applicability of the framework by use cases for the safety checking of PLC, hardware, C programs and timed automata models.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2016\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2016')\"\n      onkeypress=\"toggleGroup('group_2016')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2016</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"hajdu-tth-vrs-majzik-aconfigurablecegarframeworkwithinterpolationbasedrefinements-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/forte2016.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hajdu-tth-vrs-majzik-aconfigurablecegarframeworkwithinterpolationbasedrefinements-2016', 'https://hajduakos.github.io/publications/forte2016.pdf', event);\">\n    A Configurable CEGAR Framework with Interpolation-based Refinements.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Tóth, T.; Vörös, A.;  and Majzik, I.\n</span>\n\n  \n\n</span>\n\n  In <i>Formal Techniques for Distributed Objects, Components and Systems</i>, volume 9688, of Lecture Notes in Computer Science, pages 158–174. Springer,  2016.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/forte2016.pdf\"\n     onclick=\"log_download('hajdu-tth-vrs-majzik-aconfigurablecegarframeworkwithinterpolationbasedrefinements-2016', 'https://hajduakos.github.io/publications/forte2016.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A Configurable CEGAR Framework with Interpolation-based Refinements [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"http://link.springer.com/chapter/10.1007/978-3-319-39570-8_11\"\n     onclick=\"log_download('hajdu-tth-vrs-majzik-aconfigurablecegarframeworkwithinterpolationbasedrefinements-2016', 'http://link.springer.com/chapter/10.1007/978-3-319-39570-8_11', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"A Configurable CEGAR Framework with Interpolation-based Refinements [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n  <a href=\"https://hajduakos.github.io/publications/slides/forte2016.pdf\"\n     onclick=\"log_download('hajdu-tth-vrs-majzik-aconfigurablecegarframeworkwithinterpolationbasedrefinements-2016', 'https://hajduakos.github.io/publications/slides/forte2016.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A Configurable CEGAR Framework with Interpolation-based Refinements [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-319-39570-8_11\"\n     onclick=\"log_download('hajdu-tth-vrs-majzik-aconfigurablecegarframeworkwithinterpolationbasedrefinements-2016', 'http://doi.org/10.1007/978-3-319-39570-8_11', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hajdu-tth-vrs-majzik-aconfigurablecegarframeworkwithinterpolationbasedrefinements-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>6 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hajdu-tth-vrs-majzik-aconfigurablecegarframeworkwithinterpolationbasedrefinements-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@incollection{forte2016,\n    author     = {Hajdu, {\\&#x27;A}kos and T{\\&#x27;o}th, Tam{\\&#x27;a}s and V{\\&quot;o}r{\\&quot;o}s, Andr{\\&#x27;a}s and Majzik, Istv{\\&#x27;a}n},\n    title      = {A Configurable {CEGAR} Framework with Interpolation-based Refinements},\n    year       = {2016},\n    booktitle  = {Formal Techniques for Distributed Objects, Components and Systems},\n    series     = {Lecture Notes in Computer Science},\n    volume     = {9688},\n    pages      = {158--174},\n    publisher  = {Springer},\n    isbn       = {978-3-319-39570-8},\n    doi        = {10.1007/978-3-319-39570-8_11},\n\n    type       = {Conference},\n\n    url_pdf    = {https://hajduakos.github.io/publications/forte2016.pdf},\n    url_link   = {http://link.springer.com/chapter/10.1007/978-3-319-39570-8_11},\n    url_slides = {https://hajduakos.github.io/publications/slides/forte2016.pdf},\n\n    abstract   = {Correctness of software components in a distributed system is a key issue to ensure overall reliability. Formal verification techniques such as model checking can show design flaws at early stages of development. Abstraction is a key technique for reducing complexity by hiding information, which is not relevant for verification. Counterexample-Guided Abstraction Refinement (CEGAR) is a verification algorithm that starts from a coarse abstraction and refines it iteratively until the proper precision is obtained. Many abstraction types and refinement strategies exist for systems with different characteristics. In this paper we show how these algorithms can be combined into a configurable CEGAR framework. In our framework we also present a new CEGAR configuration based on a combination of abstractions, being able to perform better for certain models. We demonstrate the use of the framework by comparing several configurations of the algorithms on various problems, identifying their advantages and shortcomings.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Correctness of software components in a distributed system is a key issue to ensure overall reliability. Formal verification techniques such as model checking can show design flaws at early stages of development. Abstraction is a key technique for reducing complexity by hiding information, which is not relevant for verification. Counterexample-Guided Abstraction Refinement (CEGAR) is a verification algorithm that starts from a coarse abstraction and refines it iteratively until the proper precision is obtained. Many abstraction types and refinement strategies exist for systems with different characteristics. In this paper we show how these algorithms can be combined into a configurable CEGAR framework. In our framework we also present a new CEGAR configuration based on a combination of abstractions, being able to perform better for certain models. We demonstrate the use of the framework by comparing several configurations of the algorithms on various problems, identifying their advantages and shortcomings.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"vrs-darvas-molnr-klenik-hajdu-jmbor-bartha-majzik-petridotnet15extensiblepetrineteditorandanalyserforeducationandresearch-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/icatpn2016.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'vrs-darvas-molnr-klenik-hajdu-jmbor-bartha-majzik-petridotnet15extensiblepetrineteditorandanalyserforeducationandresearch-2016', 'https://hajduakos.github.io/publications/icatpn2016.pdf', event);\">\n    PetriDotNet 1.5: Extensible Petri Net Editor and Analyser for Education and Research.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Vörös, A.; Darvas, D.; Molnár, V.; Klenik, A.; <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Jámbor, A.; Bartha, T.;  and Majzik, I.\n</span>\n\n  \n\n</span>\n\n  In <i>Application and Theory of Petri Nets and Concurrency</i>, volume 9698, of Lecture Notes in Computer Science, pages 123–132. Springer,  2016.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/icatpn2016.pdf\"\n     onclick=\"log_download('vrs-darvas-molnr-klenik-hajdu-jmbor-bartha-majzik-petridotnet15extensiblepetrineteditorandanalyserforeducationandresearch-2016', 'https://hajduakos.github.io/publications/icatpn2016.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"PetriDotNet 1.5: Extensible Petri Net Editor and Analyser for Education and Research [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"http://link.springer.com/chapter/10.1007/978-3-319-39086-4_9\"\n     onclick=\"log_download('vrs-darvas-molnr-klenik-hajdu-jmbor-bartha-majzik-petridotnet15extensiblepetrineteditorandanalyserforeducationandresearch-2016', 'http://link.springer.com/chapter/10.1007/978-3-319-39086-4_9', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"PetriDotNet 1.5: Extensible Petri Net Editor and Analyser for Education and Research [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-319-39086-4_9\"\n     onclick=\"log_download('vrs-darvas-molnr-klenik-hajdu-jmbor-bartha-majzik-petridotnet15extensiblepetrineteditorandanalyserforeducationandresearch-2016', 'http://doi.org/10.1007/978-3-319-39086-4_9', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/vrs-darvas-molnr-klenik-hajdu-jmbor-bartha-majzik-petridotnet15extensiblepetrineteditorandanalyserforeducationandresearch-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('vrs-darvas-molnr-klenik-hajdu-jmbor-bartha-majzik-petridotnet15extensiblepetrineteditorandanalyserforeducationandresearch-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@incollection{icatpn2016,\n    author    = {V{\\&quot;o}r{\\&quot;o}s, Andr{\\&#x27;a}s and Darvas, D{\\&#x27;a}niel and Moln{\\&#x27;a}r, Vince and Klenik, Attila and Hajdu, {\\&#x27;A}kos and J{\\&#x27;a}mbor, Attila and Bartha, Tam{\\&#x27;a}s and Majzik, Istv{\\&#x27;a}n},\n    title     = {{PetriDotNet} 1.5: Extensible {P}etri Net Editor and Analyser for Education and Research},\n    year      = {2016},\n    booktitle = {Application and Theory of Petri Nets and Concurrency},\n    series    = {Lecture Notes in Computer Science},\n    volume    = {9698},\n    pages     = {123--132},\n    publisher = {Springer},\n    isbn      = {978-3-319-39086-4},\n    doi       = {10.1007/978-3-319-39086-4_9},\n\n    type      = {Conference},\n\n    url_pdf   = {https://hajduakos.github.io/publications/icatpn2016.pdf},\n    url_link  = {http://link.springer.com/chapter/10.1007/978-3-319-39086-4_9},\n\n    abstract  = {PetriDotNet is an extensible Petri net editor and analysis tool originally developed to support the education of formal methods. The ease of use and simple extensibility fostered more and more algorithmic developments. Thanks to the continuous interest of developers (especially M.Sc. and Ph.D. students who choose PetriDotNet as the framework of their thesis project), by now PetriDotNet became an analysis platform, providing various cutting-edge model checking algorithms and stochastic analysis algorithms. As a result, industrial application of the tool also emerged in recent years. In this paper we overview the main features and the architecture of PetriDotNet, and compare it with other available tools.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  PetriDotNet is an extensible Petri net editor and analysis tool originally developed to support the education of formal methods. The ease of use and simple extensibility fostered more and more algorithmic developments. Thanks to the continuous interest of developers (especially M.Sc. and Ph.D. students who choose PetriDotNet as the framework of their thesis project), by now PetriDotNet became an analysis platform, providing various cutting-edge model checking algorithms and stochastic analysis algorithms. As a result, industrial application of the tool also emerged in recent years. In this paper we overview the main features and the architecture of PetriDotNet, and compare it with other available tools.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2015\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2015')\"\n      onkeypress=\"toggleGroup('group_2015')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2015</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"hajdu-vrs-bartha-newsearchstrategiesforthepetrinetcegarapproach-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/icatpn2015.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hajdu-vrs-bartha-newsearchstrategiesforthepetrinetcegarapproach-2015', 'https://hajduakos.github.io/publications/icatpn2015.pdf', event);\">\n    New search strategies for the Petri net CEGAR approach.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Vörös, A.;  and Bartha, T.\n</span>\n\n  \n\n</span>\n\n  In <i>Application and Theory of Petri Nets and Concurrency</i>, volume 9115, of Lecture Notes in Computer Science, pages 309–328. Springer,  2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/icatpn2015.pdf\"\n     onclick=\"log_download('hajdu-vrs-bartha-newsearchstrategiesforthepetrinetcegarapproach-2015', 'https://hajduakos.github.io/publications/icatpn2015.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"New search strategies for the Petri net CEGAR approach [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"http://link.springer.com/chapter/10.1007/978-3-319-19488-2_16\"\n     onclick=\"log_download('hajdu-vrs-bartha-newsearchstrategiesforthepetrinetcegarapproach-2015', 'http://link.springer.com/chapter/10.1007/978-3-319-19488-2_16', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"New search strategies for the Petri net CEGAR approach [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n  <a href=\"https://hajduakos.github.io/publications/slides/icatpn2015.pdf\"\n     onclick=\"log_download('hajdu-vrs-bartha-newsearchstrategiesforthepetrinetcegarapproach-2015', 'https://hajduakos.github.io/publications/slides/icatpn2015.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"New search strategies for the Petri net CEGAR approach [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-319-19488-2_16\"\n     onclick=\"log_download('hajdu-vrs-bartha-newsearchstrategiesforthepetrinetcegarapproach-2015', 'http://doi.org/10.1007/978-3-319-19488-2_16', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hajdu-vrs-bartha-newsearchstrategiesforthepetrinetcegarapproach-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hajdu-vrs-bartha-newsearchstrategiesforthepetrinetcegarapproach-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@incollection{icatpn2015,\n    author     = {{\\&#x27;A}kos Hajdu and Andr{\\&#x27;a}s V{\\&quot;o}r{\\&quot;o}s and Tam{\\&#x27;a}s Bartha},\n    title      = {New search strategies for the {P}etri net {CEGAR} approach},\n    year       = {2015},\n    booktitle  = {Application and Theory of Petri Nets and Concurrency},\n    series     = {Lecture Notes in Computer Science},\n    volume     = {9115},\n    publisher  = {Springer},\n    isbn       = {978-3-319-19488-2},\n    pages      = {309--328},\n    doi        = {10.1007/978-3-319-19488-2_16},\n\n    type       = {Conference},\n\n    url_pdf    = {https://hajduakos.github.io/publications/icatpn2015.pdf},\n    url_link   = {http://link.springer.com/chapter/10.1007/978-3-319-19488-2_16},\n    url_slides = {https://hajduakos.github.io/publications/slides/icatpn2015.pdf},\n\n    abstract   = {Petri nets are a successful formal method for the modeling and verification of asynchronous, concurrent and distributed systems. Reachability analysis can provide important information about the behavior of the model. However, reachability analysis is a computationally hard problem, especially when the state space is infinite. Abstraction-based techniques are often applied to overcome complexity. In this paper we analyze an algorithm, which uses counterexample guided abstraction refinement. This algorithm proved its efficiency on the model checking contest. We examine the algorithm from a theoretical and practical point of view. On the theoretical side, we show that the algorithm cannot decide reachability for relatively simple instances. We propose a new iteration strategy to explore the invariant space, which extends the set of decidable problems. We also give proofs on the theoretical limits of our approach. On the practical side, we examine different search strategies and we present our new, complex strategy with superior performance compared to traditional strategies. Measurements show that our new contributions perform well for traditional benchmark models as well.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Petri nets are a successful formal method for the modeling and verification of asynchronous, concurrent and distributed systems. Reachability analysis can provide important information about the behavior of the model. However, reachability analysis is a computationally hard problem, especially when the state space is infinite. Abstraction-based techniques are often applied to overcome complexity. In this paper we analyze an algorithm, which uses counterexample guided abstraction refinement. This algorithm proved its efficiency on the model checking contest. We examine the algorithm from a theoretical and practical point of view. On the theoretical side, we show that the algorithm cannot decide reachability for relatively simple instances. We propose a new iteration strategy to explore the invariant space, which extends the set of decidable problems. We also give proofs on the theoretical limits of our approach. On the practical side, we examine different search strategies and we present our new, complex strategy with superior performance compared to traditional strategies. Measurements show that our new contributions perform well for traditional benchmark models as well.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hajdu-makingthettreereaderinterfacemoreaccessible-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://cds.cern.ch/record/2044503/files/report.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hajdu-makingthettreereaderinterfacemoreaccessible-2015', 'http://cds.cern.ch/record/2044503/files/report.pdf', event);\">\n    Making the TTreeReader interface more accessible.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>\n</span>\n\n  \n\n</span>\n\n  Technical Report CERN-STUDENTS-Note-2015-039, European Organization for Nuclear Research (CERN), Aug 2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://cds.cern.ch/record/2044503/files/report.pdf\"\n     onclick=\"log_download('hajdu-makingthettreereaderinterfacemoreaccessible-2015', 'http://cds.cern.ch/record/2044503/files/report.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Making the TTreeReader interface more accessible [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"http://cds.cern.ch/record/2044503\"\n     onclick=\"log_download('hajdu-makingthettreereaderinterfacemoreaccessible-2015', 'http://cds.cern.ch/record/2044503', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Making the TTreeReader interface more accessible [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hajdu-makingthettreereaderinterfacemoreaccessible-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hajdu-makingthettreereaderinterfacemoreaccessible-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@techreport{cern2015,\n    author      = {Hajdu, {\\&#x27;A}kos},\n    title       = {Making the {TT}ree{R}eader interface more accessible},\n    number      = {CERN-STUDENTS-Note-2015-039},\n    year        = {2015},\n    month       = {Aug},\n    institution = {European Organization for Nuclear Research (CERN)},\n\n    type        = {Tech. rep.},\n\n    url_pdf     = {http://cds.cern.ch/record/2044503/files/report.pdf},\n    url_link    = {http://cds.cern.ch/record/2044503},\n\n    abstract    = {The ROOT framework is the main data analysis tool for High Energy Physics. One of its main features is TTree, a collection type enabling efficient analysis on petabytes of data. ROOT has a new interface called TTreeReader to access data in a type-safe and efficient way. This Summer Student project aims at implementing a utility interface to generate source file skeletons as a starting point for the users. This will make the TTreeReader much more accessible for the users of ROOT.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The ROOT framework is the main data analysis tool for High Energy Physics. One of its main features is TTree, a collection type enabling efficient analysis on petabytes of data. ROOT has a new interface called TTreeReader to access data in a type-safe and efficient way. This Summer Student project aims at implementing a utility interface to generate source file skeletons as a starting point for the users. This will make the TTreeReader much more accessible for the users of ROOT.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2014\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2014')\"\n      onkeypress=\"toggleGroup('group_2014')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2014</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"hajdu-vrs-bartha-mrtonka-extensionstothecegarapproachonpetrinets-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/acta2014.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hajdu-vrs-bartha-mrtonka-extensionstothecegarapproachonpetrinets-2014', 'https://hajduakos.github.io/publications/acta2014.pdf', event);\">\n    Extensions to the CEGAR Approach on Petri Nets.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Vörös, A.; Bartha, T.;  and Mártonka, Z.\n</span>\n\n  \n\n</span>\n\n  <i>Acta Cybernetica</i>, 21(3): 401–417.  2014.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/acta2014.pdf\"\n     onclick=\"log_download('hajdu-vrs-bartha-mrtonka-extensionstothecegarapproachonpetrinets-2014', 'https://hajduakos.github.io/publications/acta2014.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Extensions to the CEGAR Approach on Petri Nets [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"http://www.inf.u-szeged.hu/actacybernetica/edb/vol21n3/pdf/Hajdu_2014_ActaCybernetica.pdf\"\n     onclick=\"log_download('hajdu-vrs-bartha-mrtonka-extensionstothecegarapproachonpetrinets-2014', 'http://www.inf.u-szeged.hu/actacybernetica/edb/vol21n3/pdf/Hajdu_2014_ActaCybernetica.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Extensions to the CEGAR Approach on Petri Nets [pdf]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.14232/actacyb.21.3.2014.8\"\n     onclick=\"log_download('hajdu-vrs-bartha-mrtonka-extensionstothecegarapproachonpetrinets-2014', 'http://doi.org/10.14232/actacyb.21.3.2014.8', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hajdu-vrs-bartha-mrtonka-extensionstothecegarapproachonpetrinets-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hajdu-vrs-bartha-mrtonka-extensionstothecegarapproachonpetrinets-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{acta2014,\n    author   = {{\\&#x27;A}kos Hajdu and Andr{\\&#x27;a}s V{\\&quot;o}r{\\&quot;o}s and Tam{\\&#x27;a}s Bartha and Zolt{\\&#x27;a}n M{\\&#x27;a}rtonka},\n    title    = {Extensions to the {CEGAR} Approach on {P}etri Nets},\n    year     = {2014},\n    pages    = {401--417},\n    journal  = {Acta Cybernetica},\n    volume   = {21},\n    number   = {3},\n    issn     = {0324-721X},\n    doi      = {10.14232/actacyb.21.3.2014.8},\n\n    type     = {Journal},\n\n    url_pdf  = {https://hajduakos.github.io/publications/acta2014.pdf},\n    url_link = {http://www.inf.u-szeged.hu/actacybernetica/edb/vol21n3/pdf/Hajdu_2014_ActaCybernetica.pdf},\n\n    abstract = {Formal verification is becoming more prevalent and often compulsory in the safety-critical system and software development processes. Reachability analysis can provide information about safety and invariant properties of the developed system. However, checking the reachability is a computationally hard problem, especially in the case of asynchronous or infinite state systems. Petri nets are widely used for the modeling and verification of such systems. In this paper we examine a recently published approach for the reachability checking of Petri net markings. We give proofs concerning the completeness and the correctness properties of the algorithm, and we introduce algorithmic improvements. We also extend the algorithm to handle new classes of problems: submarking coverability and reachability of Petri nets with inhibitor arcs.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Formal verification is becoming more prevalent and often compulsory in the safety-critical system and software development processes. Reachability analysis can provide information about safety and invariant properties of the developed system. However, checking the reachability is a computationally hard problem, especially in the case of asynchronous or infinite state systems. Petri nets are widely used for the modeling and verification of such systems. In this paper we examine a recently published approach for the reachability checking of Petri net markings. We give proofs concerning the completeness and the correctness properties of the algorithm, and we introduce algorithmic improvements. We also extend the algorithm to handle new classes of problems: submarking coverability and reachability of Petri nets with inhibitor arcs.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hajdu-nmet-varrgyapay-vrs-petrinetbasedtrajectoryoptimization-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/vocal2014.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hajdu-nmet-varrgyapay-vrs-petrinetbasedtrajectoryoptimization-2014', 'https://hajduakos.github.io/publications/vocal2014.pdf', event);\">\n    Petri Net Based Trajectory Optimization.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Német, R.; Varró-Gyapay, S.;  and Vörös, A.\n</span>\n\n  \n\n</span>\n\n  In <i>ASCONIKK 2014: Extended Abstracts. Future Internet Services</i>, pages 11–19,  2014. University of Pannonia\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/vocal2014.pdf\"\n     onclick=\"log_download('hajdu-nmet-varrgyapay-vrs-petrinetbasedtrajectoryoptimization-2014', 'https://hajduakos.github.io/publications/vocal2014.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Petri Net Based Trajectory Optimization [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"http://nikk.mik.uni-pannon.hu/images/II_final_.pdf\"\n     onclick=\"log_download('hajdu-nmet-varrgyapay-vrs-petrinetbasedtrajectoryoptimization-2014', 'http://nikk.mik.uni-pannon.hu/images/II_final_.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Petri Net Based Trajectory Optimization [pdf]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n  <a href=\"https://hajduakos.github.io/publications/slides/vocal2014.pdf\"\n     onclick=\"log_download('hajdu-nmet-varrgyapay-vrs-petrinetbasedtrajectoryoptimization-2014', 'https://hajduakos.github.io/publications/slides/vocal2014.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Petri Net Based Trajectory Optimization [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hajdu-nmet-varrgyapay-vrs-petrinetbasedtrajectoryoptimization-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hajdu-nmet-varrgyapay-vrs-petrinetbasedtrajectoryoptimization-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{asconikk2014,\n    author     = {{\\&#x27;A}kos Hajdu and R{\\&#x27;o}bert N{\\&#x27;e}met and Szilvia Varr{\\&#x27;o}-Gyapay and Andr{\\&#x27;a}s V{\\&quot;o}r{\\&quot;o}s},\n    title      = {{P}etri Net Based Trajectory Optimization},\n    booktitle  = {ASCONIKK 2014: Extended Abstracts. Future Internet Services},\n    year       = {2014},\n    location   = {Veszpr\\&#x27;em, Hungary},\n    publisher  = {University of Pannonia},\n    pages      = {11--19},\n    isbn       = {978-963-396-047-9},\n\n    type       = {Conference},\n\n    url_pdf    = {https://hajduakos.github.io/publications/vocal2014.pdf},\n    url_link   = {http://nikk.mik.uni-pannon.hu/images/II_final_.pdf},\n    url_slides = {https://hajduakos.github.io/publications/slides/vocal2014.pdf},\n\n    abstract   = {Optimization problems are becoming more prevalent in the design of complex systems. Petri nets are widely used for the modeling of such systems. An optimization problem can be translated to find an optimal trajectory where a cost is assigned to each step. The reachability problem of Petri nets answers whether a given state is reachable from the initial state. However, reachability analysis is a computationally hard problem, especially in the case of asynchronous or infinite state systems. In this paper we examine a recently published algorithm that solves reachability using abstraction methods and we extend this approach to be able to handle optimal trajectory problems.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Optimization problems are becoming more prevalent in the design of complex systems. Petri nets are widely used for the modeling of such systems. An optimization problem can be translated to find an optimal trajectory where a cost is assigned to each step. The reachability problem of Petri nets answers whether a given state is reachable from the initial state. However, reachability analysis is a computationally hard problem, especially in the case of asynchronous or infinite state systems. In this paper we examine a recently published algorithm that solves reachability using abstraction methods and we extend this approach to be able to handle optimal trajectory problems.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2013\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2013')\"\n      onkeypress=\"toggleGroup('group_2013')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2013</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"hajdu-vrs-bartha-mrtonka-extensionstothecegarapproachonpetrinets-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hajduakos.github.io/publications/splst2013.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hajdu-vrs-bartha-mrtonka-extensionstothecegarapproachonpetrinets-2013', 'https://hajduakos.github.io/publications/splst2013.pdf', event);\">\n    Extensions to the CEGAR Approach on Petri Nets.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://hajduakos.github.io/publications.html\">Hajdu, Á.</a>; Vörös, A.; Bartha, T.;  and Mártonka, Z.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 13th Symposium on Programming Languages and Software Tools</i>, pages 274–288,  2013. University of Szeged\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hajduakos.github.io/publications/splst2013.pdf\"\n     onclick=\"log_download('hajdu-vrs-bartha-mrtonka-extensionstothecegarapproachonpetrinets-2013', 'https://hajduakos.github.io/publications/splst2013.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Extensions to the CEGAR Approach on Petri Nets [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"http://www.inf.u-szeged.hu/projectdirs/splst13/splst13proc.pdf\"\n     onclick=\"log_download('hajdu-vrs-bartha-mrtonka-extensionstothecegarapproachonpetrinets-2013', 'http://www.inf.u-szeged.hu/projectdirs/splst13/splst13proc.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Extensions to the CEGAR Approach on Petri Nets [pdf]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n  <a href=\"https://hajduakos.github.io/publications/slides/splst2013.pdf\"\n     onclick=\"log_download('hajdu-vrs-bartha-mrtonka-extensionstothecegarapproachonpetrinets-2013', 'https://hajduakos.github.io/publications/slides/splst2013.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Extensions to the CEGAR Approach on Petri Nets [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hajdu-vrs-bartha-mrtonka-extensionstothecegarapproachonpetrinets-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hajdu-vrs-bartha-mrtonka-extensionstothecegarapproachonpetrinets-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{splst2013,\n    author     = {{\\&#x27;A}kos Hajdu and Andr{\\&#x27;a}s V{\\&quot;o}r{\\&quot;o}s and Tam{\\&#x27;a}s Bartha and Zolt{\\&#x27;a}n M{\\&#x27;a}rtonka},\n    title      = {Extensions to the {CEGAR} Approach on {P}etri Nets},\n    year       = {2013},\n    pages      = {274--288},\n    publisher  = {University of Szeged},\n    booktitle  = {Proceedings of the 13th Symposium on Programming Languages and Software Tools},\n    isbn       = {978-963-306-228-9},\n\n    type       = {Conference},\n\n    url_pdf    = {https://hajduakos.github.io/publications/splst2013.pdf},\n    url_link   = {http://www.inf.u-szeged.hu/projectdirs/splst13/splst13proc.pdf},\n    url_slides = {https://hajduakos.github.io/publications/slides/splst2013.pdf},\n\n    abstract   = {Formal verification is becoming more prevalent and often compulsory in the safety-critical system and software development processes. Reachability analysis can provide information about safety and invariant properties of the developed system. However, checking the reachability is a computationally hard problem, especially in the case of asynchronous or infinite state systems. Petri nets are widely used for the modeling and verification of such systems. In this paper we examine a recently published approach for the reachability checking of Petri net markings. We give proofs concerning the completeness and the correctness properties of the algorithm, and we introduce algorithmic improvements. We also extend the algorithm to handle new classes of problems: submarking coverability and reachability of Petri nets with inhibitor arcs.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Formal verification is becoming more prevalent and often compulsory in the safety-critical system and software development processes. Reachability analysis can provide information about safety and invariant properties of the developed system. However, checking the reachability is a computationally hard problem, especially in the case of asynchronous or infinite state systems. Petri nets are widely used for the modeling and verification of such systems. In this paper we examine a recently published approach for the reachability checking of Petri net markings. We give proofs concerning the completeness and the correctness properties of the algorithm, and we introduce algorithmic improvements. We also extend the algorithm to handle new classes of problems: submarking coverability and reachability of Petri nets with inhibitor arcs.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);