Checking Parameterized Promela Models of Cache Coherence Protocols
This paper introduces a method for scalable verification of cache coherence protocols described in the Promela language. Scalability means that resources spent on verification (first of all, machine time and memory) do not depend on the number of processors in the system under verification. The meth...
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Russian Academy of Sciences, Ivannikov Institute for System Programming
2018-10-01
|
| Colecção: | Труды Института системного программирования РАН |
| Assuntos: | |
| Acesso em linha: | https://ispranproceedings.elpub.ru/jour/article/view/139 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|