We propose a mechanism for alias control which is based on the Unified Modeling Language (UML). Specifically, we propose use of ownership and immutability constraints on UML associations and verification of these constraints through reverse engineering. These constraints inherently support software design principles, and impose requirements on the implementation that may help prevent serious program flaws. We propose implementation-level models for ownership and immutability that capture well the meaning of these concepts in modeling, and we develop novel static ownership and immutability inference analyses. We perform an empirical investigation on several relatively large Java programs. The results indicate that the inference analyses are precise and practical. Therefore, the analyses can be integrated in reverse engineering tools and can help support effective reasoning about software quality and software security. 1.
|
4828
|
Genetic Algorithms
– Goldberg
- 1989
|
|
4364
|
Elements of Information Theory
– Cover, Thomas
- 1991
|
|
2961
|
Pattern Classification and Scene Analysis
– Duba, Hart
- 1973
|
|
2217
|
Introduction to Modern Information Retrieval
– Salton, McGill
- 1983
|
|
2141
|
Learning Internal Representations by Error Propagation
– Rumelhart, Hinton, et al.
- 1986
|
|
1943
|
Snakes: Active contour models
– Kass, Witkin, et al.
- 1987
|
|
1790
|
Congestion avoidance and control
– Jacobson
- 1988
|
|
1651
|
R-trees: A dynamic index structure for spatial searching
– Guttman
- 1984
|
|
1463
|
Indexing by Latent Semantic Analysis
– Deerwester, Dumais, et al.
- 1990
|
|
1206
|
Introduction to Parallel Algorithms and Architectures: Arrays
– Leighton
- 1992
|
|
1103
|
A Tutorial on Support Vector Machines for Pattern Recognition
– Burges
- 1998
|
|
1042
|
Directed diffusion: A scalable and robust communication paradigm for sensor networks
– Intanagonwiwat, Govindan, et al.
- 2000
|
|
1009
|
editors. Foundations of Databases
– Abiteboul, Hull, et al.
- 1995
|
|
957
|
Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer
– Salton
|
|
894
|
A performance comparison of multi-hop wireless ad hoc network routing protocols
– Broch, Maltz, et al.
- 1998
|
|
880
|
System Architecture Directions for Networked Sensors
– Hill, Szewczyk, et al.
- 2000
|
|
845
|
Federated database systems for managing distributed, heterogeneous, and autonomous database
– Sheth, Larson
- 1990
|
|
805
|
Combinatorial Optimization: Algorithms and Complexity
– Papadimitriou, Steiglitz
- 1998
|
|
798
|
Mediators in the architecture of future information systems
– Wiederhold
- 1992
|
|
792
|
GPSR: Greedy perimeter stateless routing for wireless sensor networks
– Karp, Kung
- 2000
|
|
788
|
Near Shannon limit error-correcting coding and decoding: turbo codes
– Berrou, Glavieux, et al.
- 1993
|
|
735
|
Data Mining: Concepts and Techniques
– Han, Kamber
- 2000
|
|
682
|
W.: Query by Image and Video Content: The QBIC System
– Flickner, Sawhney, et al.
- 1997
|
|
645
|
Perturbation theory for linear operators
– Kato
- 1980
|
|
635
|
Generalized Additive Models
– Hastie, Tibshirani
- 1990
|
|
607
|
End-to-end Internet Packet Dynamics
– Paxson
- 1999
|
|
603
|
Querying heterogeneous information sources using source description
– Levy, Rajamaran, et al.
- 1996
|
|
574
|
Next century challenges: scalable coordination in sensor networks
– Estrin, Govindan, et al.
- 1999
|
|
569
|
Adaptive mixtures of local experts
– Jacobs, Jordan, et al.
- 1991
|
|
547
|
Tag: a tiny aggregation service for ad-hoc sensor networks
– Madden, Franklin, et al.
- 2002
|
|
533
|
Nearest neighbor pattern classification
– Cover, Hart
- 1967
|
|
520
|
Generalised linear models
– McCullagh, Nelder
- 1989
|
|
508
|
An energy-efficient MAC protocol for wireless sensor networks
– Ye, Heidemann, et al.
- 2002
|
|
489
|
Neural networks and the bias/variance dilemma
– Geman, Bienenstock, et al.
- 1992
|
|
484
|
R.S.J.: Wireless sensor networks for habitat monitoring
– Mainwaring, Culler, et al.
- 2002
|
|
453
|
The strength of weak learnability
– Schapire
- 1990
|
|
446
|
Statistical analysis with missing data
– Little, Rubin
- 1986
|
|
442
|
ªAn Optimal Algorithm for Approximate Nearest Neighbor Searching
– Arya, Mount, et al.
- 1994
|
|
440
|
Cross-Validatory Choice and Assessment of Statistical Predictions
– Stone
- 1974
|
|
439
|
Theory of communication
– Gabor
- 1946
|
|
439
|
Evolution Computation: Toward a New Philosophy of Machine Intelligence
– Fogel
- 1995
|
|
433
|
Optimal approximations by piecewise smooth functions and associated variational problems
– Mumford, Shah
- 1989
|
|
422
|
Shamos „Computational Geometry
– Preparata, M
- 1985
|
|
419
|
Emergence of simple-cell receptive field properties by learning a sparse code for natural images
– Olshausen, Field
|
|
410
|
An algorithm for finding best matches in logarithmic expected time
– Friedman, Bentley, et al.
- 1977
|
|
404
|
Active Contours
– Blake, Isard
- 1998
|
|
383
|
Photobook: Contentbased manipulation of image databases
– Pentland, Picard, et al.
- 1996
|
|
380
|
Sorting networks and their applications
– Batcher
- 1968
|
|
376
|
Efficient and effective querying by image content
– Faloutsos, Barber, et al.
- 1994
|
|
370
|
Programming Be Liberated From the von Neumann Style? A Functional Style and Its Algebra of Programs
– Backus, “Can
- 1978
|
