Name
Abstract | ||
|---|---|---|
Several methods have been proposed for performing schedulability analysis for both uni-processor and multi-processor real-time systems. Very few of these works use the power of formal logic to write unambiguous specifications and to allow the usage of theorem provers for building the proofs of interest with greater correctness guarantees. In this paper we address this challenge by: 1) defining a formal language that allows to specify periodic resource models; 2) describe a transformational approach to reasoning about timing properties of resource models by transforming the latter specifications into a satisfiability modulo theories problem.
|
Year | Venue | Keywords |
|---|---|---|
2017 | SIGBED Review | compositional, embedded systems, hard real-time systems, schedulability analysis, temporal logic |
DocType | Volume | Issue |
Journal | 14 | 3 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| André de Matos Pedro | 1 | 6 | 2.21 |
| David Pereira | 2 | 33 | 8.05 |
| Luís Miguel Pinho | 3 | 250 | 33.56 |
| Jorge Sousa Pinto | 4 | 160 | 23.19 |