Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
: Forensic hash tools are usually used to prove and protect the integrity of digital evidence: When a file is intercepted by law enforcement, a cryprographic fingerprint is taken...
Harish Daiya, Maximillian Dornseif, Felix C. Freil...
In real-time systems, dynamic inconsistencies of software are hardly detected, diagnosed and handled. A built-in test (BIT) method is developed to cope with software dynamic incon...
Yingxu Wang, Graham King, Dilip Patel, Shushma Pat...
As we move to developing object-oriented programs, the complexity traditionally found in functions and procedures is moving to the connections among components. Different faults o...