Filters








29,925 Hits in 6.8 sec

Minimization of Time & Cost Factors with Optimized Program-States Using Exception-Handling Constructs in Java (During Analysis and Testing of Programs)

Pawan Nagar
2012 IOSR Journal of Engineering  
The support for precise exceptions in optimizing Java program states, combined with frequent checks for runtime exceptions, leads to severe limitations on the compiler's ability to perform program optimizations  ...  We first present a formulated way for analysing the problem caused in coded program and its related Exception-handling constructs, and a methodology, to identify the subset of program state that needs  ...  Singh for their help in Java Run Time Environment and in Programming related Issues.  ... 
doi:10.9790/3021-0204609615 fatcat:ak6socxwpjcw7jp7ssrrthw35u

SawjaCard: A Static Analysis Tool for Certifying Java Card Applications [chapter]

Frédéric Besson, Thomas Jensen, Pierre Vittet
2014 Lecture Notes in Computer Science  
The tool is built around a static analysis engine which uses a combination of numeric and heap analysis. It includes a model of the Java Card libraries and the Java Card firewall.  ...  Java Card is a dialect of Java designed for programming multi-application smart cards and the tool, called SawjaCard, has been specialised for the particular Java Card programming patterns.  ...  We thank Delphine Demange, Vincent Monfort and David Pichardie for their contributions to the development of the tool.  ... 
doi:10.1007/978-3-319-10936-7_4 fatcat:6smbf5t5cjcpllfd626gf2ryba

Strictly declarative specification of sophisticated points-to analyses

Martin Bravenboer, Yannis Smaragdakis
2009 Proceeding of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications - OOPSLA 09  
We present the Doop framework for points-to analysis of Java programs.  ...  For the exact same logical points-to definitions (and, consequently, identical precision) Doop is more than 15x faster than Paddle for a 1-call-site sensitive analysis of the DaCapo benchmarks, with lower  ...  We thank Ondřej Lhoták for his advice on benchmarking Paddle, Oege de Moor and Molham Aref for useful discussions, the anonymous reviewers for helpful comments, and the LogicBlox developers for their practical  ... 
doi:10.1145/1640089.1640108 dblp:conf/oopsla/BravenboerS09 fatcat:gdpo46vhcrckdirazq6ooh5hyi

Strictly declarative specification of sophisticated points-to analyses

Martin Bravenboer, Yannis Smaragdakis
2009 SIGPLAN notices  
We present the Doop framework for points-to analysis of Java programs.  ...  For the exact same logical points-to definitions (and, consequently, identical precision) Doop is more than 15x faster than Paddle for a 1-call-site sensitive analysis of the DaCapo benchmarks, with lower  ...  We thank Ondřej Lhoták for his advice on benchmarking Paddle, Oege de Moor and Molham Aref for useful discussions, the anonymous reviewers for helpful comments, and the LogicBlox developers for their practical  ... 
doi:10.1145/1639949.1640108 fatcat:py2qetnvifekndfjzoe52j554y

Exception analysis in the Java Native Interface

Siliang Li, Gang Tan
2014 Science of Computer Programming  
It finds bugs of inconsistent exception declarations and bugs of mishandling JNI exceptions. TurboJet is carefully engineered to achieve both high efficiency and accuracy.  ...  One typical FFI is the Java Native Interface (JNI), through which Java programs can invoke native-code components developed in C, C++, or assembly code.  ...  Acknowledgment We would like to thank Martin Hirzel and Kathryn McKinley for their helpful comments. We also want to thank the anonymous reviewers for their constructive comments.  ... 
doi:10.1016/j.scico.2014.01.018 fatcat:3plwnryatzawrjvupdpoofbr34

Static Program Analysis for Java Card Applets [chapter]

Vasilios Almaliotis, Alexandros Loizidis, Panagiotis Katsaros, Panagiotis Louridas, Diomidis Spinellis
2008 Lecture Notes in Computer Science  
Several characteristics of the Java Card applets and their multiple-entry-point program structure make it possible for a potentially unhandled exception to reach the invoked entry point.  ...  Our work introduces automatic static program analysis as a means for the early detection of misused and therefore dangerous API calls.  ...  Acknowledgments This work was supported by the funds of the bilateral research programme between Greece and Cyprus, Greek General Research Secretariat, 2006-2008.  ... 
doi:10.1007/978-3-540-85893-5_2 fatcat:qj4tvdigfjd57cslh5qwbdmzme

Precise Constraint-Based Type Inference for Java [chapter]

Tiejun Wang, Scott F. Smith
2001 Lecture Notes in Computer Science  
Precise type information is invaluable for analysis and optimization of object-oriented programs.  ...  The system is implemented for the full Java language, and is used to statically verify the correctness of Java downcasts.  ...  The analysis we produce here is perhaps the most precise constraint-based analysis for object-oriented programs thus far developed.  ... 
doi:10.1007/3-540-45337-7_6 fatcat:bgebx5t5ijhh3c6pbzwmum4hva

A Survey on Regression Test Selection Techniques on Aspect-Oriented Programming

Neerja Gupta, Arun Prakash Agrawal, Abhishek Singhal
2012 International Journal of Computer Applications  
Therefore, this paper proposes the techniques used for object oriented programs and for aspect oriented programming.  ...  Unfortunately the already existing approaches of object oriented programming does not work out for aspect oriented programming because of the following new features of aspects such as join points ,crosscutting  ...  This technique uses dynamic analysis to record coverage information for P and P' and static analysis for safety and precision.  ... 
doi:10.5120/9592-4211 fatcat:afkgzwrx6bgqnaxrrk5j7l4bcy

JET

Siliang Li, Gang Tan
2011 SIGPLAN notices  
The framework has a two-stage design where the first stage throws away a large portion of irrelevant code so that the second stage, a fine-grained analysis, can concentrate on a small set of code for accurate  ...  We have applied JET on a set of benchmark programs with a total over 227K lines of source code and identified 12 inconsistent native-method exception declarations.  ...  Acknowledgments The authors would like to thank the anonymous reviewers for their valuable comments.  ... 
doi:10.1145/2076021.2048095 fatcat:rrm4cra5qzcbzlfla3cuugwmim

Assessing the usefulness of type inference algorithms in representing Java control flow to support software maintenance tasks

Alex Kinneer, Gregg Rothermel
2008 2008 IEEE International Conference on Software Maintenance  
The Java programming language has introduced structured exception handling features that complicate the task of representing control flow.  ...  The accuracy of these representations can be important to the effectiveness and efficiency of these tools and techniques.  ...  Acknowledgements This work was supported in part by NSF under Awards CNS-0454203, CCR-0080898, and CCR-0347518 to the University of Nebraska -Lincoln.  ... 
doi:10.1109/icsm.2008.4658061 dblp:conf/icsm/KinneerR08 fatcat:skdrcyj2ebdihh6nomxkvjns4y

Optimizing Java Programs in the Presence of Exceptions [chapter]

Manish Gupta, Jong-Deok Choi, Michael Hind
2000 Lecture Notes in Computer Science  
The support for precise exceptions in Java, combined with frequent checks for runtime exceptions, leads to severe limitations on the compiler's ability to perform program optimizations that involve reordering  ...  We first present an algorithm using dynamic analysis, and a variant using static analysis, to identify the subset of program state that need not be preserved if an exception is thrown.  ...  We thank Dave Streeter, Frank Tip, and Doug Lorch for their help with the Jax infrastructure and Igor Pechtchanski and Chandra Krintz for help with the code generation used for the dynamic analysis instrumentation  ... 
doi:10.1007/3-540-45102-1_21 fatcat:x4oeqnvl25fl5leov3ljxa4ffu

Pointer Analysis in the Presence of Dynamic Class Loading [chapter]

Martin Hirzel, Amer Diwan, Michael Hind
2004 Lecture Notes in Computer Science  
This paper identifies all problems in performing Andersen's pointer analysis for the full Java language, presents solutions to those problems, and uses a full implementation of the solutions in Jikes RVM  ...  Hence, prior pointer analyses for Java either ignore these features or are overly conservative. This paper presents the first non-trivial pointer analysis that deals with all Java language features.  ...  Conclusions We describe and evaluate the first non-trivial pointer analysis that handles all of Java.  ... 
doi:10.1007/978-3-540-24851-4_5 fatcat:33stq6w57vd3jka2tv2gejtmc4

Load Elimination in the Presence of Side Effects, Concurrency and Precise Exceptions [chapter]

Christoph von Praun, Florian Schneider, Thomas R. Gross
2004 Lecture Notes in Computer Science  
The reuse of values loaded from memory at subsequent occurrences of load expressions must be done with care: Precise exceptions and the potential of side effects through method invocations and concurrent  ...  Partial redundancy elimination can reduce the number of loads corresponding to field and array accesses in Java programs.  ...  This research was supported, in part, by the NCCR "Mobile Information and Communication Systems", a research program of the Swiss National Science Foundation, and by a gift from the Microprocessor Research  ... 
doi:10.1007/978-3-540-24644-2_25 fatcat:uv7fwvudczcm3jplsoplxcovri

Speculative Execution of Parallel Programs with Precise Exception Semantics on GPUs [chapter]

Akihiro Hayashi, Max Grossman, Jisheng Zhao, Jun Shirako, Vivek Sarkar
2014 Lecture Notes in Computer Science  
In this paper, we propose compile-time and runtime technique for accelerating Java programs with automatic generation of OpenCL while preserving precise exception semantics.  ...  generation of optimized and parallel exception-checking code for execution on the CPU.  ...  Introduction Programming models for general-purpose computing on GPUs (GPGPU), such as CUDA and OpenCL, can enable significant performance and energy improvements for certain classes of applications.  ... 
doi:10.1007/978-3-319-09967-5_20 fatcat:cayayngzmfbfhoghxzarhr6p4q

A generic static analyzer for multithreaded Java programs

P. Ferrara
2012 Software, Practice & Experience  
In this paper we present ¼heckmate, the first generic static analyzer of multithreaded Java programs based on abstract interpretation. ¼heckmate can be tuned at different levels of precision and efficiency  ...  Figure 12 reports the time taken by the analysis (in msec) to build up the abstraction of the § The source code of these examples can be downloaded at A GENERIC STATIC ANALYZER FOR MULTITHREADED JAVA PROGRAMS  ...  Discussion ¼heckmate performs a precise and correct analysis of the representative set of examples we chose from We deal with examples aimed at explaining the main features of the Java memory model,  ... 
doi:10.1002/spe.2126 fatcat:5zifplk4qncwxovt6cqetqqjna
« Previous Showing results 1 — 15 out of 29,925 results