221 search results - page 19 / 45 » Analyzing the Implicit Computational Complexity of object-or... |
IPPS
1996
IEEE
15 years 1 months ago
1996
IEEE
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
JMLR
2012
13 years 2 days ago
2012
We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combi...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Static analysis is a powerful technique for automatic verification of programs but raises major engineering challenges when developing a full-fledged analyzer for a reali...
CHI
2005
ACM
15 years 10 months ago
2005
ACM
The development of programming skills is a motivating issue in computer science. Programming languages have been increasingly used to map end-users needs and mental models. The nu...
102
click to vote
AGP
1996
IEEE
15 years 1 months ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...