New Error-recovery Techniques for Faulty-Calls of Functions

El-Zawawy, Mohamed A.; Daoud, Nagwan Moustafa

doi:10.5539/cis.v5n3p67

Cited by 9 publications

(4 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Producing probabilistic techniques for important analyses (such as dead-code elimination) for SPMD programs that uses the results of the analysis proposed in this paper would be an important contribution. Producing other analyses for the langauge model of this paper in the spirit of [37], [38], [39] is another direction for future work. There is also a need for precise probabilistic operational semantics for SPMD programs.…”

Section: Discussionmentioning

confidence: 99%

Probabilistic Alias Analysis for Parallel Programming in SSA Forms

El-Zawawy,

Alanazi

2014

Preprint

Self Cite

View full text Add to dashboard Cite

Static alias analysis of different type of programming languages has been drawing researcher attention.However most of the results of existing techniques for alias analysis are not precise enough compared to needs of modern compilers. Probabilistic versions of these results, in which result elements are associated with occurrence probabilities, are required in optimizations techniques of modern compilers.This paper presents a new probabilistic approach for alias analysis of parallel programs. The treated parallelism model is that of SPMD where in SPMD, a program is executed using a fixed number of program threads running on distributed machines on different data. The analyzed programs are assumed to be in the static single assignment (SSA) form which is a program representation form facilitating program analysis. The proposed technique has the form of simply-structured system of inference rules. This enables using the system in applications like Proof-Carrying Code (PPC) which is a general technique for proving the safety characteristics of modern programs.

show abstract

Section: Discussionmentioning

confidence: 99%

Probabilistic Alias Analysis for Parallel Programming in SSA Forms

El-Zawawy,

Alanazi

2014

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…This will increase the trust level of these programs. Another direction for future work is to develop type systems to detect eventerrors in the sense of the work in [23]. Implementing the problems of indoor mobile target localization (for wireless sensor networks) [38] and that of CSPs search strategies [45] (for control network programmings) using ImpNet are among interesting directions of future work.…”

Section: Future Workmentioning

confidence: 99%

ImpNet: Programming Software-Defied Networks Using Imperative Techniques

El-Zawawy,

AlSalem

2014

Preprint

Self Cite

View full text Add to dashboard Cite

Software and hardware components are basic parts of modern networks. However the software component is typical sealed and function-oriented. Therefore it is very difficult to modify these components. This badly affected networking innovations. Moreover, this resulted in network policies having complex interfaces that are not user-friendly and hence resulted in huge and complicated flow tables on physical switches of networks. This greatly degrades the network performance in many cases. Software-Defined Networks (SDNs) is a modern architecture of networks to overcome issues mentioned above. The idea of SDN is to add to the network a controller device that manages all the other devices on the network including physical switches of the network. One of the main tasks of the managing process is switch learning; achieved via programming physical switches of the network by adding or removing rules for packet-processing to/from switches, more specifically to/from their flow tables. A high-level imperative network programming language, called ImpNet, is presented in this paper. ImpNet enables writing efficient, yet simple, and powerful programs to run on the controller to control all other network devices including switches. ImpNet is compositional, simply-structured, expressive, and more importantly imperative. The syntax of ImpNet together two types of operational semantics to contracts of ImpNet are presented in the paper. The proposed semantics are of the static and dynamic types. Two modern application programmed using ImpNet are shown in the paper as well. The semantics of the applications are shown in the paper also.

show abstract

“…Other techniques that are based on separation logic [10,17] simulates destructive updates of heaps and how these updates modify heap layout [18,12,19,11,20,21,22,23,24,25]. These techniques precisely simulate complicated heap operations but the limitations imposed by them render these techniques inappropriate for region analysis.…”

Section: Dag Abstractionmentioning

confidence: 99%

Recognition of logically related regions based heap abstraction

El-Zawawy

2012

Journal of the Egyptian Mathematical Society

Self Cite

View full text Add to dashboard Cite

This paper presents a novel set of algorithms for heap abstraction, identifying logically related regions of the heap. The targeted regions include objects that are part of the same component structure (recursive data structure). The result of the technique outlined in this paper has the form of a compact normal form (an abstract model) that boosts the efficiency of the static analysis via speeding its convergence. The result of heap abstraction, together with some properties of data structures, can be used to enable program optimizations like static deallocation, pool allocation, region-based garbage collection, and object co-location.More precisely, this paper proposes algorithms for abstracting heap components with the layout of a singly linked list, a binary tree, a cycle, and a directed acyclic graph. The termination and correctness of these algorithms are studied in the paper. Towards presenting the algorithms the paper also presents concrete and abstract models for heap representations.

show abstract

New Error-recovery Techniques for Faulty-Calls of Functions

Cited by 9 publications

References 21 publications

Probabilistic Alias Analysis for Parallel Programming in SSA Forms

Probabilistic Alias Analysis for Parallel Programming in SSA Forms

ImpNet: Programming Software-Defied Networks Using Imperative Techniques

Recognition of logically related regions based heap abstraction

Contact Info

Product

Resources

About