BSL
2008
13 years 4 months ago
2008
Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingle nu...
CSL
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sealgorithm, there is an abstract state ma...
CAV
2007
Springer
13 years 8 months ago
2007
Springer
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...
FMCO
2003
Springer
13 years 9 months ago
2003
Springer
ract State Machine Language, AsmL, is a novel executable specification based on the theory of Abstract State Machines. AsmL is object-oriented, provides high-level mathematical d...
ASM
2004
ASM
13 years 10 months ago
2004
ASM
For a while it seemed possible to pretend that all interaction between an algorithm and its environment occurs inter-step, but not anymore. Andreas Blass, Benjamin Rossman and the ...
ASM
2005
ASM
13 years 10 months ago
2005
ASM
Abstract. Exploration algorithms are relevant to the industrial practice of gentest cases from an abstract state machine whose runs define the predicted behavior of the software s...
ASM
2005
ASM
13 years 10 months ago
2005
ASM
Abstract. In this paper we consider the following task: given an abstract state machine, characterize the subsets of initial values corresponding to different typical scenarios of...