Sciweavers

7103 search results - page 214 / 1421
» Components and Generative Programming
Sort
View
IEEEINTERACT
2003
IEEE
14 years 2 months ago
High Performance Code Generation through Lazy Activation Records
For call intensive programs, function calls are major bottlenecks during program execution since they usually force register contents to be spilled into memory. Such register to m...
Manoranjan Satpathy, Rabi N. Mahapatra, Siddharth ...
BIOINFORMATICS
2006
106views more  BIOINFORMATICS 2006»
13 years 9 months ago
Identification of biochemical networks by S-tree based genetic programming
Motivation: Most previous approaches to model biochemical networks havefocusedeither on the characterization of a networkstructurewith a number of components or on the estimation ...
Dong-Yeon Cho, Kwang-Hyun Cho, Byoung-Tak Zhang
CACM
1999
92views more  CACM 1999»
13 years 9 months ago
Putting OO Distributed Programming to Work
stractions underlying distributed computing. We attempted to keep our preaims at an abstract and general level. In this column, we make those claims more concrete. More precisely, ...
Pascal Felber, Rachid Guerraoui, Mohamed Fayad
ICSE
1999
IEEE-ACM
14 years 1 months ago
Avoiding Packaging Mismatch with Flexible Packaging
To integrate a software component into a system, it must interact properly with the system's other components. Unfortunately,the decisions about how a component is to interac...
Robert DeLine
POPL
2001
ACM
14 years 9 months ago
Avoiding exponential explosion: generating compact verification conditions
Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. ...
Cormac Flanagan, James B. Saxe