Sciweavers

2000 search results - page 142 / 400
» Program Transformation and Proof Transformation
Sort
View
130
Voted
CORR
2010
Springer
173views Education» more  CORR 2010»
15 years 3 months ago
Automatic Modular Abstractions for Template Numerical Constraints
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
David Monniaux
110
Voted
OOPSLA
2010
Springer
15 years 2 months ago
Ficticious: MicroLanguages for interactive fiction
In this paper we provide an experience report where language oriented programming approaches are applied to complex game design. Ficticious is a G-expression based pidgin of sever...
James Dean Palmer
232
Voted
MICRO
2012
IEEE
285views Hardware» more  MICRO 2012»
13 years 6 months ago
Automatic Extraction of Coarse-Grained Data-Flow Threads from Imperative Programs
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
Feng Li, Antoniu Pop, Albert Cohen
109
Voted
SIGADA
2005
Springer
15 years 9 months ago
Using ASIS to generate C++ bindings
In this paper, we describe an approach to automatically creating C++ bindings to Ada libraries utilizing capabilities of the Ada Semantic Interface Specification (ASIS). We discus...
Howard Ausden, Karl A. Nyberg
147
Voted
WCRE
1995
IEEE
15 years 7 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