Sciweavers

283 search results - page 4 / 57
» A New DNA Implementation of Finite State Machines
Sort
View
KBSE
2008
IEEE
14 years 2 months ago
Inferring Finite-State Models with Temporal Constraints
Finite state machine-based abstractions of software behaviour are popular because they can be used as the basis for a wide range of (semi-) automated verification and validation ...
Neil Walkinshaw, Kirill Bogdanov
19
Voted
IPPS
2003
IEEE
14 years 28 days ago
Lazy Parallelization: A Finite State Machine Based Optimization Approach for Data Parallel Image Processing Applications
Performance obtained with existing library-based parallelization tools for implementing high performance image processing applications is often sub-optimal. This is because inter-...
Frank J. Seinstra, Dennis Koelma
PTS
2003
108views Hardware» more  PTS 2003»
13 years 9 months ago
Fault Diagnosis in Extended Finite State Machines
In this paper, we propose a method for the derivation of an adaptive diagnostic test suite when the system specification and implementation are given in the form of an extended fin...
Khaled El-Fakih, Svetlana Prokopenko, Nina Yevtush...
ICDCS
2007
IEEE
14 years 2 months ago
Testing Security Properties of Protocol Implementations - a Machine Learning Based Approach
Security and reliability of network protocol implementations are essential for communication services. Most of the approaches for verifying security and reliability, such as forma...
Guoqiang Shu, David Lee
DATE
1999
IEEE
80views Hardware» more  DATE 1999»
13 years 12 months ago
Symbolic Reachability Analysis of Large Finite State Machines Using Don't Cares
Reachability analysis of finite state machines is essential to many computer-aided design applications. We present new techniques to improve both approximate and exact reachabilit...
Youpyo Hong, Peter A. Beerel