Sciweavers

4719 search results - page 214 / 944
» Newtonian program analysis
Sort
View
SAS
1999
Springer
15 years 8 months ago
Eliminating Dead Code on Recursive Data
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
Yanhong A. Liu, Scott D. Stoller
SIGADA
1998
Springer
15 years 8 months ago
Looking into Safety with the Safety and Security Rapporteur Group
The requirements of High Integrity safety-critical, secure and mission-critical Software force developers to use specialised development techniques. Often the choice of computer l...
Stephen Michell, Mark Saaltink, Brian A. Wichmann
JPDC
2011
137views more  JPDC 2011»
14 years 7 months ago
Transparent runtime parallelization of the R scripting language
Scripting languages such as R and Matlab are widely used in scientific data processing. As the data volume and the complexity of analysis tasks both grow, sequential data process...
Jiangtian Li, Xiaosong Ma, Srikanth B. Yoginath, G...
168
Voted
FASE
2011
Springer
14 years 8 months ago
Theoretical Aspects of Compositional Symbolic Execution
Given a program and an assertion in that program, determining if the assertion can fail is one of the key applications of program analysis. Symbolic execution is a well-known techn...
Dries Vanoverberghe, Frank Piessens
ECOOP
2004
Springer
15 years 10 months ago
Pointer Analysis in the Presence of Dynamic Class Loading
Many compiler optimizations and software engineering tools need precise pointer analyses to be effective. Unfortunately, many Java features, such as dynamic class loading, refle...
Martin Hirzel, Amer Diwan, Michael Hind