A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures
From MaRDI portal
Publication:877828
DOI10.1007/S10817-006-9035-0zbMATH Open1113.68091OpenAlexW1992409933MaRDI QIDQ877828FDOQ877828
Authors: Panagiotis Manolios, Sudarshan K. Srinivasan 
Publication date: 3 May 2007
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-006-9035-0
Recommendations
Cites Work
- Characterizing finite Kripke structures in propositional temporal logic
- Title not available (Why is that?)
- Computer Aided Verification
- The Mechanical Evaluation of Expressions
- Definitional interpreters for higher-order programming languages
- A Mechanically Checked Proof of IEEE Compliance of the Floating Point Multiplication, Division and Square Root Algorithms of the AMD-K7™ Processor
- Title not available (Why is that?)
- Correct Hardware Design and Verification Methods
- Computer Aided Verification
- Title not available (Why is that?)
- Computer Aided Verification
- Functional programming languages and computer architecture, 2nd Conference, Nancy, France, September 16-19, 1985
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inductive assertions and operational semantics
Cited In (4)
Uses Software
This page was built for publication: A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877828)
