Recorded Webinar: High Integrity Software Development 05: Proving Algorithmic Correctness

Complete this request form for immediate access to this webinar and other recorded webinars

Webinar Series (Part 5):

In this webinar we discuss the idea of using formal methods to prove algorithmic correctness. Executing test cases proves that the algorithm is correct for that single input case. The use of formal methods analysis allows the developer to ensure that the algorithm is correct for all possible inputs. Except for the simplest algorithms, this level of rigor and robustness is typically impossible to ensure via testing alone.

This example uses Simulink and Simulink Design Verifier to apply formal methods to an algorithm to prove correct functional behavior in all possible scenarios.

Product Focus

Simulink® Design Verifier
DO Qualification Kit

This webinar was recorded on 30 Sep 2009

Contact Information

*Country/Region

Salutation

*First Name

Middle Name

*Last Name

Job Title

Department

Mail Stop

*Company / University

Note: Please enter the official name.

*Street Address 1

Street Address 2

*City

*State

*Zip Code

*Email

*Phone

Extension

Fax

Mobile Phone

Other Information

Are you a MATLAB user?

Yes

Are you a Simulink user?

Yes

Which best describes your application?

Which best describes your industry?

Are you seeking further information on MathWorks products?

Yes

Are you seeking further information on pricing?

Yes

We will not sell or rent your personal contact information. See our privacy policy for details.