Sciweavers

749 search results - page 88 / 150
» Combinatory Models and Symbolic Computation
Sort
View
SASN
2003
ACM
14 years 3 months ago
Modeling vulnerabilities of ad hoc routing protocols
The purpose of this work is to automate the analysis of ad hoc routing protocols in the presence of attackers. To this end, a formal model of protocol behavior is developed in whi...
Shahan Yang, John S. Baras
ICFEM
2004
Springer
14 years 3 months ago
Verifying the On-line Help System of SIEMENS Magnetic Resonance Tomographs
d Abstract) Carsten Sinz and Wolfgang K¨uchlin Symbolic Computation Group, WSI for Computer Science, University of T¨ubingen and Steinbeis Technology Transfer Center OIT, 72076 T...
Carsten Sinz, Wolfgang Küchlin
SPIN
2005
Springer
14 years 3 months ago
Improving Spin's Partial-Order Reduction for Breadth-First Search
We describe an improvement of the partial-order reduction algorithm for breadth-first search which was introduced in Spin version 4.0. Our improvement is based on the algorithm by...
Dragan Bosnacki, Gerard J. Holzmann
BIRTHDAY
2009
Springer
13 years 11 months ago
Validating and Animating Higher-Order Recursive Functions in B
ProB is an animation and model checking tool for the B Method, which can deal with many interesting specifications. Some specifications, however, contain complicated functions whic...
Michael Leuschel, Dominique Cansell, Michael J. Bu...
IPL
2008
82views more  IPL 2008»
13 years 10 months ago
Confusion of memory
It is a truism that for a machine to have a useful access to memory or workspace, it must "know" where its input ends and its working memory begins. Most machine models ...
Lawrence S. Moss