Reliable and Reproducible Competition Results with BenchExec and Witnesses (Report on SV-COMP 2016)
Abstract elided by the publisher.
1,553 papers · page 34 of 78
Abstract elided by the publisher.
This paper describes the xSAP safety analysis platform. xSAP provides several model-based safety analysis features for finite- and infinite-state synchronous transition systems. In particular, it supports library-based definition of fault modes, an automatic model extension facil…
Abstract elided by the publisher.
The coverability problem for Petri nets plays a central role in the verification of concurrent shared-memory programs. However, its high EXPSPACE-complete complexity poses a challenge when encountered in real-world instances. In this paper, we develop a new approach to this probl…
Abstract elided by the publisher.
We present the open-source tool T2, the first public release from the TERMINATOR projecti??[9]. T2 has been extended over the past decade to support automatic temporal-logic proving techniques and to handle a general class of user-provided liveness and safety properties. Input ca…
Abstract elided by the publisher.
We present an algorithm to compute exact aggregations of a class of systems of ordinary differential equations ODEs. Our approach consists in an extension of Paige and Tarjan's seminal solution to the coarsest refinement problem by encoding an ODE system into a suitable discrete-…
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
Many runtime verification tools are built based on Aspect-Oriented Programming (AOP) tools, most often AspectJ, a mature implementation of AOP for Java. Although already popular in the Java domain, there is few work on runtime verification of C programs via AOP, due to the lack o…
Abstract elided by the publisher.
Abstract elided by the publisher.
We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly con…
Abstract elided by the publisher.
Abstract elided by the publisher.
Complex probabilistic temporal behaviours need to be guaranteed in robotics and various other control domains, as well as in the context of families of randomized protocols. At its core, this entails checking infinite-state probabilistic systems with respect to quantitative prope…
Abstract elided by the publisher.
Abstract elided by the publisher.