Sciweavers

283 search results - page 14 / 57
» A New DNA Implementation of Finite State Machines
Sort
View
PTS
2000
58views Hardware» more  PTS 2000»
13 years 9 months ago
Formal Test Automation: The Conference Protocol with PHACT
We discuss a case study of automatic test generation and test execution based on formal methods. The case is the Conference Protocol, a simple, chatbox-like protocol, for which (fo...
Lex Heerink, Jan Feenstra, Jan Tretmans
QSIC
2003
IEEE
14 years 29 days ago
Validating Use-Cases with the AsmL Test Tool
The Abstract State Machine Language supports use-case oriented modeling in a faithful way. In this paper we discuss how the AsmL test tool, a new component of the AsmL tool environ...
Michael Barnett, Wolfgang Grieskamp, Wolfram Schul...
DSN
2011
IEEE
12 years 7 months ago
Analysis of security data from a large computing organization
In this work, we study security incidents that occurred over period of 5 years at the National Center for Supercomputing Applications at the University of Illinois. The analysis co...
Aashish Sharma, Zbigniew Kalbarczyk, James Barlow,...
EUROGP
2007
Springer
164views Optimization» more  EUROGP 2007»
14 years 1 months ago
The Induction of Finite Transducers Using Genetic Programming
This paper reports on the results of a preliminary study conducted to evaluate genetic programming (GP) as a means of evolving finite state transducers. A genetic programming syste...
Amashini Naidoo, Nelishia Pillay
CONCUR
2000
Springer
13 years 11 months ago
Reachability Analysis for Some Models of Infinite-State Transition Systems
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
Oscar H. Ibarra, Tevfik Bultan, Jianwen Su