Digital forensics investigator faces the challenge of reliability of forensic conclusions. Formal automatic analysis method
is helpful to deal with the challenge. The finite state machine analysis method tries to determine all possible sequences of
events that could have happened in a digital system during an incident. Its basic idea is to model the target system using
a finite state machine and then explore its all possible states on the condition of available evidence. Timed mealy finite
state machine is introduced to model the target system, and the formalization of system running process and evidence is
presented to match the system running with possible source evidence automatically. Based on Gladyshev's basic
reasoning method, general reasoning algorithms with multi strategies are developed to find the possible real scenarios.
Case study and experimental results show that our method is feasible and adaptable to possible cases and takes a further
step to practical formal reasoning for digital forensics.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.