You are here: TUCS > PUBLICATIONS > Publication Search > A Contract-Based Approach to S...
A Contract-Based Approach to Scheduling and Verification of Dynamic Dataflow Networks
Jonatan Wiik, Johan Ersfolk, Marina Waldén, A Contract-Based Approach to Scheduling and Verification of Dynamic Dataflow Networks. In: Patricia Derler, Sicun Gao (Eds.), Proceedings of the 16th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE2018), 1–10, IEEE Computer Society, 2018.
http://dx.doi.org/10.1109/MEMCOD.2018.8557004
Abstract:
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.
BibTeX entry:
@INPROCEEDINGS{inpWiErWa18a,
title = {A Contract-Based Approach to Scheduling and Verification of Dynamic Dataflow Networks},
booktitle = {Proceedings of the 16th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE2018)},
author = {Wiik, Jonatan and Ersfolk, Johan and Waldén, Marina},
editor = {Derler, Patricia and Gao, Sicun},
publisher = {IEEE Computer Society},
pages = {1–10},
year = {2018},
keywords = {Design-by-Contract, Dataflow programming, Formal verification, Quasi-static scheduling},
}
Belongs to TUCS Research Unit(s): Distributed Systems Laboratory (DS Lab)