Sciweavers

30 search results - page 5 / 6
» Fold and Unfold for Program Semantics
Sort
View
INFSOF
1998
73views more  INFSOF 1998»
13 years 7 months ago
Restructuring programs by tucking statements into functions
Changing the internal structure of a program without changing its behavior is called restructuring. This paper presents a transformation called tuck for restructuring programs by ...
Arun Lakhotia, Jean-Christophe Deprez
CJ
2010
150views more  CJ 2010»
13 years 5 months ago
Program Analysis Probably Counts
Abstract. Semantics-based program analysis uses an abstract semantics of programs/systems to statically determine run-time properties. Classic examples from compiler technology inc...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
FOAL
2009
ACM
14 years 2 months ago
A type system for functional traversal-based aspects
We present a programming language model of the ideas behind Functional Adaptive Programming (AP-F) and our Java implementation, DemeterF. Computation in AP-F is encapsulated in se...
Bryan Chadwick, Karl J. Lieberherr
POPL
2002
ACM
14 years 7 months ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
EUROCAST
2001
Springer
118views Hardware» more  EUROCAST 2001»
14 years 1 days ago
A Language Prototyping Tool Based on Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from semantic specifications. The theoretical basis of our system is the integrat...
José Emilio Labra Gayo, Juan Manuel Cueva L...