Abstract | ||
---|---|---|
In industrial practice today, correctness of software is rarely verified using formal techniques. One reason is the lack of specification languages for this application area that are both comprehensible and sufficiently expressive. We present the concepts and logical foundations of generalised test tables – a specification language for reactive systems accessible for practitioners. Generalised test tables extend the concept of test tables, which are already frequently used in quality management of reactive systems. The main idea is to allow more general table entries, thus enabling a table to capture not just a single test case but a family of similar behavioural cases. The semantics of generalised test tables is based on a two-party game over infinite words. |
Year | Venue | Field |
---|---|---|
2017 | IFM | Specification language,Programming language,Computer science,Correctness,Theoretical computer science,Software,Reactive system,Semantics,Quality management |
DocType | Citations | PageRank |
Conference | 2 | 0.47 |
References | Authors | |
4 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Bernhard Beckert | 1 | 862 | 86.50 |
Suhyun Cha | 2 | 2 | 1.82 |
Mattias Ulbrich | 3 | 183 | 17.83 |
Vogel-Heuser, B. | 4 | 521 | 125.47 |
Alexander Weigl | 5 | 11 | 4.22 |