Sciweavers

5506 search results - page 758 / 1102
» Minimal Logic Programs
Sort
View
CC
2007
Springer
16 years 26 days ago
Correcting the Dynamic Call Graph Using Control-Flow Constraints
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
Byeongcheol Lee, Kevin Resnick, Michael D. Bond, K...
ECOOP
2007
Springer
16 years 26 days ago
On the Impact of Aspectual Decompositions on Design Stability: An Empirical Study
Although one of the main promises of aspect-oriented (AO) programming techniques is to promote better software changeability than objectoriented (OO) techniques, there is no empiri...
Phil Greenwood, Thiago T. Bartolomei, Eduardo Figu...
ESOP
2007
Springer
16 years 26 days ago
Static Analysis by Policy Iteration on Relational Domains
We give a new practical algorithm to compute, in finite time, a fixpoint (and often the least fixpoint) of a system of equations in the abstract numerical domains of zones and t...
Stephane Gaubert, Eric Goubault, Ankur Taly, Sarah...
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
16 years 5 days ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
APLAS
2004
ACM
16 years 3 days ago
An Implementation Scheme for XML Transformation Languages Through Derivation of Stream Processors
We propose a new implementation scheme for XML transformation languages through derivation of stream processors. Most of XML transformation languages are implemented as tree manipu...
Keisuke Nakano