Sciweavers

242 search results - page 4 / 49
» Using Abstract State Machines at Microsoft: A Case Study
Sort
View
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
13 years 7 months ago
Superstate identification for state machines using search-based clustering
State machines are a popular method of representing a syshigh level of abstraction that enables developers to gain an overview of the system they represent and quickly understand ...
Mathew Hall, Phil McMinn, Neil Walkinshaw
IWANN
2009
Springer
14 years 2 months ago
Aiding Test Case Generation in Temporally Constrained State Based Systems Using Genetic Algorithms
Generating test data for formal state based specifications is computationally expensive. This paper improves a framework that addresses this issue by representing the test data ge...
Karnig Derderian, Mercedes G. Merayo, Robert M. Hi...
FASE
2008
Springer
13 years 9 months ago
Regular Inference for State Machines Using Domains with Equality Tests
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 ...
Therese Berg, Bengt Jonsson, Harald Raffelt
CAV
2007
Springer
227views Hardware» more  CAV 2007»
13 years 11 months ago
The TASM Toolset: Specification, Simulation, and Formal Verification of Real-Time Systems
Abstract. In this paper, we describe the features of the Timed Abstract State Machine toolset. The toolset implements the features of the Timed Abstract State Machine (TASM) langua...
Martin Ouimet, Kristina Lundqvist
IEEESCC
2005
IEEE
14 years 1 months ago
Using a Rigorous Approach for Engineering Web Service Compositions: A Case Study
In this paper we discuss a case study for the UK Police IT Organisation (PITO) on using a model-based approach to verifying web service composition interactions for a coordinated ...
Howard Foster, Sebastián Uchitel, Jeff Mage...