% 
% This file was created by the TYPO3 extension
% bib
% --- Timezone: CEST
% Creation date: 2024-07-04
% Creation time: 19-17-41
% --- Number of references
% 8
% 

@Article { 2018-stoffers-on-automated-memoization,
   title = {On Automated Memoization in the Field of Simulation Parameter Studies},
   journal = {ACM Transactions on Modeling and Computer Simulation (TOMACS)},
   year = {2018},
   month = {10},
   volume = {28},
   number = {4},
   number2 = {Article 26},
   pages = {26:1-26:25},
   tags = {memosim,symbiosys},
   url = {file:2213},
   DOI = {10.1145/3186316},
   reviewed = {1},
   author = {Stoffers, Mirko and Schemmel, Daniel and Soria Dustmann, Oscar and Wehrle, Klaus}
}

@Inproceedings { 2018-soria-dustmann-parti,
   title = {PARTI: A Multi-interval Theory Solver for Symbolic Execution},
   year = {2018},
   month = {9},
   tags = {symbiosys},
   url = {file:2195},
   booktitle = {Proceedings of the 2018 Conference on Automated Software Engineering (ASE'18)},
   DOI = {10.1145/3238147.3238179},
   reviewed = {1},
   author = {Soria Dustmann, Oscar and Wehrle, Klaus and Cadar, Cristian}
}

@Inproceedings { 2018-cav-schemmel-liveness,
   title = {Symbolic Liveness Analysis of Real-World Software},
   year = {2018},
   month = {7},
   day = {14},
   tags = {symbiosys},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018-schemmel-symbolic-liveness-analysis-of-real-world-software.pdf},
   booktitle = {Computer Aided Verification (CAV 2018)},
   event_place = {Oxford, Great Britain},
   event_name = {30th International Conference on Computer Aided Verification},
   event_date = {2018-07-14 to 2018-07-17},
   language = {en},
   DOI = {10.1007/978-3-319-96142-2_27},
   reviewed = {1},
   author = {Schemmel, Daniel and B{\"u}ning, Julian and Soria Dustmann, Oscar and Noll, Thomas and Wehrle, Klaus}
}

@Inproceedings { 2016-stoffers-pads-memo,
   title = {Automated Memoization for Parameter Studies Implemented in Impure Languages},
   year = {2016},
   month = {5},
   day = {15},
   pages = {221-232},
   note = {Best Paper Award},
   keywords = {Automatic Memoization; Accelerating Parameter Studies;
Impure Languages},
   tags = {memosim,symbiosys},
   url = {http://www.comsys.rwth-aachen.de/fileadmin/papers/2016/2016-stoffers-pads-memoization.pdf},
   misc2 = {Online},
   publisher = {ACM},
   address = {New York, NY},
   booktitle = {Proceedings of the 4th ACM SIGSIM/PADS Conference on Principles of Advanced Discrete Simulation (SIGSIM-PADS’16), Banff, AB, Canada},
   event_place = {Banff, AB, Canada},
   language = {en},
   DOI = {10.1145/2901378.2901386},
   reviewed = {1},
   author = {Stoffers, Mirko and Schemmel, Daniel and Soria Dustmann, Oscar and Wehrle, Klaus}
}

@Article { 2012-soriadustmann-pik-effizient-sde,
   title = {Effizientes Auffinden von Fehlern in Verteilten Systemen mit Symbolischer Ausf{\"u}hrung},
   journal = {Praxis der Informationsverarbeitung und Kommunikation (PIK Journal)},
   year = {2012},
   month = {11},
   volume = {35},
   number = {4},
   pages = {289–295},
   abstract = {Zum Testen verteilter bzw. vernetzter Systeme existieren zahlreiche Werkzeuge, welche f{\"u}r das Rapid Prototyping und die Fehler-Rekonstruktion unerl{\"a}sslich sind.
Durch verschieden stark abstrahierte Modelle lassen sich auf diese Weise, bereits fr{\"u}h in der Entwicklung verteilter Systeme, Aussagen {\"u}ber Performanz, Konsistenz und Korrektheit von Netzwerkprotokollen treffen.
Diese Verfahren arbeiten auf explizit f{\"u}r den Testvorgang entworfenen Modellimplementierungen, welche zwar teilweise Quelltext mit der Produktionssoftware gemein haben, aber viele Aspekte und potentielle Fehlerquellen einer tats{\"a}chlichen Software unber{\"u}cksichtigt lassen.

In diesem Artikel werden die Grundlagen von Testparadigmen beschrieben, welche die Ausf{\"u}hrung unmodifizierter Software erlauben und dabei erm{\"o}glichen, eine hohe Zuversicht in die getesteten Systeme zu gewinnen.
Der Fokus liegt dabei auf der Optimierung von Algorithmen um die redundante Ausf{\"u}hrung des Systems zu minimieren, wodurch sich die zum Testen ben{\"o}tigte Zeit um Gr{\"o}{\ss}enordnungen verringert.},
   url = {http://www.comsys.rwth-aachen.de/fileadmin/papers/2012/2012-soriadustmann-pik-effizient-sde.pdf},
   web_url = {http://www.degruyter.com/view/j/piko-2012-35-issue-4/pik-2012-0043/pik-2012-0043.xml?format=INT},
   misc2 = {Print},
   editor = {Otto Spaniol},
   publisher = {De Gruyter},
   language = {de},
   ISSN = {0930-5157},
   DOI = {10.1515/pik-2012-0043},
   author = {Soria Dustmann, Oscar}
}

@Inproceedings { 2012-taicpart-dustmann-symbolic-time,
   title = {Position Paper: Symbolic System Time in Distributed Systems Testing},
   year = {2012},
   month = {4},
   abstract = {We propose an extension of symbolic execution of distributed systems to test software parts related to timing.
Currently, the execution model is limited to symbolic input for individual nodes, not capturing the important class of timing errors resulting from varying network conditions.

In this paper, we introduce symbolic system time in order to systematically find timing-related bugs in distributed systems.
Instead of executing time events at a concrete time, we execute them at a set of times and analyse possible event interleavings on demand.
We detail on the resulting problem space, discuss possible algorithmic optimisations, and highlight our future research directions.},
   tags = {kleenet},
   url = {fileadmin/papers/2012/2012-04-taicpart-soriadustmann-symtime.pdf},
   booktitle = {TAICPART'2012},
   language = {en},
   reviewed = {1},
   author = {Soria Dustmann, Oscar and Sasnauskas, Raimondas and Wehrle, Klaus}
}

@Inproceedings { 2011-icdcs-sasnauskas-sde,
   title = {Scalable Symbolic Execution of Distributed Systems},
   year = {2011},
   month = {6},
   pages = {333-342},
   abstract = {Recent advances in symbolic execution have proposed a number of promising solutions to automatically achieve high-coverage and explore non-determinism during testing.
This attractive testing technique of unmodified software assists developers with concrete inputs and deterministic schedules to analyze erroneous program paths.

Being able to handle complex systems' software, these tools only consider single software instances and not their distributed execution which forms the core of distributed systems.
The step to symbolic distributed execution is however steep, posing two core challenges: (1) additional state growth and (2) the state intra-dependencies resulting from communication.

In this paper, we present SDE—a novel approach enabling scalable symbolic execution of distributed systems.
The key contribution of our work is two-fold.
First, we generalize the problem space of SDE and develop an algorithm significantly eliminating redundant states during testing.
The key idea is to benefit from the nodes' local communication minimizing the number of states representing the distributed execution.
Second, we demonstrate the practical applicability of SDE in testing with three sensornet scenarios running Contiki OS.},
   tags = {kleenet},
   url = {fileadmin/papers/2011/2011-06-icdcs-sasnauskas-sde.pdf},
   misc2 = {Druck},
   publisher = {IEEE Computer Society},
   address = {Los Alamitos, CA, USA},
   booktitle = {Proceedings of the 31st IEEE International Conference on Distributed Computing Systems (ICDCS 2011), June 2011, Minneapolis, MN, USA},
   language = {en},
   ISBN = {978-0-7695-4364-2},
   ISSN = {1063-6927},
   DOI = {10.1109/ICDCS.2011.28},
   reviewed = {1},
   author = {Sasnauskas, Raimondas and Soria Dustmann, Oscar and Kaminski, Benjamin Lucien and Weise, Carsten and Kowalewski, Stefan and Wehrle, Klaus}
}

@Inproceedings { 2010-sensys-sasnauskas-coojakleenet,
   title = {Demo Abstract: Integrating Symbolic Execution with Sensornet Simulation for Efficient Bug Finding},
   year = {2010},
   month = {11},
   pages = {383--384},
   abstract = {High-coverage testing of sensornet applications is vital for pre-deployment bug cleansing, but has previously been difficult due to the limited set of available tools. We integrate the KleeNet symbolic execution engine with the COOJA network simulator to allow for straight-forward and intuitive high-coverage testing initiated from a simulation environment. A tight coupling of simulation and testing helps detect, narrow down, and fix complex interaction bugs in an early development phase. We demonstrate the seamless transition between COOJA simulation and KleeNet symbolic execution. Our framework enables future research in how high-coverage testing tools could be used in cooperation with simulation tools.},
   tags = {kleenet},
   url = {fileadmin/papers/2010/2010-osterlind_sasnauskas-sensys-coojakleenet.pdf},
   misc2 = {Print},
   publisher = {ACM},
   address = {New York, NY, USA},
   booktitle = {Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems (SenSys 2010), Zurich, Switzerland},
   language = {en},
   ISBN = {978-1-4503-0344-6},
   DOI = {http://doi.acm.org/10.1145/1869983.1870034},
   reviewed = {1},
   author = {{\"O}sterlind, Fredrik and Sasnauskas, Raimondas and Dunkels, Adam and Soria Dustmann, Oscar and Wehrle, Klaus}
}