3 citations · 8 across the 13 of their papers we have counts for
16 papers
On The Effectiveness of Dynamic Reduction Techniques in Automated Program Repair
Omar I. Al-Bataineh
Repairing a large-scale buggy program using current automated program repair (APR) approaches can be a time-consuming operation that requires significant computational resources. W…
Invariant-based Program Repair
Omar I. Al-Bataineh
This paper describes a formal general-purpose automated program repair (APR) framework based on the concept of program invariants. In the presented repair framework, the execution…
Towards Extending the Range of Bugs That Automated Program Repair Can Handle
Omar I. Al-Bataineh, Leon Moonen
Modern automated program repair (APR) is well-tuned to finding and repairing bugs that introduce observable erroneous behavior to a program. However, a significant class of bugs do…
Towards More Reliable Automated Program Repair by Integrating Static Analysis Techniques
Omar I. Al-Bataineh, Anastasiia Grishina, Leon Moonen
A long-standing open challenge for automated program repair is the overfitting problem, which is caused by having insufficient or incomplete specifications to validate whether a ge…
Verifix: Verified Repair of Programming Assignments
Umair Z. Ahmed, Zhiyu Fan, Jooyong Yi +2
Automated feedback generation for introductory programming assignments is useful for programming education. Most works try to generate feedback to correct a student program by comp…
Monitoring Cumulative Cost Properties
Omar Al-Bataineh, Daniel Jun Xian Ng, Arvind Easwaran
This paper considers the problem of decentralized monitoring of a class of non-functional properties (NFPs) with quantitative operators, namely cumulative cost properties. The dece…
Smart Contract Repair
Xiao Liang Yu, Omar Al-Bataineh, David Lo +1
Smart contracts are automated or self-enforcing contracts that can be used to exchange assets without having to place trust in third parties. Many commercial transactions use smart…
Efficient LTL Decentralized Monitoring Framework Using Formula Simplification Table
Omar Al-Bataineh, David Rosenblum, Mark Reynolds
This paper presents a new technique for optimizing formal analysis of propositional logic formulas and Linear Temporal Logic (LTL) formulas, namely the formula simplification table…
Efficient Decentralized LTL Monitoring Framework Using Tableau Technique
Omar Al-Bataineh, David Rosenblum
This paper presents a novel framework for decentralized monitoring of Linear Temporal Logic (LTL), under the situation where processes are synchronous, uniform (i.e. all processes…
Computing Maximal Expected Termination Time of Probabilistic Timed Automata
Omar Al-Bataineh, Michael Fisher, David Rosenblum
The paper addresses the problem of computing maximal expected time to termination of probabilistic timed automata (PTA) models, under the condition that the system will, eventually…
Epistemic Model Checking of Atomic Commitment Protocols with Byzantine Failures
Omar Al-Bataineh
The notion of knowledge-based program introduced by Halpern and Fagin provides a useful formalism for designing, analysing, and optimising distributed systems. This paper formulate…
Finding Minimum and Maximum Termination Time of Timed Automata Models with Cyclic Behaviour
Omar Al-Bataineh, Mark Reynolds, Tim French
The paper presents a novel algorithm for computing best and worst case execution times (BCET/WCET) of timed automata models with cyclic behaviour. The algorithms can work on any ar…
Termination of Monotone Programs
Omar Al-Bataineh, Xie Xiaofei, Mark Reynolds
We present an efficient approach to prove termination of monotone programs with integer variables, an expressive class of loops that is often encountered in computer programs. Our…
Verifying Real-time Commit Protocols Using Dense-time Model Checking Technology
Omar I. Al-Bataineh, Mark Reynolds
The timed-based automata model, introduced by Alur and Dill, provides a useful formalism for describing real-time systems. Over the last two decades, several dense-time model check…
Abstraction for Epistemic Model Checking of Dining Cryptographers-based Protocols
Omar I. Al-Bataineh, Ron van der Meyden
The paper describes an abstraction for protocols that are based on multiple rounds of Chaum's Dining Cryptographers protocol. It is proved that the abstraction preserves a rich cla…
Epistemic Model Checking for Knowledge-Based Program Implementation: an Application to Anonymous Broadcast
Omar I. Al-Bataineh, Ron van der Meyden
Knowledge-based programs provide an abstract level of description of protocols in which agent actions are related to their states of knowledge. The paper describes how epistemic mo…