Sciweavers

205 search results - page 28 / 41
» Testing the Equivalence of Regular Languages
Sort
View
ENTCS
2008
120views more  ENTCS 2008»
14 years 9 months ago
Specifying and Executing Reactive Scenarios With Lutin
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...
Pascal Raymond, Yvan Roux, Erwan Jahier
CISIS
2008
IEEE
14 years 11 months ago
Multi-variant Program Execution: Using Multi-core Systems to Defuse Buffer-Overflow Vulnerabilities
While memory-safe and type-safe languages have been available for many years, the vast majority of software is still implemented in type-unsafe languages such as C/C++. Despite ma...
Babak Salamat, Andreas Gal, Todd Jackson, Karthike...
78
Voted
JALC
2007
109views more  JALC 2007»
14 years 9 months ago
A Family of NFAs Free of State Reductions
Merging states in finite automata is a main method of reducing the size of the representation of regular languages. The process has been extensively studied for deterministic fi...
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
DFT
2009
IEEE
210views VLSI» more  DFT 2009»
15 years 21 days ago
Optimizing Parametric BIST Using Bio-inspired Computing Algorithms
Optimizing the BIST configuration based on the characteristics of the design under test is a complicated and challenging work for test engineers. Since this problem has multiple o...
Nastaran Nemati, Amirhossein Simjour, Amirali Ghof...
IR
2002
14 years 9 months ago
Hierarchical Text Categorization Using Neural Networks
This paper presents the design and evaluation of a text categorization method based on the Hierarchical Mixture of Experts model. This model uses a divide and conquer principle to ...
Miguel E. Ruiz, Padmini Srinivasan