Sciweavers

4340 search results - page 507 / 868
» Formal Methods and Cryptography
Sort
View
ACSD
2003
IEEE
102views Hardware» more  ACSD 2003»
15 years 10 months ago
Specification Coverage Aided Test Selection
In this paper test selection strategies in formal conformance testing are considered. As the testing conformance relation we use the ioco relation, and extend the previously prese...
Tuomo Pyhälä, Keijo Heljanko
CHARME
2001
Springer
162views Hardware» more  CHARME 2001»
15 years 10 months ago
Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking
We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system ba...
Kenneth L. McMillan
HPCN
1995
Springer
15 years 10 months ago
A model-driven tool for performance measurement and analysis of parallel programs
The performance of parallel computing systems is strongly dependent on the runtime behaviour of parallel programs. This paper describes a new approach to measure and analyze the ru...
Xiandeng Huang, Christoph Steigner
AIPS
2008
15 years 9 months ago
A New Probabilistic Plan Recognition Algorithm Based on String Rewriting
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yapp...
Christopher W. Geib, John Maraist, Robert P. Goldm...
IJCAI
2007
15 years 8 months ago
From Sampling to Model Counting
We introduce a new technique for counting models of Boolean satisfiability problems. Our approach incorporates information obtained from sampling the solution space. Unlike previ...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...