Zhichen Xu, Thomas Reps, and Barton P. Miller. Typestate Checking of Machine Code. In David Sands, editor, 10th European Symposium on Programming, volume 2028.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....support traditional pointers. Programs are checked for conformity by using a ow sensitive data ow analysis[23] or a demand driven backward analysis[22] They used typestates to statically verify the initialization properties of values[23] Xu uses typestates to check the safety of machine code[27]. Vault is a type safe variant of C[7] Vault requires that the programmer annotate or rewrite their code to match the strict type model. Vault has no notion of path sensitivity, so the state of objects must be consistent at every point in the program. It also has many restrictions on aliasing. ....

Z. Xu, T. Reps, and B. Miller. Typestate checking of machine code. In Proceedings of the European Symposium on Programming, pages 335-351, 2001. 11

....and the global program with the much less precise abstract domain of intervals [17] If the polyhedral domain is too expensive, the less precise domain of dierence bound matrices [63] can also be used for the local relational analyzes of program parts. This is essentially the technique used by [73]. 8.5 Unknown Dependence Graph Separate static program analysis is very dicult when the dependence graph is not known in a modular way (which is the case with higher order functions in functional languages or with virtual methods in object oriented languages) When the dependence graph is fully ....

Z. Xu, T. Reps, and B.P. Miller. Typestate checking of machine code. In D. Sands (ed), Proc. 10 ESOP '2001, LNCS 2028, 335351. Springer, 2001. In Proceedings of the Eleventh International Conference on Compiler Construction (CC 2002), R.N. Horspool (Ed.), Grenoble, France, April 614, 2002. Lecture Notes in Computer Science 2304, c Springer, Berlin, 2002, pp. 159178.

....support traditional pointers. Programs are checked for conformity by using a owsensitive data ow analysis [23] or a demand driven backward analysis [22] They used typestates to statically verify the initialization properties of values [23] Xu uses typestates to check the safety of machine code [27]. Vault [7] is a type safe variant of C. Vault requires that the programmer annotate or rewrite their code to match the strict type model. Vault has no notion of path sensitivity, so the state of objects must be consistent at every point in the program. It also has many restrictions on aliasing. ....

Z. Xu, T. Reps, and B. Miller. Typestate checking of machine code. In Proceedings of the European Symposium on Programming, pages 335-351, 2001. 11

....simpler and less expressive monomorphic type system that is designed for ecient type inference. Our system incorporates e ect inference [LG88, Wri92] to gain a measure of polymorphism. The type state system of NIL [SY86] is one of the earliest to incorporate ow sensitive type checking. Xu et al. [XRM01] use a ow sensitive analysis to check type safety of machine code. Type systems developed for Java byte code [SA98, O C99] also incorporate ow sensitivity to check for initialization before use and to allow reuse of the same local variable with di erent types. Igarashi and Kobayashi [IK02] ....

Zhichen Xu, Thomas Reps, and Barton P. Miller. Typestate Checking of Machine Code. In David Sands, editor, 10th European Symposium on Programming, volume

....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, Thomas Reps, and Barton Miller. Typestate checking of machine code. In Proceedings of the 15th European Symposium on Programming, 2001.

....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, Thomas Reps, and Barton Miller. Typestate checking of machine code. In Proceedings of the 15th European Symposium on Programming, 2001.

No context found.

Z. Xu, T. W. Reps, and B. P. Miller. Typestate Checking of Machine Code. Technical Report, University of Wisconsin---Madison (July 2000).

No context found.

Z. Xu, T. W. Reps, and B. P. Miller. Typestate Checking of Machine Code. Technical Report, University of Wisconsin---Madison (July 2000). thesis.fm Page 148 Tuesday, December 19, 2000 11:00 AM

No context found.

Zhichen Xu, Thomas Reps, and Barton P. Miller. Typestate Checking of Machine Code. In David Sands, editor, 10th European Symposium on Programming, volume 2028.

No context found.

Zhichen Xu, Tom Reps, and Bart Miller. Typestate checking of machine code. In 10th European Symposium on Programming, volume 2028.

No context found.

Z. Xu, T. Reps, and B. P. Miller. Typestate Checking of Machine Code. In D. Sands, editor, 10th European Symposium on Programming, volume 2028.

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