Resource control for synchronous cooperative threads
From MaRDI portal
Publication:2503040
DOI10.1016/j.tcs.2006.01.017zbMath1097.68024MaRDI QIDQ2503040
Roberto M. Amadio, Silvano Dal Zilio
Publication date: 13 September 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
virtual machineterminationsynchronous programmingbytecode verificationquasi-interpretationsresource bound
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasi-interpretations. A way to control resources
- Clocks in dataflow languages
- The Esterel synchronous programming language: Design, semantics, implementation
- A new recursion-theoretic characterization of the polytime functions
- Synchronous Kahn networks
- Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
- The strength of non-size increasing computation
- Foundations of Software Science and Computation Structures
- Programming Languages and Systems
- Computer Science Logic