1882 search results - page 89 / 377 » Transformational Programming and Forests |
ISMVL
1999
IEEE
15 years 2 months ago
1999
IEEE
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...
SAC
2006
ACM
14 years 9 months ago
2006
ACM
We propose a rule-based approach for transforming B abstract machines into UML diagrams. We believe that important insight into the structure underlying a B model can be gained by...
ICALP
2000
Springer
15 years 1 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...
SFP
2004
14 years 11 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...
103
click to vote
PDSE
1998
14 years 11 months ago
1998
This paper proposes a theoretical framework for verifying and deriving code optimizations for programs written in parallel programming languages. The key idea of this framework is...