Z. Xu, B. Miller, and T. Reps. Safety checking of machine code. In Proc. ACM PLDI, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....there are abundant works on deriving weakest pre conditions from a given program output. The basic idea behind the backward derivation of weakest pre condition was already present in the inductive iteration method, pioneered by Suzuki and Ishihata[23] and more recently improved by Xi et al. [27] and Flanagan et al. 12] An earlier version of forward context analysis appeared in [5] with the intention to nd total and partial redundant checks in a program. In this paper, we rely heavily on contextual information, both to derive weakest pre conditions, and to characterize program ....

Z. Xu, B.P. Miller, and T. Reps. Safety checking of machine code. In ACM SIGPLAN Conf. on Programming Language Design and Implementation, pages 70-82. ACM Press, June 2000.

....formulae. In contrast, in a, b) x.1 : z P z, b) the operationally local nature of assignment is mirrored beautifully in the logic. There has been growing interest in using program logic for pointers in static analysis and related problems, and some excellent results have been obtained [18, 24, 37, 40]. The work here appears to be largely complementary. Indeed, although the devil is in the detail, it would be conceivable to combine one of these assertion languages with a substructural logic, in the style of BI. The main question is whether such a combination would give rise to local reasoning ....

Xu, Z., Miller, B., and Reps, T. Safety checking of machine code. In PLDI'00.

.... egn ] xs # ) if ( #) then [ gn(x # 1 , x # n ) else spec xs # case inst (#, v) of [ 1 ] True ] 0 ] False ] Figure 6: Constraint Based Specialization method, pioneered by Suzuki and Ishihata[13] and more recently improved by Xi et al. [15] and Flanagan et al. 8] An earlier version of forward context analysis appears in [5] with the intention of finding totally partially redundant checks in a program. In this paper, we rely heavily on contextual information, both to derive weakest pre condition, and to characterize program ....

Z. Xu, B.P. Miller, and T. Reps. Safety checking of machine code. In ACM SIGPLAN Conf. on Programming Language Design and Implementation, pages 70--82. ACM Press, June 2000. 116

....dataflow analysis [8] The combination of predicate abstraction by C2bp and path sensitive dataflow analyses in Bebop could be used to achieve similar results. Prior work for generating loop invariants has used symbolic execution on the concrete semantics, augmented with widening heuristics [32, 33]. The Houdini tool guesses a candidate set of annotations (invariants) and uses the ESC Java checker to refute inconsistent annotations until convergence [18] In contrast, the tools C2bp and Bebop use a combination of abstraction (from C program to boolean program) and iterative analysis of the ....

....using value flow analysis on the program, with respect to the properties of interest. Our current approach seems to work as long as the properties of interest have relatively simple dependencies on data. For data intensive properties, predicate generation may have to use widening heuristics as in [32, 33]. Acknowledgements. We thank Andreas Podelski for helping us describe the C2bp tool in terms of abstract interpretation. We thank Manuvir Das for providing us his onelevel flow analysis tool. We thank the developers of the AST toolkit at Microsoft Research, and Manuel Fahndrich for providing us ....

Z. Xu, B. P. Miller, and T. Reps. Safety checking of machine code. In PLDI 00: Programming Language Design and Implementation, pages 70--82. ACM, 2000.

....the published techniques, per se, and existing compilers JVMs can (i) optimise array bounds checks in presence of indirection, ii) are suitable for adaptive just in time compilation, or (iii) support multi threading and (iv) dynamic class loading. Techniques based on theorem probers [SI77, NL98, XMR00] are too heavy weight. Algorithms based on data ow style have been published extensively [MCM82, Gup90, Gup93, KW95, Asu92, CG96] but for languages that do not provide multi threading. Another technique is based on type analysis and has its application in functional languages [XP98] Linear ....

Zhichen Xu, Barton P. Miller, and Thomas Reps. Safety checking of machine code. In Proceedings of the ACM Conference on Programming Language Design and Implementation { PLDI'00, pages 70-82, 2000.

....cases, properties that do change are as important as properties that do not. Recognizing the bene t of capturing these changes, researchers have developed systems in which the type of the object changes as the values stored in its elds change or as the program invokes operations on the object [45, 44, 10, 51, 52, 6, 18, 11]. These systems integrate the concept of changing object states into the type system. The fundamental idea in this paper is that the type of each object should also depend on the data structures in which it participates. Our type system therefore captures the referencing relationships that ....

....to dynamically allocated objects. More recently proposed typestate approaches use linear types for heap references to support state changes of dynamically allocated objects [10] Researchers have also developed typestate approaches for verifying safety properties of assembly language programs [51, 52]. Motivated by the need to enforce safety properties in lowlevel software systems, several researchers have developed systems that use extensions of linear types to avoid general aliasing and rely on language design to avoid non local type inference [43, 49, 9] These systems take a ....

Zhichen Xu, Barton Miller, and Thomas Reps. Safety checking of machine code. In Proceedings of the SIGPLAN '00 Conference on Programming Language Design and Implementation, 2000.

....cases, properties that do change are as important as properties that do not. Recognizing the bene t of capturing these changes, researchers have developed systems in which the type of the object changes as the values stored in its elds change or as the program invokes operations on the object [84, 83, 20, 91, 92, 11, 40, 26]. These systems integrate the concept of changing object states into the type system. The fundamental idea in this work is that the state of each object also depends on the data structures in which it participates. Our type system therefore captures the referencing relationships that determine ....

....point. This is in contrast to predicative data ow analyses such as role analysis, which track the sets of possible aliasing relationships at each program point. Our approach makes the results of the analysis less sensitive to semantic preserving rearrangements of statements in the program. Like [91, 92], our role analysis performs non local inference of program properties including the synthesis of loop invariants. The di erence is that [91, 92] focus on linear constraints between integers and handle recursive data structures conservatively, whereas we do not handle integer arithmetic but have a ....

[Article contains additional citation context not shown here]

Zhichen Xu, Barton Miller, and Thomas Reps. Safety checking of machine code. In Proceedings of the SIGPLAN '00 Conference on Programming Language Design and Implementation, 2000.

....local and global checks. 9 Related Work Elimination of Array Bounds Checks. A number of approaches have been taken for performing elimination of array bounds checks. Theorem proving style algorithms have been used by Suzuki and Ishihata [SI77] Necula and Lee [Nec98, NL98] as well as Xu et al. XMR00] Although more powerful than ABCD, theorem proving is expensive and therefore unsuitable for a dynamic optimization setting. Value range analysis has been used to compute bounds on the values of index expressions for the purpose of eliminating full redundancy [Har77, Pat95, RR99] One of our ....

Zhichen Xu, Barton Miller, and Thomas Reps. Safety checking of machine code. In Proceedings of the ACM SIGPLAN '00 Conf. on Progr. Language Design and Implementation, page to appear, jun 2000.

No context found.

Z. Xu, B. Miller, and T. Reps. Safety checking of machine code. In Prog. Lang. Design and Impl., pages 70--82, 2000.

No context found.

Z. Xu, B. Miller, and T. Reps. Safety checking of machine code. In Prog. Lang. Design and Impl., pages 70--82, 2000. 19 A Results of Value-Set Analysis for Fig. 1

No context found.

Z. Xu, B. P. Miller, and T. W. Reps. Safety Checking of Machine Code. SIGPLAN Conference on Programming Language Design and Implementation. Vancouver B.C., Canada (June 2000).

....are also used to guide bound check specialization, for the purpose of eliminating partially redundant checks. 1 Introduction Array bound check optimization has been extensively investigated over the last three decades [24, 12, 5, 17, 7, 8, 15] with renewed interests as recently as [3, 27, 23]. While successful bound check elimination can bring about measurable gains in performance, the importance of bound check optimization goes beyond these direct gains. In safety oriented languages, such as Ada or Java, all bound violation must be faithfully reported through precise exception ....

....solving for implementing both our forward analysis (essentially sized typing) and backward analysis (for deriving pre conditions) Our experiments were performed with Omega Library 1.10, running on a Sun System 450. We took our examples mostly from [26] with the exception of sumarray from [27]. The reported time measurements are the average values out of 50 runs. The rst column reports the time taken by forward analysis (largely for computing invariants) while the second column reports the time taken for backward derivation of safety pre condition. The results shows that the time ....

[Article contains additional citation context not shown here]

Z. Xu, B.P. Miller, and T. Reps. Safety checking of machine code. In ACM SIGPLAN Conf. on Programming Language Design and Implementation, pages 70-82. ACM Press, June 2000.

No context found.

Z. Xu, B. Miller, and T. Reps. Safety checking of machine code. In Proc. ACM PLDI, 2000.

No context found.

Xu, Z., Miller, B., and Reps, T. Safety checking of machine code. In PLDI'00.

No context found.

Z. Xu, B. P. Miller, and T. Reps. Safety checking of machine code. In Proc. PLDI 2000.

No context found.

Z. Xu. Safety-Checking of Machine Code. PhD thesis, University of Wisconsin, Madison, 2000.

No context found.

Z. Xu. Safety-Checking of Machine Code. PhD thesis, University of Wisconsin, Madison, 2000.

No context found.

Zhichen Xu, Barton Miller, and Thomas Reps. Safety checking of machine code. In Proc. of the ACM SIGPLAN 2000.

No context found.

Z. Xu, B. P. Miller, and T. Reps. Safety checking of machine code. In Proceedings of the ACM Conference on Programming Language Design and Implementation -- PLDI'00, pages 70--82, 2000.

No context found.

Zhichen Xu, Bart Miller, and Tom Reps. Safety checking of machine code. pages 70--82, Vancouver, Canada, June 2000.

No context found.

Zhichen Xu. Safety-Checking of Machine Code. PhD thesis, University of Wisconsin--Madison, 2001.

No context found.

Z. Xu, B. P. Miller, and T. Reps. Safety checking of machine code. In Proceedings of the ACM Conference on Programming Language Design and Implementation -- PLDI'00, pages 70--82, 2000.

No context found.

Zhichen Xu, Barton P. Miller, and Thomas Reps. Safety checking of machine code. In Proceedings of ACM SIGPLAN 2000.

No context found.

Xu, Z., Miller, B., and Reps, T. Safety checking of machine code. In PLDI'00.

No context found.

Zhichen Xu, Barton P. Miller, and Thomas Reps. Safety checking of machine code. In Proceedings of ACM SIGPLAN 2000.

First 50 documents

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