Meklēšana Attēli Maps YouTube Ziņas Gmail Disks Kalendārs Vēl »
Ieiet
Grāmatas Grāmatas
" How can one check a large routine in the sense of making sure that it's right? In order that the man who checks may not have too difficult a task, the programmer should make a number of definite assertions which can be checked individually, and from which... "
Generating Hardware Assertion Checkers: For Hardware Verification, Emulation ... - 13. lappuse
autors: Marc Boulé, Zeljko Zilic - 2008 - 280 lapas
Ierobežota priekšskatīšana - Par šo grāmatu

Compositionality, Concurrency, and Partial Correctness: Proof Theories for ...

Job Zwiers - 1989 - 276 lapas
...Alan Turing in 1949. His paper "Checking a large routine" [Turing] opens with the following sentences: "How can one check a routine in the sense of making...correctness of the whole programme easily follows." Turing's idea is to reduce a global statement, about the whole program, in one step to a number of...
Ierobežota priekšskatīšana - Par šo grāmatu

Lectures on Petri Nets II: Applications: Advances in Petri Nets

Wolfgang Reisig, Grzegorz Rozenberg - 1998 - 487 lapas
...check a routine in the sense of making sure that it is right ?“ and went on to answer that “... the programmer should make a number of definite assertions...correctness of the whole programme easily follows.” In modern terminology, Turing proposes the “inductive assertion method” to prove program correctness,...
Ierobežota priekšskatīšana - Par šo grāmatu

Assertion-Based Design

Harry D. Foster, Adam C. Krolnik, David J. Lacey - 2004 - 390 lapas
...problem into set of assertions: How can one check a large routine in the sense of making sure that it's right? In order that the man who checks may not have...individually, and from which the correctness of the whole program easily flows. Over 30 years ago, Floyd [1967] and Hoare [1969] proposed the concept of using...
Ierobežota priekšskatīšana - Par šo grāmatu

Using PSL/Sugar for Formal and Dynamic Verification: Guide to Property ...

Ben Cohen, Srinivasan Venkataramanan, Ajeetha Kumari - 2004 - 396 lapas
...following in June 24, 1949: How can one check a large routine in the sense of making sure that it's right? In order that the man who checks may not have...individually, and from which the correctness of the whole program easily flows. This statement is what is thought to be the first application of AssertionBased...
Ierobežota priekšskatīšana - Par šo grāmatu




  1. Mana bibliotēka
  2. Palīdzība
  3. Izvērstā grāmatu meklēšana