Customers who bought this item also bought

• Ivor Horton's Beginning Visual C++ 2012
• Engineering a Compiler. Edition No. 2
• X-ray and Related Techniques
• Simulation. Edition No. 5
• Software/System Modeling and Test Tools - Volume 5: End-User Data on Software/System Modeling
• Data Structures and the Java Collections Framework. 3rd Edition
• Information Search After Static or Moving Targets. Theory and Modern Applications
• Viktor Baumann GmbH & Co. KG - Company Capsule
• Ballistics 2011: 26th International Symposium on Ballistics
• 2012 Deep Research Report on Global and China Ball Screws Industry

Shape-Based Alias Analysis. Edition No. 1

VDM Publishing House, April 2010, Pages: 132

Shape analysis is a static code analysis technique for discovering properties of heap-allocated data structures. Such information is crucial to find software bugs at compile-time or to verify high-level correctness properties. Various analyses have been introduced but their relation in terms of precision often remains unclear as analyses cannot be compared directly due to different representations of analysis results. The aim of our work is to compare the precision of shape analyses by extracting alias information from shape analysis results. We propose a significant improvement in precision over an existing 3-valued logic-based algorithm for computing alias sets from shape graphs. Using this algorithm we are able to compare the precision of two graph-based shape analyses, proposed by Sagiv, Reps

Viktor, Pavlu.
Viktor Pavlu is a research assistant at the Institute of Computer Languages, Vienna University of Technology. His main research interest is in the portable and efficient implementation of programming languages and compiler technology. He currently works on static analysis of pointers and heap-allocated data structures.