David Faragó
Karlsruhe Institute of Technology
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by David Faragó.
nasa formal methods symposium | 2013
Alfons Laarman; David Faragó
Until recently, the preferred method of livelock detection was via LTL model checking, which imposes complex constraints on partial order reduction por, limiting its performance and parallelization. The introduction of the \(\textsc{dfs}_{\textsc{fifo}}\) algorithm by Farago et al. showed that livelocks can theoretically be detected faster, simpler, and with stronger por.
formal methods for industrial critical systems | 2010
Frank Werner; David Faragó
We investigate the application of the software bounded model checking tool CBMC to the domain of wireless sensor networks (WSNs). We automatically generate a software behavior model from a network protocol (ESAWN) implementation in a WSN development and deployment platform (TinyOS), which is used to rigorously verify the protocol. Our work is a proof of concept that automatic verification of programs of practical size (≈ 21 000 LoC) and complexity is possible with CBMC and can be integrated into TinyOS. The developer can automatically check for pointer dereference and array index out of bound errors. She can also check additional, e.g., functional, properties that she provides by assume- and assert-statements. This experience paper shows that our approach is in general feasible since we managed to verify about half of the properties. We made the verification process scalable in the size of the code by abstraction (eg, from hardware) and by simplification heuristics. The latter also achieved scalability in data type complexity for the properties that were verifiable. The others require technical advancements for complex data types within CBMCs core.
international workshop on model checking software | 2009
David Faragó; Peter H. Schmitt
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first search, i.e., it searches through the graph incrementally deeper. It simultaneously constructs the state space and searches for non-progress cycles. The algorithm is expected to be more efficient than the method the model checker SPIN currently uses, and finds shortest (w.r.t. progress) counterexamples. Its only downside is the need for a subsequent reachability depth-first search (which is not the bottleneck) for constructing a full counterexample. The new algorithm is better combinable with partial order reduction than SPINs method.
Softwaretechnik-trends | 2010
David Faragó
Softwaretechnik-trends | 2014
David Faragó; Florian Merz; Carsten Sinz
Softwaretechnik-trends | 2011
David Faragó
FM+AM | 2010
David Faragó
Softwaretechnik-trends | 2016
Benedikt Eberhardinger; David Faragó; Mario Friske; Dehla Sokenou
Archive | 2016
David Faragó
Softwaretechnik-trends | 2015
Christian Brandes; Benedikt Eberhardinger; David Faragó; Mario Friske; Baris Güldali; Andrej Pietschker