Computer Science – Logic in Computer Science
Scientific paper
2011-01-25
EPTCS 46, 2011, pp. 28-48
Computer Science
Logic in Computer Science
In Proceedings FIT 2010, arXiv:1101.4266
Scientific paper
10.4204/EPTCS.46.3
In this paper we propose an algebra of synchronous scheduling interfaces which combines the expressiveness of Boolean algebra for logical and functional behaviour with the min-max-plus arithmetic for quantifying the non-functional aspects of synchronous interfaces. The interface theory arises from a realisability interpretation of intuitionistic modal logic (also known as Curry-Howard-Isomorphism or propositions-as-types principle). The resulting algebra of interface types aims to provide a general setting for specifying type-directed and compositional analyses of worst-case scheduling bounds. It covers synchronous control flow under concurrent, multi-processing or multi-threading execution and permits precise statements about exactness and coverage of the analyses supporting a variety of abstractions. The paper illustrates the expressiveness of the algebra by way of some examples taken from network flow problems, shortest-path, task scheduling and worst-case reaction times in synchronous programming.
No associations
LandOfFree
An Algebra of Synchronous Scheduling Interfaces does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Algebra of Synchronous Scheduling Interfaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Algebra of Synchronous Scheduling Interfaces will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-541824