Sciweavers

258 search results - page 26 / 52
» Static Semantics as Program Transformation and Well-founded ...
Sort
View
HICSS
2007
IEEE
135views Biometrics» more  HICSS 2007»
14 years 2 months ago
Composable Language Extensions for Computational Geometry: A Case Study
— This paper demonstrates how two different sets of powerful domain specific language features can be specified and deployed as composable language extensions. These extensions...
Eric Van Wyk, Eric Johnson
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
14 years 3 days ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
ISTA
2003
13 years 9 months ago
Managing Business Logic with Symbolic Computation
: A new approach of building enterprise distributed applications for layer of business rules as standard part of architecture is proposed in this paper. The approach uses symbolic ...
Ruslan Shevchenko, Anatoly E. Doroshenko
IEEEPACT
1999
IEEE
14 years 8 days ago
The Effect of Program Optimization on Trace Cache Efficiency
Trace cache, an instruction fetch technique that reduces taken branch penalties by storing and fetching program instructions in dynamic execution order, dramatically improves inst...
Derek L. Howard, Mikko H. Lipasti
TCAD
2008
90views more  TCAD 2008»
13 years 7 months ago
Application and Verification of Local Nonsemantic-Preserving Transformations in System Design
Due to the increasing abstraction gap between the initial system model and a final implementation, the verification of the respective models against each other is a formidable task...
Tarvo Raudvere, Ingo Sander, Axel Jantsch