You are cordially invited to attend the following 3 Seminars Today, Wednesday. 18/3, 2:30 pm, room 22-119
In this presentation I am going to introduce Digital Forensics (DF) and some related terminologies. After that, some of the challenges facing DF will be shown. At the end, I will be finishing by Cloud Forensics as case study on one of the self-hosted clouds, own Cloud.
Speaker's Biography: Mohammed Samara, Master Student in Computer Engineering Department since February 2014. Finished high school from Saudi Arabia. Finished Bachelor degree in Computer Engineering from Islamic University of Gaza. Interested in Computer Applications in general, especially Embedded Systems, Computer Vision, and Digital Forensics.
Seminar 2: Applying Backward Traversal Slicing to Use Case Maps
Abstract
Backward traversal slicing is one of program slicing techniques which classified into static slicing. It can be defined by subset of program which contains instructions or statements that will affect and contribute to value of variables in criterion. This paper applies the backward traversal slicing technique to Use Case Maps (UCM) notation. UCM will represent as the high level of software instead of real source code. The tool was built can read and simulate the UCM file into backward traversal slicing technique.
Speaker's Biography:
Name: Yusuf Mufti M, Degree: Master student Department / Major : ICS / Software Engineering Student id: 201402360
Seminar 3: Rewriting Logic in Maude
Abstract
Rewriting logic is a simple computational logic that can naturally expresses both concurrent computation and logical deduction with great generality. Maude is an implementation of rewriting logic and a high-performance language and system supporting both equational and rewriting logic computation for a wide range of applications. One of the examples that is rewritten in Maude is Boolean Satisfiability problem (SAT) which lies at the heart of complexity theory. It is the basis of many practical applications in different areas such as: Electronic Design Automation, Verification, Artificial Intelligence, and Operations Research. Most of such solvers of SAT problem depends on the Davis-Putnam-Logemann- Loveland (DPLL) procedure. This seminar provides a gentle, intuitive introduction about the main ideas about rewriting logic, Maude and some examples of rewriting theories.
Speaker’s Bio: Mr Osamah Al-Dhafer is a Master student in Computer Science and Engineering at King Fahd University of Petroleum and Minerals (KFUPM), Saudi Arabia. He obtained his Bachelor of Science (BS) degree with honors in Computer from King Khalid University, Saudi, in June 2012.