Computer Science ›› 2014, Vol. 41 ›› Issue (9): 178-184.doi: 10.11896/j.issn.1002-137X.2014.09.034

Previous Articles     Next Articles

Improved Flow-insensitive Type Qualifier Inference

LI Hui-song,XU Zhi-wu and CHEN Hai-ming   

  • Online:2018-11-14 Published:2018-11-14

Abstract: Type qualifiers can refine the standard types and improve the expressivity of type systems.Flow-insensitive type qualifier inference has been used in the CQual framework to improve the quality of C programs.Type casts,however,will affect the effectiveness of type qualifier inference.First a language allowing type casts and its flow-insensitive qualifier inference system were presented. Then this paper proposed a variable-involved inference system,introduced union types and given constraints solving algorithm.Finally,the soundness was proved and some case studies were pre-sented.

Key words: Type casts,Type inference,Qualifiers,Flow-insensitive,Union types

[1] Aiken A,Foster J S,Kodumal J,et al.Checking and inferring local non-aliasing[J].ACM SIGPLAN Notices,ACM,2003,38(5):129-140
[2] Bierman G M,Gordon A D,Hrit,cu C,et al.Semantic subtyping with an SMT solver[J].ACM SIGPLAN Notices,ACM,2010,45(9):105-116
[3] Broadwell P,Harren M,Sastry N.Scrash:A system for generating secure crash information[C]∥Proceedings of the 12th conference on USENIX Security Symposium.Volume 12,USENIX Association,2003:19-19
[4] Castagna G,Xu Zhi-wu.Set-theoretic foundation of parametric polymorphism and subtyping[J].ACM SIGPLAN Notices,ACM,2011,46(9):94-106
[5] Chandra S,Reps T.Physical type checking for C[J].ACM SIGSOFT Software Engineering Notes,ACM,1999,24(5):66-75
[6] Chin B,Markstrum S,Millstein T.Semantic type qualifiers[J].ACM SIGPLAN Notices,ACM,2005,40(6):85-95
[7] Courcelle B.Fundamental properties of infinite trees[J].Theoretical computer science,1983,25(2):95-169
[8] Foster J S.CQUAL User’s Guide Version 0.991[K].2004
[9] Foster J S,Fhndrich M,Aiken A.A theory of type qualifiers[J].ACM SIGPLAN Notices,ACM,1999,34(5):192-203
[10] Foster J S,Terauchi T,Aiken A.Flow-sensitive type qualifiers[M].ACM,2002
[11] Foster J S.Type qualifiers:lightweight specifications to improve software quality[D].Berkeley:University of California,2002
[12] Fraser T,Petroni Jr N L,Arbaugh W A.Applying flow-sensitive CQUAL to verify MINIX authorization check placement[C]∥Proceedings of the 2006 workshop on Programming languages and analysis for security.ACM,2006:3-6
[13] Freeman T,Pfenning F.Refinement types for ML[M].ACM,1991
[14] Greenfieldboyce D,Foster J S.Type qualifier inference for Java[J].ACM SIGPLAN Notices,ACM,2007,42(10):321-336
[15] Johnson R,Wagner D.Finding User/Kernel Pointer Bugs with Type Inference[J].USENIX Security Symposium,2004,2(0):0
[16] Mandelbaum Y,Walker D,Harper R.An effective theory oftype refinements[J].ACM SIGPLAN Notices,ACM,2003,38(9):213-225
[17] Shankar U,Talwar K,Foster J S,et al.Detecting Format String Vulnerabilities with Type Qualifiers[C]∥USENIX Security Symposium.2001:201-220
[18] Siff M,Chandra S,Ball T,et al.Coping with type casts in C[C]∥Software Engineering—ESEC/FSE’99.Springer Berlin Heidelberg,1999:180-198
[19] Zhang Xiao-lan,Edwards A,Jaeger T.Using CQUAL for Static Analysis of Authorization Hook Placement[C]∥USENIX Security Symposium.2002:33-48
[20] Steensgaard B.Points-to analysis in almost linear time[C]∥Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on principles of programming languages.ACM,1996:32-41
[21] Fhndrich M,Rehof J,Das M.Scalable context-sensitive flowanalysis using instantiation constraints[J].ACM SIGPLAN Notices,2000,35(5):253-263

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!