TY - GEN
T1 - Schedulers as abstract interpretations of higher-dimensional automata
AU - Goubault, Eric
N1 - Publisher Copyright:
© 1995 ACM.
PY - 1995/6/23
Y1 - 1995/6/23
N2 - We define here a unified formal treatment for scheduling problems arising in different areas of computer science (implementation of concurrent languages, protocols for distribu-ted systems, pipeline management, concurrent databases. .) through abstract interpretation of Higher-Dimensional Automata (HDA) semantics. We give practical polynomial time algorithms for testing/inferring schedulers at the end of the article.
AB - We define here a unified formal treatment for scheduling problems arising in different areas of computer science (implementation of concurrent languages, protocols for distribu-ted systems, pipeline management, concurrent databases. .) through abstract interpretation of Higher-Dimensional Automata (HDA) semantics. We give practical polynomial time algorithms for testing/inferring schedulers at the end of the article.
U2 - 10.1145/215465.215577
DO - 10.1145/215465.215577
M3 - Conference contribution
AN - SCOPUS:85030171926
T3 - Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation
SP - 134
EP - 145
BT - Proceedings of the 1995 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM 1995
PB - Association for Computing Machinery
T2 - 1995 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM 1995
Y2 - 21 June 1995 through 23 June 1995
ER -