2018
DOI: 10.1109/mm.2018.032271062
|View full text |Cite
|
Sign up to set email alerts
|

Full-Stack Memory Model Verification with TriCheck

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 6 publications
0
6
0
Order By: Relevance
“…Further, the framework automates deployments on MCUs with and without an FPU. Finally, [83] proposal enables ISA designers to iteratively refine and evaluate ISA specifications, allowing one to improve upon each result.…”
Section: ) Development Toolsmentioning
confidence: 99%
See 1 more Smart Citation
“…Further, the framework automates deployments on MCUs with and without an FPU. Finally, [83] proposal enables ISA designers to iteratively refine and evaluate ISA specifications, allowing one to improve upon each result.…”
Section: ) Development Toolsmentioning
confidence: 99%
“…Trippel et al [83] propose a memory verification model to check for bugs on hardware and software memory models by providing a tool capable of verifying High-level Language (HLL), compilers, and ISAs uphold MCM requirements. Further, the authors uncovers potential inefficiencies of the RISC-V ISA specification and identifies possible solutions to mitigate these inefficiencies.…”
Section: ) Memory Modelmentioning
confidence: 99%
“…The "PipeCheck" framework of Lustig, Martonosi et al [67,71,95,96] is designed to validate that processors faithfully implement their intended memory model, using a detailed pipeline semantics based on an axiomatic specification. Given that our approach has an underlying link to the behaviour of pipelines it may be possible to extend our framework so that it can make use of those existing tools for processor validation.…”
Section: Related Workmentioning
confidence: 99%
“…At time=31, a write-request due to St3 is issued to the L2 and the write is performed at the L2 at time=36. Because the lease for flag (35) would have expired, the L2 does not respond with a GWCT, and St3 completes at time=41. Meanwhile, at time=40, Ld1 attempts to read flag from the L1 but its lease would have expired at time=35.…”
Section: Consistency-directed Temporal Coherencementioning
confidence: 99%