Sciweavers

413 search results - page 17 / 83
» A formalism for functionality preserving system level transf...
Sort
View
ENTCS
2006
176views more  ENTCS 2006»
13 years 8 months ago
Automatic Formal Synthesis of Hardware from Higher Order Logic
A compiler that automatically translates recursive function definitions in higher order logic to clocked synchronous hardware is described. Compilation is by mechanised proof in t...
Mike Gordon, Juliano Iyoda, Scott Owens, Konrad Sl...
POPL
1995
ACM
13 years 11 months ago
Total Correctness by Local Improvement in Program Transformation
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...
David Sands
WCRE
1993
IEEE
14 years 4 days ago
A Practical Program Transformation System for Reverse Engineering
Program transformation systems provide one means of formally deriving a program from its speci cation. The main advantage of this development method is that the executable program...
M. Ward, K. Bennett
MPC
2010
Springer
165views Mathematics» more  MPC 2010»
14 years 24 days ago
Dependently Typed Grammars
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
Kasper Brink, Stefan Holdermans, Andres Löh
AGTIVE
2007
Springer
14 years 1 days ago
Model-Driven Software Development with Graph Transformations: A Comparative Case Study
Abstract. Significant achievements have been made in the design and implementation of languages and tools for graph transformation systems. However, many other competing approaches...
Thomas Buchmann, Alexander Dotor, Sabrina Uhrig, B...