Redundancy check algorithm

Cyclic Redundancy Check(CRC) This algorithm is a software implementaticyclic redundancy check used in the Ethernet protocol. This program is from the telecomm packa of MiBench suite. 

Use of development tools (e.g., compilers, linkers, debuggers) Evidence of Source Code Reviews prior to formal testing (checking design, adherence to coding standards, logic, redundant code, critical algorithms) (see Sections 8.1.3, 8.2.1 and Appendix B) Independence and qualifications of reviewers... 

Section 6.3 presents polynomial-time algorithms to check for well-posedness, make the constraints well-posed with minimal serialization, remove redundant anchors, and find the minimum relative schedule. Section 6.4 analyzes the properties of the algorithms. In particular, we show that the algorithms are guaranteed to yield a minimally serialized, well-posed, minimum schedule, if one exists. Finally, Section 6.5 summarizes the relative scheduling approach. 

---