Scribd Logo
Загрузить

Добро пожаловать в Scribd!

  • Axiomatic Semantics Exercise 5

    Загружено:

    vhiep1988
    5 просмотров1 страница
    The document contains 6 exercises asking to prove the correctness of various programs: 1) Swap the values of variables x and y. 2) Set x to its absolute value. 3) Count down from n to 0 using a while loop. 4) Compute the sum of the first n positive integers. 5) Compute the product of two numbers n and m by adding n together m times. 6) Search an array a for an element x and prove the index i is less than or equal to the lowest index of any occurrence of x.

    Исходное описание:

    Оригинальное название

    Exercise 5

    Авторское право

    © Attribution Non-Commercial (BY-NC)

    Доступные форматы

    PDF, TXT или читайте онлайн в Scribd

    Этот документ был вам полезен?

    Это неприемлемый материал?

    Пожаловаться на этот документ
    The document contains 6 exercises asking to prove the correctness of various programs: 1) Swap the values of variables x and y. 2) Set x to its absolute value. 3) Count down from n to 0 using a while loop. 4) Compute the sum of the first n positive integers. 5) Compute the product of two numbers n and m by adding n together m times. 6) Search an array a for an element x and prove the index i is less than or equal to the lowest index of any occurrence of x.

    Авторское право:

    Attribution Non-Commercial (BY-NC)
    Скачайте в формате PDF, TXT или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    5 просмотров1 страница

    Axiomatic Semantics Exercise 5

    Загружено:

    vhiep1988
    The document contains 6 exercises asking to prove the correctness of various programs: 1) Swap the values of variables x and y. 2) Set x to its absolute value. 3) Count down from n to 0 using a while loop. 4) Compute the sum of the first n positive integers. 5) Compute the product of two numbers n and m by adding n together m times. 6) Search an array a for an element x and prove the index i is less than or equal to the lowest index of any occurrence of x.

    Авторское право:

    Attribution Non-Commercial (BY-NC)
    Скачайте в формате PDF, TXT или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    из 1

    Exercise 5 Axiomatic Semantics

    1. Show that the following program is correct {x = X and y = Y} t := x; x := y; y := t; {x = Y and y := X} 2. Prove that the following program is correct: {true} if x > 0 then x := x else x := 0 x {x 0} 3. Show the correctness of the following program: {n > 0} while n > 0 do n := n 1 {n = 0} 4. Prove that the following program is totally correct: {n > 0} i := n; sum := 0; while i > 0 do begin sum := sum + i; i := i 1 end {sum = 1 + 2 + ... + n} 5. Write a program that computes the product of two numbers n and m by repeatedly adding n m-times. Prove that your program is correct. 6. Prove the partial correctness of the following program: {true} i := 1; while a[i] x do i := i + 1 {a[i] = x (j: j 1 a[j] = x i j)}

    Вам также может понравиться