TAILIEUCHUNG - Lecture Programming languages (2/e): Chapter 18a - Tucker, Noonan

Chapter 18 - Program correctness. This chapter provides knowledge of axiomatic semantics. This chapter includes contents: Fundamental concepts, the assignment rule, rules of consequence, correctness of the max function, correctness of programs with loops. | Programming Languages 2nd edition Tucker and Noonan Chapter 18 Program Correctness To treat programming scientifically, it must be possible to specify the required properties of programs precisely. Formality is certainly not an end in itself. The importance of formal specifications must ultimately rest in their utility - in whether or not they are used to improve the quality of software or to reduce the cost of producing and maintaining software. J. Horning Contents Axiomatic Semantics Fundamental Concepts The Assignment Rule Rules of Consequence Correctness of the Max Function Correctness of Programs with Loops Formal Methods Tools: JML Correctness of Object-Oriented Programs Correctness of Functional Programs Motivation A correct program is one that does exactly what it is intended to do, no more and no less. A formally correct program is one whose correctness can be proved mathematically. This requires a language for specifying precisely what the program is intended to do. Specification languages are based in mathematical logic. Hoare invented “axiomatic semantics” in 1969 as a tool for specifying program behavior and proving correctness. Until recently, correctness has been an academic exercise. Now it is a key element of critical software systems. Correctness Tools Theorem provers PVS Modeling languages UML and OCL Specification languages JML Programming language support Eiffel Java Spark/Ada Specification Methodology Design by contract Axiomatic Semantics Axiomatic semantics is a language for specifying what a program is supposed to do. Based on the idea of an assertion: An assertion is a predicate that describes the state of a program at a point in its execution. A postcondition is an assertion that states the program’s result. A precondition is an assertion that states what must be true before the program begins running. A “Hoare Triple” has the form {P}s{Q} {true} int Max (int a, int b) { int m; .

• Kỹ thuật lập trình
• Programming languages
• Lecture Programming languages
• Ngôn ngữ lập trình
• Program correctness
• Axiomatic semantics
• The assignment rule
• experience in programming
• software engineering
• programming languages​​
• computer programming
• programming tips
• programming experience
• code programming
• design tips
• programming documentation
• programming skills
• the Ruby programming document
• methods Ruby programming language
• Imperative programming
• Imperative languages
• Dynamic allocation
• Discovering Computers
• Program Development
• Low Level Languages
• Procedural Languages
• Object Oriented Programming Languages
• java programming language C + +
• C programming
• computer software
• computer engineering
• computer programming language PHP
• Functional programming
• Functional programming models
• Lambda calculus
• Logic programming
• Logic programming in prolog
• Prolog program elements
• Scripting languages
• Lecture Introduction to computing
• Bài giảng Nhập môn máy tính
• Introduction to computing
• Role of programming languages
• Android Programming
• Java
• programming code
• Procedural abstraction
• Data structures
• Matrix multiplication
• Object oriented programming
• Abstract data types
• The object model
• Object oriented language
• Represent polynomials
• Symbolic differentiation
• Mixed language
• Scripting language
• Semantics of clite
• List comprehensions
• Practical aspects of prolog
• Natural language processing
• Event driven programming
• Event driven control
• Event handling
• Java applet
• Tic Tac Toe