Filters








108 Hits in 1.9 sec

Multithreaded dependence graphs for concurrent Java programs

Zhao
1999 Proceedings International Symposium on Software Engineering for Parallel and Distributed Systems PDSE-99  
We also discuss some important applications of a multithreaded dependence graph in a maintenance environment for concurrent Java programs.  ...  In this paper, we present a dependence-based representation called multithreaded d e p endence g r aph, which extends previous dependence-based representations, to represent program dependencies in a concurrent  ...  Acknowledgements The author would like to thank the anonymous referees for their valuable suggestions and comments on earlier drafts of the paper.  ... 
doi:10.1109/pdse.1999.779735 dblp:conf/pdse/Zhao99 fatcat:wrgxqvimrrhuhajkamqmiwovb4

Concurrent garbage collection using program slices on multithreaded processors

Manoj Plakal, Charles N. Fischer
2000 Proceedings of the second international symposium on Memory management - ISMM '00  
We generate a reference-counting collector as a transsformed program slice of an application and then execute this slice in parallel with the application as a "run-behind" thread.  ...  We investigate reference counting in the context of a multithreaded architecture by exploiting two observations: (1) reference-counting can be performed by a transformed program slice of the mutator that  ...  We would like to thank Timothy Heft and Subramanya Sastry for critical support with Strata, as well as Harish Patil, Rastistav Bodik, Anne Mulhem, Denis Gopan, Harit Modi, Ravi Rajwar and the anonymous  ... 
doi:10.1145/362422.362468 dblp:conf/iwmm/PlakalF00 fatcat:fpaxex3ulbdonalxscnppkddpu

Concurrent garbage collection using program slices on multithreaded processors

Manoj Plakal, Charles N. Fischer
2001 SIGPLAN notices  
We generate a reference-counting collector as a transsformed program slice of an application and then execute this slice in parallel with the application as a "run-behind" thread.  ...  We investigate reference counting in the context of a multithreaded architecture by exploiting two observations: (1) reference-counting can be performed by a transformed program slice of the mutator that  ...  We would like to thank Timothy Heft and Subramanya Sastry for critical support with Strata, as well as Harish Patil, Rastistav Bodik, Anne Mulhem, Denis Gopan, Harit Modi, Ravi Rajwar and the anonymous  ... 
doi:10.1145/362426.362468 fatcat:sr7jwpev7ngxro2rrhh7qefwqa

An improved slicer for Java

Christian Hammer, Gregor Snelting
2004 Proceedings of the ACM-SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering - PASTE '04  
We then compare the two algorithms by providing measurements for a benchmark of Java and JavaCard programs.  ...  We present an improved slicing algorithm for Java. The best algorithm known so far, first presented in [11] , is not always precise if nested objects are used as actual parameters.  ...  Krinke's slicing algorithm for multithreaded programs [8] ; • we plan to implement approximation algorithms for the full Java API.  ... 
doi:10.1145/996821.996830 dblp:conf/paste/HammerS04 fatcat:yql52v5jbzaobh3a6322q5ygc4

Verifying the Concept of Union Slices on Java Programs

Attila Szegedi, Tamas Gergely, Arpad Beszedes, Tibor Gyimothy, Gabriella Toth
2007 11th European Conference on Software Maintenance and Reengineering (CSMR'07)  
We verify on real-world Java programs their usefulness as a replacement to static slices.  ...  Due to different causes static slices are in many cases overly conservative and hence too large to reduce the program-part of interest meaningfully.  ...  Acknowledgements Our thanks goes to Dr. Hatcliff and his team for providing us help with using the static Java slicer Indus. This work was supported, in part, by national grant GVOP-3.1.  ... 
doi:10.1109/csmr.2007.53 dblp:conf/csmr/SzegediGBGT07 fatcat:x3lwnqrjknf35lgy4g3hp22pza

Source-level global optimizations for fine-grain distributed shared memory systems

R. Veldema, R. F. H. Hofman, R. A. F. Bhoedjang, C. J. H. Jacobs, H. E. Bal
2001 SIGPLAN notices  
On average, sequential execution times of instrumented, optimized programs are within 10% of those of uninstrumented programs.  ...  Application speedups usually improve significantly and several Jackal applications perform as well as handoptimized message-passing programs.  ...  Application Suite Our application suite consists of four multithreaded Java programs: ASP, SOR, TSP, and Water.  ... 
doi:10.1145/568014.379578 fatcat:euyfq7feercqnnibmos3nwvswa

Source-level global optimizations for fine-grain distributed shared memory systems

R. Veldema, R. F. H. Hofman, R. A. F. Bhoedjang, C. J. H. Jacobs, H. E. Bal
2001 Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming - PPoPP '01  
On average, sequential execution times of instrumented, optimized programs are within 10% of those of uninstrumented programs.  ...  Application speedups usually improve significantly and several Jackal applications perform as well as handoptimized message-passing programs.  ...  Application Suite Our application suite consists of four multithreaded Java programs: ASP, SOR, TSP, and Water.  ... 
doi:10.1145/379539.379578 dblp:conf/ppopp/VeldemaHBJB01 fatcat:rajtv7cjiranbouw4t5agjefcm

Seventh IEEE International Working Conference on Source Code Analysis and Manipulation-Copyright

2007 Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2007)  
While there exist efficient algorithms to slice sequential programs precisely, there are only two algorithms for precise slicing of concurrent interprocedural programs with recursive procedures.  ...  We show that one algorithm may produce incorrect slices and that precise slicing of concurrent programs is very expensive in terms of computation time.  ...  Currently, there exist several algorithms for slicing concurrent programs, but only two of them can slice concurrent interprocedural programs with recursive procedures and yield precise slices.  ... 
doi:10.1109/scam.2007.3 fatcat:p2wnhpoe5fezdazygt33flqere

Comprehensive synchronization elimination for Java

Jonathan Aldrich, Emin Gün Sirer, Craig Chambers, Susan J. Eggers
2003 Science of Computer Programming  
We motivate the design of our analyses with a study of the kinds of unnecessary synchronization found in a suite of single-and multithreaded benchmarks of different sizes and drawn from a variety of domains  ...  The synchronization optimizations we describe enable programmers to design efficient, reusable and maintainable libraries and systems in Java without cumbersome manual code restructuring.  ...  We also thank the authors of our benchmarks: JavaSoft (javac, javadoc, jws), Philip Wadler (pizza), Andrew Appel (jlex and javacup), and Greg Badros (cassowary).  ... 
doi:10.1016/s0167-6423(02)00129-6 fatcat:7fdfk4gg3jddpbjc7nonacbr6u

SVF: interprocedural static value-flow analysis in LLVM

Yulei Sui, Jingling Xue
2016 Proceedings of the 25th International Conference on Compiler Construction - CC 2016  
Such value-flows can be subsequently exploited to support various forms of program analysis or enable more precise pointer analysis (e.g., flow-sensitive analysis) to be performed sparsely.  ...  SVF accepts points-to information generated by any pointer analysis (e.g., Andersen's analysis) and constructs an interprocedural memory SSA form, in which the def-use chains of both top-level and address-taken  ...  The Wisconsin program-slicing project [22] is a well-known research prototype that supports both forward and backward slicing on its program dependence graph.  ... 
doi:10.1145/2892208.2892235 dblp:conf/cc/SuiX16 fatcat:tlqxsdhduvgcvmqpsiew3eopve

On bytecode slicing and aspectJ interferences

Antonio Castaldo D'Ursi, Luca Cavallaro, Mattia Monga
2007 Proceedings of the 6th workshop on Foundations of aspect-oriented languages - FOAL '07  
We built a bytecode slicer called XCutter in order to study which part of the woven code is affected by the application of an aspect.  ...  In particular, it is not easy to figure out if two aspects interfere one with the other.  ...  Acknowledgments The authors would like to thank Davide Balzarotti and Carlo Ghezzi for their help in clarifying the ideas behind this paper.  ... 
doi:10.1145/1233833.1233839 dblp:conf/foal/DUrsiCM06 fatcat:r2zvry3pcreuvpbuk57hmo2qee

Flow-sensitive, context-sensitive, and object-sensitive information flow control based on program dependence graphs

Christian Hammer, Gregor Snelting
2009 International Journal of Information Security  
We then augment PDGs with a lattice of security levels and introduce the flow equations for IFC. We describe algorithms for flow computation in detail and prove their correctness.  ...  Finally, examples demonstrate that our implementation can check realistic sequential programs in full Java bytecode.  ...  Acknowledgements We thank Jens Krinke, who contributed to previous versions of this work, for ongoing discussions on IFC; and Frank Nodes for implementing the Eclipse integration.  ... 
doi:10.1007/s10207-009-0086-1 fatcat:ziiyafhqn5ed3epewrob2atp5u

Online Construction of Dynamic Object Process Graphs

Jochen Quante
2007 11th European Conference on Software Maintenance and Reengineering (CSMR'07)  
Also, techniques like multithreading and reflection were not handled by our previous approach. This prevented it from being applicable to real-life systems.  ...  Additionally, we discuss some special issues arising from analyzing Java instead of C.  ...  Therefore, a dynamic analysis on Java applications must take care of multithreading.  ... 
doi:10.1109/csmr.2007.37 dblp:conf/csmr/Quante07 fatcat:qcmmcp64qzabloc7t4nudrur3y

A framework for interprocedural optimization in the presence of dynamic class loading

Vugranam C. Sreedhar, Michael Burke, Jong-Deok Choi
2000 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation - PLDI '00  
To address these drawbacks, we propose a new framework, called the extant analysis framework, for interprocedural optimization of programs that support dynamic class (or method) loading.  ...  Dynamic class loading during program execution in the Java TM Programming Language is an impediment for generating code that is as e cient as code generated using static wholeprogram analysis and optimization  ...  We would like to thank Jalapeño team members, especially Derek Lieber, Dave Grove, and Steve Fink, for their help with the Jalapeño system.  ... 
doi:10.1145/349299.349326 dblp:conf/pldi/SreedharBC00 fatcat:gg6pwqhn2va63j7ot6khnjt2xe

Assertion guided abstraction

Markus Kusano, Chao Wang
2014 Proceedings of the 29th ACM/IEEE international conference on Automated software engineering - ASE '14  
We propose a new method for reducing the interleaving space during stateless model checking of multithreaded C/C++ programs.  ...  We have developed a new method, called assertion guided abstraction, which leverages both static and dynamic program analyses in a cooperative framework to reduce the interleaving space.  ...  We present in this paper a new cooperative analysis framework for multithreaded programs to allow static and dynamic analysis methods to share information between each other with the goal of increasing  ... 
doi:10.1145/2642937.2642998 dblp:conf/kbse/KusanoW14 fatcat:azcpp77zwvgi5i4hex3tieteii
« Previous Showing results 1 — 15 out of 108 results