Sciweavers

442 search results - page 22 / 89
» Model Checking of Systems Employing Commutative Functions
Sort
View
MSS
1999
IEEE
150views Hardware» more  MSS 1999»
14 years 22 days ago
Performance Benchmark Results for Automated Tape Library High Retrieval Rate Applications - Digital Check Image Retrievals
Benchmark tests have been designed and conducted for the purpose of evaluating the use of automated tape libraries in on-line digital check image retrieval applications. This type...
John Gniewek, George Davidson, Bowen Caldwell
ADAEUROPE
2008
Springer
13 years 10 months ago
On the Timed Automata-Based Verification of Ravenscar Systems
The Ravenscar profile for Ada enforces several restrictions on the usage of general-purpose tasking constructs, thereby facilitating most analysis tasks and in particular functiona...
Iulian Ober, Nicolas Halbwachs
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 7 months ago
Towards A Shape Analysis for Graph Transformation Systems
Graphs and graph transformation systems are a frequently used modelling technique for a wide range of different domains, covering areas as diverse as refactorings, network topolog...
Dominik Steenken, Heike Wehrheim, Daniel Wonisch
CAV
2009
Springer
209views Hardware» more  CAV 2009»
14 years 9 months ago
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamari...
AML
1998
60views more  AML 1998»
13 years 8 months ago
A restricted computation model on Scott domains and its partial primitive recursive functionals
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
Karl-Heinz Niggl