Detection of Probabilistic Dangling References in Multi-core Programs Using Proof-Supported Tools

El-Zawawy, Mohamed A.

doi:10.1007/978-3-642-39640-3_38

Cited by 6 publications

(5 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For future work, it is interesting to devise static analyses for asynchronous programs using the model Asynch P [1]. Initial experiments show that our proposed model is expected to support devising robust and powerful analysis techniques.…”

Section: Related and Future Workmentioning

confidence: 99%

Asynchronous Programming in a Prioritized Form

El-Zawawy

2015

Preprint

Self Cite

View full text Add to dashboard Cite

Asynchronous programming has appeared as a programming style that overcomes undesired properties of concurrent programming. Typically in asynchronous models of programming, methods are posted into a post list for latter execution. The order of method executions is serial, but nondeterministic. This paper presents a new and simple, yet powerful, model for asynchronous programming. The proposed model consists of two components; a context-free grammar and an operational semantics. The model is supported by the ability to express important applications. An advantage of our model over related work is that the model simplifies the way posted methods are assigned priorities. Another advantage is that the operational semantics uses the simple concept of singly linked list to simulate the prioritized process of methods posting and execution. The simplicity and expressiveness make it relatively easy for analysis algorithms to disclose the otherwise un-captured programming bugs in asynchronous programs.

show abstract

Section: Related and Future Workmentioning

confidence: 99%

Asynchronous Programming in a Prioritized Form

El-Zawawy

2015

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…One such direction is to develop methods for static analysis of network programming languages. Obviously associating these analyses with correctness proofs, in the spirit of [18,19,20,21], will have many network applications. Developing denotational semantics [17] for network programs is a very interesting direction for future research.…”

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

“…One such direction is develop methods for static analysis of network programming languages. Obviously associating these analyses with correctness proofs, in the spirit of [12,13,15,14], will have many network applications.…”

Section: Related and Future Workmentioning

confidence: 99%

ImNet: An Imperative Network Programming Language

El-Zawawy,

AlSalem

2014

Preprint

Self Cite

View full text Add to dashboard Cite

One of the most recent architectures of networks is Software-Defined Networks (SDNs) using a controller appliance to control the set of switches on the network. The controlling process includes installing or uninstalling packet-processing rules on flow tables of switches. This paper presents a high-level imperative network programming language, called ImNet, to facilitate writing efficient, yet simple, programs executed by controller to manage switches. ImNet is simply-structured, expressive, compositional, and imperative. This paper also introduces an operational semantics to ImNet. Detailed examples of programs (with their operational semantics) constructed in ImNet are illustrated in the paper as well.

show abstract

Detection of Probabilistic Dangling References in Multi-core Programs Using Proof-Supported Tools

Cited by 6 publications

References 27 publications

Asynchronous Programming in a Prioritized Form

Asynchronous Programming in a Prioritized Form

ImpNet: Programming Software-Defied Networks Using Imperative Techniques

ImNet: An Imperative Network Programming Language

Contact Info

Product

Resources

About