2000 search results - page 111 / 400 » Program Transformation and Proof Transformation |
126
Voted
DAGSTUHL
2007
15 years 4 months ago
2007
The model-based transformation of loop programs is a way of detecting fine-grained parallelism in sequential programs. One of the challenges is to agglomerate the parallelism to a...
134
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
Graph processes are used in order to formalize the relation between global requirement specifications of multi-agent systems by means of message sequence charts, and implementatio...
104
click to vote
SFP
2004
15 years 4 months ago
2004
: In previous work we showed how to verify a compiler for a small language with exceptions. In this article we show how to calculate, as opposed to an abstract machine for this lan...
125
click to vote
CASES
2001
ACM
15 years 7 months ago
2001
ACM
Synchronous programming languages have proved to be advantageous for designing software and hardware for embedded systems. Despite their clear semantics, their compilation is rema...
135
Voted
AUTOMATICA
2008
15 years 3 months ago
2008
In this paper we show how the symmetry present in many linear systems can be exploited to significantly reduce the computational effort required for controller synthesis. This app...