Verification of basic block schedules using RTL transformations

DOI10.1007/3-540-44798-9_16MaRDI QIDQ4788548zbMATH OpenFDO

Authors Rajesh Radhakrishnan, Elena Teica, Ranga Vemuri

Publication date 2 February 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44798-9_16

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies and applications (68U99)

Recommendations

• Formal verification of translation validators
• Verification of schedulability for real-time programs
• Theorem proving guided development of formal assertions in a resource-constrained scheduler for high-level synthesis
• Automated RTL verification based on predicate calculus
• Computer Aided Verification

This page was built for publication: Verification of basic block schedules using RTL transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4788548)