Name
Abstract | ||
|---|---|---|
This paper is dedicated to the Rigorous Examination of Reactive Systems (RERS) Challenge 2018. We focus on changes and improvements compared to previous years. RERS again provided a large variety of verification benchmarks that foster the comparison of validation tools while featuring both sequential and parallel programs. In addition to reachability questions, the RERS Challenge is known for its linear temporal logic (LTL) properties, and RERS’18 extends the portfolio of verification tasks to computational tree logic (CTL). Modifications compared to the previous iteration include an enhanced generation of sequential benchmarks, an improved automation of the construction of parallel benchmarks, a redesigned penalty for wrong answers, and the addition of CTL properties. We illustrate our newly applied generation of parallel benchmarks in detail. |
Year | Venue | Field |
|---|---|---|
2018 | ISoLA | Computation tree logic,Computer science,Linear temporal logic,Portfolio,Theoretical computer science,Automation,Reachability,Reactive system,CTL* |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
8 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marc Jasper | 1 | 3 | 2.77 |
| Malte Mues | 2 | 1 | 4.08 |
| Maximilian Schlüter | 3 | 0 | 0.68 |
| Bernhard Steffen | 4 | 4239 | 423.70 |
| Falk Howar | 5 | 399 | 30.95 |