Sciweavers

1116 search results - page 25 / 224
» Applying Predicate Abstraction to Abstract State Machines
Sort
View
BSL
2008
98views more  BSL 2008»
14 years 11 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
83
Voted
EUROCRYPT
2003
Springer
15 years 4 months ago
Nearly One-Sided Tests and the Goldreich-Levin Predicate
Abstract. We study statistical tests with binary output that rarely outputs one, which we call nearly one-sided statistical tests. We provide an efficient reduction establishing im...
Gustav Hast
ICFEM
2005
Springer
15 years 4 months ago
29 New Unclarities in the Semantics of UML 2.0 State Machines
Abstract. UML 2.0, which is the standard modeling language for objectoriented systems, has only an informally given semantics. This is in particular the case for UML 2.0 state mach...
Harald Fecher, Jens Schönborn, Marcel Kyas, W...
FASE
2009
Springer
15 years 5 months ago
Control Dependence for Extended Finite State Machines
Abstract. Though there has been nearly three decades of work on program slicing, there has been comparatively little work on slicing for state machines. One of the primary challeng...
Kelly Androutsopoulos, David Clark, Mark Harman, Z...
IJCNN
2008
IEEE
15 years 5 months ago
A formula of equations of states in singular learning machines
Abstract— Almost all learning machines used in computational intelligence are not regular but singular statistical models, because they are nonidentifiable and their Fisher info...
Sumio Watanabe