Flow Sensitive-Insensitive Pointer Analysis Based Memory Safety for Multithreaded Programs

El-Zawawy, Mohamed A.

doi:10.1007/978-3-642-21934-4_29

Cited by 10 publications

(11 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Analyzing may concentrate on whole program, or focuses on each program point. There are many aspects of analyzing multi-threaded programs: pointer analysis (El-Zawawy, 2012a;El-Zawawy, 2011;El-Zawawy, 2011a;El-Zawawy, 2011b;Rugina & Rinard, 2003), optimization uses (El-Zawawy & Nayel, 2011;Knoop & Steffen, 1999;Knoop, Steffen, & Vollmer, 1996;Lee, Midkiff, & Padua, 1998;Lee, Padua, & Midkiff, 1999), data race detection (Cheng, Feng, Leiserson, Randall, & Stark, 1998;Rugina & Rinard, 2005 ), and deadlock detection (Blieberger, Burgstaller, & Scholz, 2000;Koskinen & Herlihy, 2008;Wang, Kelly, Kudlur, Lafortune, & Mahlke, 2008).…”

Section: Related Workmentioning

confidence: 99%

“…Type systems have been extensively used in pointer analysis for both imperative and multi-threaded programs (El-Zawawy, 2011;El-Zawawy, 2011b). Type systems have been used to detect the memory safety of multi-threaded programs (El-Zawawy, 2011;El-Zawawy, 2011b;El-Zawawy, 2011a). Type systems are used in code optimization.…”

Section: Related Workmentioning

confidence: 99%

“…Type systems are used as a framework for analyzing multi-threaded programs as well as imperative programs. In (El-Zawawy, 2011), type systems were used as a framework for pointer analysis for multi-threaded programs. In (El-Zawawy & Nayel 2011) type systems were used as a framework for eliminating redundancies in multi-threaded programs.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Type Systems Based Data Race Detector

El-Zawawy¹,

Nayel²

2012

CIS

Self Cite

View full text Add to dashboard Cite

Multi-threading is a methodology that has been extremely used. Modern software depends essentially on multi-threading. Operating systems, famous examples, are based on multi-threading; a user can write his document, play an audio file, and downloading a file from internet at the same time. Each of these tasks called a thread. A common problem occurs when implementing multi-threaded programs is a data-race. Data race occurs when two threads try to access a shared variable at the same time without a proper synchronization. A detector is software that determines if the program contains a data-race problem or not. In this paper, we develop a detector that has the form of a type system. We present a type system which discovers the data-race problems. We also prove the soundness of our type system.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Type Systems Based Data Race Detector

El-Zawawy¹,

Nayel²

2012

CIS

Self Cite

View full text Add to dashboard Cite

show abstract

“…It is also easy to be related to a mathematical proof. We introduced two type systems; the first is to check the safety of the program (safety type system) and the second is to repair the errors (repair type system) (El-Zawawy, 2011c;El-Zawawy, 2011a;El-Zawawy, 2012;El-Zawawy & Nayel, 2011;El-Zawawy, 2011b).…”

Section: Introductionmentioning

confidence: 99%

New Error-recovery Techniques for Faulty-Calls of Functions

El-Zawawy¹,

Daoud²

2012

CIS

Self Cite

View full text Add to dashboard Cite

In this paper, we introduce type systems to detect faulty calls of functions in a program. The intended meaning of the faulty call is calling a function with a miss-match to the number of its arguments. We use error-detecting semantics that when detects the faulty calls, doesn't proceed to the next state. Type systems are used in the process of analysis and in repairing. The paper presents two type systems: the safety type system which checks the safety of a given program and the repairing type system which corrects errors. The repairing process is made by replacing the faulty call of function with a correct one. In the repairing process simple interactive input/output statements are used. The interaction (input/output) helps to get the lost parameters by interacting with the user; informing him about the number of lost parameters. The user can then input these parameters.

show abstract

“…Not only does the uncertainty of pointer values at compile time complicate analysis of programs, but also retard program compilation by compelling the program optimization and analysis to be conservative. The pointer analysis [4][5][6] of programs is a challenging problem in which researchers have trade space and time costs for precision. However, binary decision diagrams 7 have been used to ease the difficulty of this trade off.…”

Section: Introductionmentioning

confidence: 99%

Untitled

El-Zawawy¹

2011

ScienceAsia

View full text Add to dashboard Cite

The use of pointers and data-structures based on pointers results in circular memory references that are interpreted by a vital compiler analysis, namely pointer analysis. For a pair of memory references at a program point, a typical pointer analysis specifies if the points-to relation between them may exist, definitely does not exist, or definitely exists. The "may be" case, which describes the points-to relation for most of the pairs, cannot be dealt with by most compiler optimizations. This is so to guarantee the soundness of these optimizations. However, the "may be" case can be capitalized by the modern class of speculative optimizations if the probability that two memory references alias can be measured. Focusing on multithreading, a prevailing technique of programming, this paper presents a new flow-sensitive technique for probabilistic pointer analysis of multithreaded programs. The proposed technique has the form of a type system and calculates the probability of every points-to relation at each program point. The key to our approach is to calculate the points-to information via a post-type derivation. The use of type systems has the advantage of associating each analysis results with a justification (proof) for the correctness of the results. This justification has the form of a type derivation and is very much required in applications like certified code.

show abstract

Flow Sensitive-Insensitive Pointer Analysis Based Memory Safety for Multithreaded Programs

Cited by 10 publications

References 25 publications

Type Systems Based Data Race Detector

Type Systems Based Data Race Detector

New Error-recovery Techniques for Faulty-Calls of Functions

Untitled

Contact Info

Product

Resources

About