Rafat Alshorman

Publications (8) View all

• Conference Proceeding: Multi-step transactions specification and verification in a mobile database community

  R. Alshorman, W. Hussak
  [show abstract] [hide abstract]
  ABSTRACT: Executions of concurrent multi-step transactions interleave steps in ways that improve the throughput of the particular transactions processing system. In this paper, we use temporal logic to specify and verify formally the correctness of local and mobile transactions executing concurrently on a mobile database. The correctness condition is that of serializability which we specify in CTL (Computational Tree Logic). The reason for using a temporal logic such as CTL, is that the method can be extended to verifying infinite schedules modelling mobile environments such as MDBCs (mobile database communities). The verification is carried out using the symbolic model checking NuSMV. We verify that a local scheduler based on timestamps serializes local and mobile multi-step transactions.
  Information and Communication Technologies: From Theory to Applications, 2008. ICTTA 2008. 3rd International Conference on; 05/2008
• Article: Multi-step transactions specification and verification in a mobile database community

  Rafat Alshorman, Walter Hussak
  [show abstract] [hide abstract]
  ABSTRACT: This is a conference paper [© IEEE]. It is also available from: http://ieeexplore.ieee.org. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Executions of concurrent multi-step transactions interleave steps in ways that improve the throughput of the particular transactions processing system. In this paper, we use temporal logic to specify and verify formally the correctness of local and mobile transactions executing concurrently on a mobile database. The correctness condition is that of serializability which we specify in CTL (Computational Tree Logic). The reason for using a temporal logic such as CTL, is that the method can be extended to verifying infinite schedules modelling mobile environments such as MDBCs (mobile database communities). The verification is carried out using the symbolic model checking NuSMV. We verify that a local scheduler based on timestamps serializes local and mobile multi-step transactions. Published
• Article: The quality of e-learning management systems from social requirements prospective

  Hamed Fawareh, Rafat Alshorman
  Arab international journal of informatics. 01/2012; 1.
• Book: Specifications and Verifications of Transactions in Mobile Environment: Temporal Logics Specifications and Verifications

  Rafat Alshorman, Walter Hussak
  1 01/2011; LAP LAMBERT Academic Publishing (15 Dec 2011)., ISBN: 3845421312
• Article: New multiple soliton solutions for generalized variable-coefficient Kadomtsev.Petviashvili equation

  Fadi Awawdeh, Rafat Alshorman
  Computers and Mathematics with Applications, Elsevier. 01/2011;