Mohamed A. El-Zawawy

Orcid: 0000-0002-5208-124X

According to our database1, Mohamed A. El-Zawawy authored at least 45 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Location-Aware and Healing Attestation Scheme for Air-Supported Internet of Vehicles.
IEEE Trans. Intell. Transp. Syst., February, 2024

2023
Honey-list based authentication protocol for industrial IoT swarms.
Comput. Commun., November, 2023

Authenticating Drone-Assisted Internet of Vehicles Using Elliptic Curve Cryptography and Blockchain.
IEEE Trans. Netw. Serv. Manag., June, 2023

2022
Formal model for inter-component communication and its security in android.
Computing, 2022

SETCAP: Service-Based Energy-Efficient Temporal Credential Authentication Protocol for Internet of Drones.
Comput. Networks, 2022

2021
Do not let Next-Intent Vulnerability be your next nightmare: type system-based approach to detect it in Android apps.
Int. J. Inf. Sec., 2021

Vulnerabilities in Android webview objects: Still not the end!
Comput. Secur., 2021

2019
A new technique for intent elicitation in Android applications.
Iran J. Comput. Sci., 2019

2017
Posting Graphs for Finding Non-Terminating Executions in Asynchronous Programs.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

Separation Logic for States Dependencies in Life Cycles of Android Activities and Fragments.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

Modeling Android Fragments and Activities Life Cycles Coordination.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

2016
Finding Divergent Executions in Asynchronous Programs.
Proceedings of the Computational Science and Its Applications - ICCSA 2016, 2016

A Type System for Android Applications.
Proceedings of the Computational Science and Its Applications - ICCSA 2016, 2016

An Operational Semantics for Android Applications.
Proceedings of the Computational Science and Its Applications - ICCSA 2016, 2016

2015
Asynchronous Programming in a Prioritized Form.
CoRR, 2015

An Efficient Layer-Aware Technique for Developing Asynchronous Context-Oriented Software (ACOS).
Proceedings of the 15th International Conference on Computational Science and Its Applications, 2015

Boosting the Software Quality of Parallel Programming Using Logical Means.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

Novel Designs for Memory Checkers Using Semantics and Digital Sequential Circuits.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

2014
ImpNet: Programming Software-Defied Networks Using Imperative Techniques.
CoRR, 2014

Probabilistic Alias Analysis for Parallel Programming in SSA Forms.
CoRR, 2014

An Efficient Binary Technique for Trace Simplifications of Concurrent Programs.
CoRR, 2014

ImNet: An Imperative Network Programming Language.
CoRR, 2014

A new model for Context-Oriented Programs.
CoRR, 2014

Distributed Data and Programs Slicing.
CoRR, 2014

Testing Automation of Context-Oriented Programs Using Separation Logic.
Appl. Comput. Intell. Soft Comput., 2014

ConNet: A Network Programming Language with Concurrency.
Proceedings of the 2014 14th International Conference on Computational Science and Its Applications, Guimaraes, Portugal, June 30, 2014

Certified Transformation for Static Single Assignment of SPMD Programs.
Proceedings of the 2014 14th International Conference on Computational Science and Its Applications, Guimaraes, Portugal, June 30, 2014

Proof-Carrying Model for Parsing Techniques.
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014

2013
Detection of Probabilistic Dangling References in Multi-core Programs Using Proof-Supported Tools.
Proceedings of the Computational Science and Its Applications - ICCSA 2013, 2013

Frequent Statement and De-reference Elimination for Distributed Programs.
Proceedings of the Computational Science and Its Applications - ICCSA 2013, 2013

2012
Recognition of Logically Related Regions Based Heap Abstraction
CoRR, 2012

Dead code elimination based pointer analysis for multithreaded programs
CoRR, 2012

Dynamic Verification for File Safety of Multithreaded Programs
CoRR, 2012

Efficient techniques for mining spatial databases
CoRR, 2012

Type Systems Based Data Race Detector.
Comput. Inf. Sci., 2012

New Error-recovery Techniques for Faulty-Calls of Functions.
Comput. Inf. Sci., 2012

Abstraction Analysis and Certified Flow and Context Sensitive Points-to Relation for Distributed Programs.
Proceedings of the Computational Science and Its Applications - ICCSA 2012, 2012

Heap Slicing Using Type Systems.
Proceedings of the Computational Science and Its Applications - ICCSA 2012, 2012

2011
Probabilistic pointer analysis for multithreaded programs
CoRR, 2011

Partial Redundancy Elimination for Multi-threaded Programs
CoRR, 2011

Program Optimization Based Pointer Analysis and Live Stack-Heap Analysis
CoRR, 2011

Flow Sensitive-Insensitive Pointer Analysis Based Memory Safety for Multithreaded Programs.
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

2009
Algorithm for Spatial Clustering with Obstacles
CoRR, 2009

Clustering with Obstacles in Spatial Databases
CoRR, 2009

2006
Priestley Duality for Strong Proximity Lattices.
Proceedings of the 22nd Annual Conference on Mathematical Foundations of Programming Semantics, 2006


  Loading...