Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
BSL
2008
98views more  BSL 2008»
11 years 5 months ago
A Natural Axiomatization of Computability and Proof of Church's Thesis
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...
Nachum Dershowitz, Yuri Gurevich
CSL
2010
Springer
11 years 6 months ago
Exact Exploration and Hanging Algorithms
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...
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
CAV
2007
Springer
227views Hardware» more  CAV 2007»
11 years 9 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
FMCO
2003
Springer
144views Formal Methods» more  FMCO 2003»
11 years 10 months ago
Semantic Essence of AsmL
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...
Yuri Gurevich, Benjamin Rossman, Wolfram Schulte
ASM
2004
ASM
11 years 11 months ago
Intra-step Interaction
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 ...
Yuri Gurevich
ASM
2005
ASM
11 years 11 months ago
State Exploration with Multiple State Groupings
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...
Colin Campbell, Margus Veanes
ASM
2005
ASM
11 years 11 months ago
Scenario based Analysis of Linear Computations
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...
Vladimir Filatov, Rostislav Yavorskiy
books