Raimondas Sasnauskas

dblp:49/5824 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 6 · 3 first-authorSoftware engineering, systems software and programming languages · 2Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
4 papers
Software testing · 60% Program analysis · 35% Debugging and program repair · 5%
Computer networks
4 papers
Routing and switching · 52% Internet of things and sensor networks · 40% Network performance modeling · 8%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program analysis
symbolic execution
0.232012
Integrating symbolic execution with sensornet simulation for efficient bug finding · SenSys 2010
KleeNet: automatic bug hunting in sensor network applications · SenSys 2008
Integration testing of protocol implementations using symbolic distributed execution · ICNP 2012
Software testing
integration testing
0.112012
Integration testing of protocol implementations using symbolic distributed execution · ICNP 2012
Software testing
protocol testing
0.112012
Integration testing of protocol implementations using symbolic distributed execution · ICNP 2012
Routing and switching
geographic routing
0.112010
Statistical vector based point-to-point routing in wireless networks · IPSN 2010
Routing and switching
wireless routing
0.112010
Statistical vector based point-to-point routing in wireless networks · IPSN 2010
Software testing
automated testing
0.112010
KleeNet: discovering insidious interaction bugs in wireless sensor networks before deployment · IPSN 2010
Network performance modeling
network simulation
0.012010
Integrating symbolic execution with sensornet simulation for efficient bug finding · SenSys 2010
Internet of things and sensor networks
wireless sensor network
0.012010
Statistical vector based point-to-point routing in wireless networks · IPSN 2010
Debugging and program repair
fault localization
0.012010
KleeNet: discovering insidious interaction bugs in wireless sensor networks before deployment · IPSN 2010
Internet of things and sensor networks › wireless sensor network
sensor network applications
0.012008
KleeNet: automatic bug hunting in sensor network applications · SenSys 2008

Methods — techniques the papers use, named apart from their topics

symbolic execution · 0.7nondeterministic event injection · 0.2network simulation · 0.2distributed execution · 0.1statistical vector routing · 0.1
YearPublicationVenuePosition
2018 A search-based approach for accurate identification of log message formats
abstract
Many software engineering activities process the events contained in log files. However, before performing any processing activity, it is necessary to parse the entries in a log file, to retrieve the actual events recorded in the log. Each event is denoted by a log message, which is composed of a fixed part---called (event) template---that is the same for all occurrences of the same event type, and a variable part, which may vary with each event occurrence. The formats of log messages, in complex and evolving systems, have numerous variations, are typically not entirely known, and change on a frequent basis; therefore, they need to be identified automatically.
Salma Messaoudi, Annibale Panichella, Domenico Bianculli, Lionel C. Briand, Raimondas Sasnauskas
ICPC5
2017 VSOC - A Virtual Security Operating Center
abstract
Security in virtualised environments is becoming increasingly important for institutions, not only for a firm's own on-site servers and network but also for data and sites that are hosted in the cloud. Today, security is either handled globally by the cloud provider, or each customer needs to invest in its own security infrastructure. This paper proposes a Virtual Security Operation Center (VSOC) that allows to collect, analyse and visualize security related data from multiple sources. For instance, a user can forward log data from its firewalls, applications and routers in order to check for anomalies and other suspicious activities. The security analytics provided by the VSOC are comparable to those of commercial security incident and event management (SIEM) solutions, but are deployed as a cloud-based solution with the additional benefit of using big data processing tools to handle large volumes of data. This allows us to detect more complex attacks that cannot be detected with todays signature-based (i.e. rules) SIEM solutions.
Eric Falk, Stefan Repcek, Beltran Borja Fiz Pontiveros, Stefan Hommes, Radu State, Raimondas Sasnauskas
GLOBECOM6
2012 Integration testing of protocol implementations using symbolic distributed execution
abstract
Automatism and high-coverage are the core challenges in testing communication protocols in their early development phase. Ideally, the testing process should cope with a large input space, several sources of non-determinism, and heterogeneous operating environments to effectively explore the emerging execution paths. In practice, however, the missing tool support imposes a huge amount of manual effort to perform integrated conformance and interoperability testing of protocol implementations. In this paper, we first detail on the protocol testing issues, such as low coverage, missing code and automation, we experienced during the lifetime of an university-industry project. Second, we present SymNet, an integrated testing environment which targets the latter limitations using state-of-the-art symbolic execution techniques. Our approach is to interconnect several virtual machines, execute each of them using selective symbolic execution, and centrally coordinate the emerging distributed execution paths. The key challenges are the synchronization of distributed constraints, detection of false positives, and pruning of redundant execution states. We detail on SymNet architecture, show its applicability to real-world protocol software, and discuss future research directions.
Raimondas Sasnauskas, Philipp Kaiser, Russ Lucas Jukic, Klaus Wehrle
ICNP1
2012 Symbolic System Time in Distributed Systems Testing
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 interleaving son demand. We detail on the resulting problem space, discuss possible algorithmic optimisations, and highlight our future research directions.
Oscar Soria Dustmann, Raimondas Sasnauskas, Klaus Wehrle
ICST2
2011 Scalable Symbolic Execution of Distributed Systems
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 sensor net scenarios running Contiki OS.
Raimondas Sasnauskas, Oscar Soria Dustmann, Benjamin Lucien Kaminski, Klaus Wehrle, Carsten Weise, Stefan Kowalewski
ICDCS1
2010 Statistical vector based point-to-point routing in wireless networks
abstract
We present Statistical Vector Routing (SVR), a protocol that efficiently deals with communication link dynamics in wireless networks. It assigns virtual coordinates to nodes based on the statistical distribution of their distance from a small set of beacons. The distance metric predicts the current location of a node in its address distribution. Our initial results from a prototype implementation over real testbeds demonstrate the feasibility of SVR.
Muhammad Hamad Alizai, Tobias Vaegs, Olaf Landsiedel, Raimondas Sasnauskas, Klaus Wehrle
IPSN4
2010 KleeNet: discovering insidious interaction bugs in wireless sensor networks before deployment
abstract
Complex interactions and the distributed nature of wireless sensor networks make automated testing and debugging before deployment a necessity. A main challenge is to detect bugs that occur due to non-deterministic events, such as node reboots or packet duplicates. Often, these events have the potential to drive a sensor network and its applications into corner-case situations, exhibiting bugs that are hard to detect using existing testing and debugging techniques.
Raimondas Sasnauskas, Olaf Landsiedel, Muhammad Hamad Alizai, Carsten Weise, Stefan Kowalewski, Klaus Wehrle
IPSN1
2010 Integrating symbolic execution with sensornet simulation for efficient bug finding
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.
Fredrik Österlind, Adam Dunkels, Raimondas Sasnauskas, Oscar Soria Dustmann, Klaus Wehrle
SenSys3
2008 KleeNet: automatic bug hunting in sensor network applications
abstract
We present KleeNet, a Klee based bug hunting tool for sensor network applications before deployment. KleeNet automatically tests code for all possible inputs, ensures memory safety, and integrates well into TinyOS based application development life cycle, making it easy for developers to test their applications.
Raimondas Sasnauskas, Jó Ágila Bitsch, Muhammad Hamad Alizai, Klaus Wehrle
SenSys1