Rigorous examination of reactive systems

Howar, Falk; Isberner, Malte; Merten, Maik; Steffen, Bernhard; Beyer, Dirk; Păsăreanu, Corina S.

doi:10.1007/s10009-014-0337-y

Cited by 36 publications

(14 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Comparison with other competitions Over the past fifteen years, the arise of several software tool competitions [2,21,54,55,59,84] has deeply contributed to advance the state of the art in the computer-aided verification technology. The international SAT solver competition [59] is a pioneer example with a long track record of editions starting from 2002.…”

Section: Lessons Learned and Discussionmentioning

confidence: 99%

“…In the area of software verification, there are three related competitions that have been recently introduced: SV-COMP [21], VerifyThis [55] and RERS Challenge [54]. SV-COMP initiated in 2011 within TACAS [1] community with the aim to compare tools for software model checking.…”

Section: Lessons Learned and Discussionmentioning

confidence: 99%

“…The Rigorous Examination of Reactive Systems (RERS) challenge [54] follows a similar problem-centred approach of VerifyThis in contrast to a more tool-centred approach followed in CRV. The goal of the RERS challenge is to evaluate the effectiveness of various verification and validation approaches on reactive systems (RS), focusing on the analysis of a particular class of RS called event-condition-action (ECA) systems.…”

Section: Lessons Learned and Discussionmentioning

confidence: 99%

“…For these reasons, inspired by the success of similar events in other areas of computer-aided verification (e.g., SAT [59], SV-COMP [20], SMT [2], RERS [53,54]), Ezio Bartocci, Borzoo Bonakdarpour, and Yliès Falcone organized the first international Competition on Runtime Verification (CRV 2014) with the aim to foster the process of comparison and evaluation of software runtime verification tools.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

First international Competition on Runtime Verification: rules, benchmarks, tools, and final results of CRV 2014

Bartocci

Falcone

Bonakdarpour

et al. 2017

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

The first international Competition on Runtime Verification (CRV) was held in September 2014, in Toronto, Canada, as a satellite event of the 14th international conference on Runtime Verification (RV'14). The event was organized in three tracks: (1) offline monitoring, (2) online monitoring of C programs, and (3) online monitoring of Java programs. In this paper, we report on the phases and rules, a description of the participating teams and their submitted benchmark, the (full) results, as well as the lessons learned from the competition.

show abstract

Section: Lessons Learned and Discussionmentioning

confidence: 99%

Section: Lessons Learned and Discussionmentioning

confidence: 99%

Section: Lessons Learned and Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

First international Competition on Runtime Verification: rules, benchmarks, tools, and final results of CRV 2014

Bartocci

Falcone

Bonakdarpour

et al. 2017

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

show abstract

“…LTSmin participated in the RERS [28,42] challenges of 2012, 2013 [41] and 2014, winning several first prizes. The flexibility of LTSmin allowed us to address the RERS challenge problems from different angles.…”

Section: Attacking the Rers Challengementioning

confidence: 99%

LTSmin: High-Performance Language-Independent Model Checking

Kant

Laarman

Meijer

et al. 2015

Tools and Algorithms for the Construction and Analysis of Systems

121

105

View full text Add to dashboard Cite

In recent years, the LTSmin model checker has been extended with support for several new modelling languages, including probabilistic (Mapa) and timed systems (Uppaal). Also, connecting additional language front-ends or ad-hoc state-space generators to LTSmin was simplified using custom C-code. From symbolic and distributed reachability analysis and minimisation, LTSmin's functionality has developed into a model checker with multi-core algorithms for on-the-fly LTL checking with partial-order reduction, and multi-core symbolic checking for the modal µ-calculus, based on the multi-core decision diagram package Sylvan. In LTSmin, the modelling languages and the model checking algorithms are connected through a Partitioned Next-State Interface (Pins), that allows to abstract away from language details in the implementation of the analysis algorithms and on-the-fly optimisations. In the current paper, we present an overview of the toolset and its recent changes, and we demonstrate its performance and versatility in two case studies.

show abstract