A Contract-Based Approach to Scheduling and Verification of Dynamic Dataflow Networks

A4 Konferenspublikationer


Interna författare/redaktörer


Publikationens författare: Jonatan Wiik, Johan Ersfolk, Marina Waldén
Redaktörer: Derler Patricia, Gao Sicun
Publiceringsår: 2018
Förläggare: IEEE
Moderpublikationens namn: 2018 16th ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE 2018)
Artikelns första sida, sidnummer: 1
Artikelns sista sida, sidnummer: 10
ISBN: 978-1-5386-6196-3
eISBN: 978-1-5386-6195-6


Abstrakt

Restricted dataflow models of computation have gained widespread adoption in the safety-critical and real-time domains. As more complex functionality is being incorporated in embedded systems, there is a need for more expressive languages while maintaining high analysability. We present a contract-based approach to specification, scheduling and verification of dynamic dataflow networks. The approach is based on finding static schedules based on contracts and utilising this information in the verification process to reduce the number of invariant annotations needed. Moreover, we show that contracts can be used to make compile-time scheduling decisions, hence, improving runtime performance.


Nyckelord

Dataflow programming, Design-by-Contract, Formal verification, Quasi-static scheduling

Senast uppdaterad 2019-14-11 vid 03:13