Zobrazeno 1 - 3
of 3
pro vyhledávání: '"V. S. Burenkov"'
Autor:
V. S. Burenkov, A. S. Kamkin
Publikováno v:
Труды Института системного программирования РАН, Vol 28, Iss 4, Pp 57-76 (2018)
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 pro
Externí odkaz:
https://doaj.org/article/07be596aa44c46e9b29bfc5c9403b61e
Autor:
V. S. Burenkov
Publikováno v:
Труды Института системного программирования РАН, Vol 29, Iss 4, Pp 231-246 (2018)
This paper introduces a technique for scalable functional verification of cache coherence protocols that is based on the verification method, which was previously developed by the author. Scalability means that verification efforts do not depend on t
Externí odkaz:
https://doaj.org/article/a7b5c8f2f65f431a85c6f6eac82244a5
Autor:
V S Burenkov
Publikováno v:
Труды Института системного программирования РАН, Vol 29, Iss 4, Pp 231-246 (2018)
This paper introduces a technique for scalable functional verification of cache coherence protocols that is based on the verification method, which was previously developed by the author. Scalability means that verification efforts do not depend on t