Sciweavers

168 search results - page 13 / 34
» Imperative Program Transformation by Rewriting
Sort
View
ENTCS
2008
114views more  ENTCS 2008»
14 years 9 months ago
Term-graph Rewriting in Tom Using Relative Positions
In this paper, we present the implementation in Tom of a de Bruijn indices generalization allowing the representation of term-graphs over an algebraic signature. By adding pattern...
Emilie Balland, Paul Brauner
WCRE
1995
IEEE
15 years 1 months ago
Strongest Postcondition Semantics as the Formal Basis for Reverse Engineering
Reverse engineering of program code is the process of constructing a higher level abstraction of an implementation in order to facilitate the understanding of a system that may be...
Gerald C. Gannod, Betty H. C. Cheng
ENTCS
2008
90views more  ENTCS 2008»
14 years 9 months ago
Instantaneous Transitions in Esterel
Esterel is an imperative synchronous programming language for the specification of deterministic concurrent reactive systems. While providing the usual control-flow constructs--se...
Olivier Tardieu, Stephen A. Edwards
70
Voted
ICCL
1998
IEEE
15 years 1 months ago
Modular Compilers Based on Monad Transformers
The monadic style of language speci cation has the advantages of modularity and extensibility: it is simple to add or change features in an interpreter to re ect modi cations in t...
William L. Harrison, Samuel N. Kamin
ICFP
2003
ACM
15 years 9 months ago
Compiler implementation in a formal logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
Jason Hickey, Aleksey Nogin, Adam Granicz