Sciweavers

2000 search results - page 307 / 400
» Program Transformation and Proof Transformation
Sort
View
132
Voted
AICCSA
2001
IEEE
131views Hardware» more  AICCSA 2001»
15 years 7 months ago
Constraint-Based Timetabling-A Case Study
This paper2 details the stages of building a substantial, carefully specified, fully tested and fully operational university and school timetabling system. This is reported as a c...
Abdulwahed M. Abbas, Edward P. K. Tsang
162
Voted
DBPL
1995
Springer
144views Database» more  DBPL 1995»
15 years 7 months ago
An Algebraic Framework for Physical OODB Design
Physical design for object-oriented databases is still in its infancy. Implementation decisions often intrude into the conceptual design (such as inverse links and object decompos...
Leonidas Fegaras, David Maier
132
Voted
FPGA
1995
ACM
120views FPGA» more  FPGA 1995»
15 years 7 months ago
Synthesis of Signal Processing Structured Datapaths for FPGAs Supporting RAMs and Busses
A novel approach is presented for transforming a given scheduled and bound signal processing algorithm for a multiplexer based datapath to a BUS/RAM based FPGA datapath. A datapat...
Baher Haroun, Behzad Sajjadi
SAS
1997
Springer
111views Formal Methods» more  SAS 1997»
15 years 7 months ago
Fast and Effective Procedure Inlining
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
Oscar Waddell, R. Kent Dybvig
139
Voted
FLOPS
2008
Springer
15 years 5 months ago
Semantics and Pragmatics of New Shortcut Fusion Rules
We study various shortcut fusion rules for languages like Haskell. Following a careful semantic account of a recently proposed rule for circular program transformation, we propose ...
Janis Voigtländer