V. Martena, P. San Pietro  Home/Search
Context Related
| elet.polimi.it/out...CC01submission.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: elet.polimi.it/Use...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We study the application of a standard model checker tool, Spin, to the well-known problem of computing a may-alias relation for a C program. A precise may-alias relation can significantly improve code optimization, but in general it may be computationally too expensive. We show that, at least in the case of intraprocedural alias analysis, a model checking tool has a great potential for precision and efficiency. For instance, we can easily deal, with good precision, with features such as... (Update)
Context of citations to this paper: More
...to enable automatic analysis. Simplifications focus on the specific properties of interest. For example, San Pietro and Martena [33] present a technique for analyzing C code. The technique consists of encoding C code in Promela and then using Spin to carry out the...
.... problem is a well known and thoroughly studied one in program analysis, and a number of suitable techniques exist (e.g. [11, 3, 22, 19, 12, 13]) Moreover, alias analysis is orthogonal to the type based analysis we describe here, and the two can be combined...
Cited by: More
Points-to Analysis using BDDs - Berndl, Lhoták, Qian, Hendren, Umanee (2002) (Correct)
Enhancing Remote Method Invocation through Type-Based.. - Ghezzi, Martena, Picco (2003) (Correct)
Using Symbolic Execution for Verifying Safety-Critical .. - Coen-Porisini.. (2001) (Correct)
Active bibliography (related documents): More All
0.5: Conceptual Modeling of WorkFlows - Casati, Ceri, Pernici, Pozzi (1995) (Correct)
0.2: General Method of Program Code Obfuscation - Wroblewski (2002) (Correct)
0.2: Integrating On-Demand Alias Analysis into - Schedulers For Advanced (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.5: A Finite-Domain Semantics for Testing Temporal Logic.. - Alberto Coen-Porisini.. (Correct)
0.5: Interclass Testing of Object Oriented Software - Martena, Orso, Pezzè (2002) (Correct)
0.5: Dipartimento Di Elettronica E Informazione - Politecnico Di Milano (Correct)
Related documents from co-citation: More All
3: Extending and evaluating flow-insensitive and context-insensitive points-to anal.. - Liang, Pennings et al. - 2001
3: Fast and accurate flow-insensitive point-to analysis - Shapiro, Horwitz - 1997
2: Scaling Java points-to analysis using Spark (context) - Lhotak, Hendren - 2003
BibTeX entry: (Update)
Vincenzo Martena and Pierluigi San Pietro. "Alias Analysis by means of a Model Checker," 10 th International Conference on Compiler Construction (CC 01), 2001. http://citeseer.ist.psu.edu/martena01alias.html More
@article{ martena01alias,
author = "Vincenzo Martena and Pierluigi San Pietro",
title = "Alias Analysis by Means of a Model Checker",
journal = "Lecture Notes in Computer Science",
volume = "2027",
pages = "3--??",
year = "2001",
url = "citeseer.ist.psu.edu/martena01alias.html" }
Citations (may not include all citations):1097 Automatic verification of finite-state concurrent systems us.. (context) - Clark, Emerson et al. - 1986
815 Abstract interpretation: a unified lattice model for static .. (context) - Cousot, Cousot
470 Design and Validation of Computer Protocols (context) - Holzmann - 1991
407 Trace Scheduling: A Technique for Global Microcode Compactio.. (context) - Fisher - 1981
315 Symbolic model checking - an approach to the state explosion.. (context) - McMillan - 1992
292 Advanced Compiler Design and Implementation (context) - Muchnick - 1997
230 Compiler Transformations for High-Performance Computing - Bacon, Graham et al. - 1994
228 Points-to Analysis in Almost Linear Time - Steensgaard
195 ACM Transaction on Programming Languages and Systems (context) - Ramalingam, of - 1994
175 A Safe Approximate Algorithm for Interprocedural Pointer Ali.. - Landi, Ryder - 1992
57 Modern Compiler Implementation in Java (context) - Appel - 1998
47 Program analysis via graph reachability - Reps - 1998
39 The effects of the precision of pointer analysis - Shapiro, Horwitz - 1997
35 Pointer analysis for programs with structures and casting - Yong, Horwitz et al. - 1999
27 ACM Transaction on Programming Languages and Systems (context) - Hind, Burke et al. - 1999
27 Data Flow Analysis as Model Checking (context) - Steffen - 1991
25 Program analysis as model checking of abstract interpretatio.. - Schmidt, Steffen - 1998
19 Constraint-Based Array Dependence Analysis - Pugh, Wonnacott - 1998
19 Efficient Points-to Analysis for Whole-Program Analysis - Liang, Harrold - 1999
18 The VLIW machine: a multiprocessor for compiling scientific .. (context) - Fisher - 1984
17 Precise Flow-Insensitive May-Alias Analysis is NP-Hard - Horwitz - 1997
11 Limiting state explosion with filter-based refinement - Dwyer, Schmidt - 1997
7 Equivalence Analysis: A General Technique to Improve the Eff.. - Liang, Harrold - 1999
4 Interprocedural Aliasing in the Presence of Pointers (context) - Landi - 1997
2 Dipartimento di Elettronica E Informazione (context) - Garatti, Reghizzi et al. - 2000
1 Modal Logic and Data Flow Analysis (context) - Cousot, Cousot - 1999
Documents on the same site (http://www.elet.polimi.it/Users/DEI/Sections/Compeng/Pierluigi.SanPietro/publications.htm):
A Scalable Formal Method for Design and Automatic.. - Berstel, Reghizzi, .. (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC