Sciweavers

80 search results - page 10 / 16
» Testing of Object-Oriented Programs Based on Finite State Ma...
Sort
View
COLT
1995
Springer
13 years 11 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
TVLSI
2008
140views more  TVLSI 2008»
13 years 7 months ago
A Novel Mutation-Based Validation Paradigm for High-Level Hardware Descriptions
We present a Mutation-based Validation Paradigm (MVP) technology that can handle complete high-level microprocessor implementations and is based on explicit design error modeling, ...
Jorge Campos, Hussain Al-Asaad
ICWS
2010
IEEE
13 years 9 months ago
WebMov: A Dedicated Framework for the Modelling and Testing of Web Services Composition
This paper presents a methodology and a set of tools for the modelling, validation and testing of Web service composition, conceived and developed within the French national projec...
Ana R. Cavalli, Tien-Dung Cao, Wissam Mallouli, El...
ICES
2000
Springer
140views Hardware» more  ICES 2000»
13 years 11 months ago
Evolving Cellular Automata for Self-Testing Hardware
Testing is a key issue in the design and production of digital circuits: the adoption of BIST (Built-In Self-Test) techniques is increasingly popular, but requires efficient algori...
Fulvio Corno, Matteo Sonza Reorda, Giovanni Squill...
EURODAC
1994
IEEE
110views VHDL» more  EURODAC 1994»
13 years 11 months ago
Symbolic exploration of large circuits with enhanced forward/backward traversals
Symbolic state space exploration techniques for Finite State Machines (FSMs) are a major recent result in CAD for VLSI. Most of them are exact and based on forward traversal, but ...
Gianpiero Cabodi, Paolo Camurati, Stefano Quer