The Manchester prototype dataflow computer
Communications of the ACM - Special section on computer architecture
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
A Calculus of Communicating Systems
A Calculus of Communicating Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Proceedings of the First Imperial College Department of Computing Workshop on Theory and Formal Methods
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Globally-asynchronous locally-synchronous systems (performance, reliability, digital)
Globally-asynchronous locally-synchronous systems (performance, reliability, digital)
The regular-language semantics of second-order idealized ALGOL
Theoretical Computer Science
Syntactic control of concurrency
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Simulation and Verification of Asynchronous Systems by means of a Synchronous Model
ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
Geometry of synthesis: a structured approach to VLSI design
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Applications of Game Semantics: From Program Analysis to Hardware Synthesis
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Trace Semantics is Fully Abstract
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Geometry of synthesis III: resource management through type inference
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Synchronous game semantics via round abstraction
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Geometry of synthesis iv: compiling affine recursion into static hardware
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
We revisit a technique called round abstraction as a solution to the problem of building low-latency synchronous systems from asynchronous specifications. We use a trace-semantic setting akin to Abramsky's Interaction Categories, which is also a generalisation of pointer-free game semantic models. We define partial and total correctness for round abstraction relative to composition and note that in its most general case, round abstraction can lead to incorrect behaviour. We then identify sufficient properties to guarantee partially correct composition. Finally, we propose a framework for round abstraction that is totally correct when applied to asynchronous behaviours. We apply this procedure to the Geometry of Synthesis, a technique for compiling higher-order imperative programming languages into digital circuits using game semantics.