LAFF - On Programming for Correctness
In this computer science course, we will present "goal oriented programming" the way Edsger Dijkstra, one of the most influential computer scientists, intended. You will learn how to derive programs hand-in-hand with their proofs of correctness. The course presents a methodology that illustrates goal-oriented programming, starting with the formalization of what is to be computed, and then growing the program hand-in-hand with its proof of correctness. The methodology demonstrates that, for a broad class of matrix operations, the development, implementation, and establishment of correctness of a program can be made systematic.
Since this technique focuses on program specifications, it often leads to clearer, correct programs in less time. The approach rapidly yields a family of algorithms from which you can then pick the algorithm that has desirable properties, such as attaining better performance on a given architecture.
Upcoming start dates
- Self-paced Online
Who should attend?
Course delivery details
This course is offered through The University of Texas at Austin, a partner institute of EdX.
4-6 hours per week
- Verified Track -$99
- Audit Track - Free
Certification / Credits
What you'll learn
- Develop assertions describing states in a program.
- Prove programs correct using logic.
- Build algorithms using goal-oriented programming techniques.
- Slice and dice to discover families of loop-based algorithms for matrix computations.
Contact this provider
edX For Business helps leading companies upskill their labor forces by making the world’s greatest educational resources available to learners across a wide variety of in-demand fields. edX For Business delivers high-quality corporate eLearning to train and engage your employees...