作者: forthy 時間: 2025-3-21 21:48
Sochinwechi Nwosisi,Dilip Nandwaniave an initial expression, we need to know what transformations can be performed — i.e. what rules can be used — and we need to know exactly what we are trying to achieve — what is the goal of the transformation.作者: 抓住他投降 時間: 2025-3-22 01:09
Transformations I,ave an initial expression, we need to know what transformations can be performed — i.e. what rules can be used — and we need to know exactly what we are trying to achieve — what is the goal of the transformation.作者: SEEK 時間: 2025-3-22 08:02
Textbook 19981st edition/4th year undergraduate and postgraduate students on formal methods and software engineering courses, and software developers in industry who need a more pragmatic, yet fully formal, approach to software development.作者: 通情達理 時間: 2025-3-22 09:43 作者: Picks-Disease 時間: 2025-3-22 14:56 作者: Picks-Disease 時間: 2025-3-22 19:30 作者: 貪心 時間: 2025-3-22 22:07
Sustainable Development and Biodiversity shall be able to handle non-deterministic specifications and introduce general decomposition methods (which must then be particularised to make the resultant design deterministic — i.e. we must choose from a set of alternatives and this then involves an irreversible step in which some superfluous information is, intentionally, discarded).作者: conformity 時間: 2025-3-23 01:36
The Specification of Functions I, concerned with the second of these three phases. In particular, within the ., we will not be interested in any changes of value. Most of our reasoning will involve values which are constant but unknown.作者: 厚臉皮 時間: 2025-3-23 08:52 作者: osteocytes 時間: 2025-3-23 13:37 作者: concert 時間: 2025-3-23 15:16
Siddhartha Mishra,Christoph Schwabstructions detailed in this chapter requires you to view problems more abstractly but they facilitate application of powerful refinement rules which give shorter, more immediate, derivation sequences. The price which must be paid for using . rules is that the designs produced are constrained; they have a certain structure.作者: 中子 時間: 2025-3-23 22:00 作者: Sad570 時間: 2025-3-24 00:57 作者: 香料 時間: 2025-3-24 04:11
Springer-Verlag London 1998作者: 不感興趣 時間: 2025-3-24 08:45
Yao-Yi Chiang,Weiwei Duan,Craig A. Knoblockr programming language, nor is it a collection of standard algorithms for solving common problems. It is about the creation of software designs which are . to meet their requirements, that are . — and correctness cannot be qualified, software is either correct or it isn’t.作者: 相同 時間: 2025-3-24 13:17
Urban Landscaping in the Arid Zone in the guise of input or output instructions). Performing a calculation is synonymous with evaluating a function. Mathematically, a function is something which generates a . result from each acceptable data value. Regarded as a complete program, it should be possible in principle to read all the re作者: 倫理學(xué) 時間: 2025-3-24 16:29
Sochinwechi Nwosisi,Dilip Nandwaniy of computable functions tells us that there really is nothing else which . be computed — all computations and data values can be encoded into single integers. But not all data . like a single integer and we want to be able perform calculations which act on (uncoded) data in the form that we common作者: JEER 時間: 2025-3-24 19:16
Sochinwechi Nwosisi,Dilip Nandwanibe directly translated into an executable program. If the specification is . and . — so that each data item of the specified type there is exactly one corresponding result value that corresponds to each input — this task is achieved by transforming, by manipulating, the post-condition. This is the f作者: RAGE 時間: 2025-3-25 01:19 作者: MUTED 時間: 2025-3-25 03:34
Siddhartha Mishra,Christoph Schwabre more complicated than others but it is often the case that specifiers of software think in terms of units which are too small. Many specifications can be expressed using . data items, but in a way which does not unduly constrain their subsequent refinement down to an implementation. Using the con作者: epidermis 時間: 2025-3-25 10:10 作者: 深淵 時間: 2025-3-25 11:38
Gonzalo Rivas-Torres,Damian C. Adams The coverage is by no means complete, in particular there is little attention paid to the creation of clever internal data structures. Our major concern is the detailed application, and a certain amount of customisation., of the general transfinement tactics described earlier.作者: Pamphlet 時間: 2025-3-25 18:29
María de Lourdes Torres,Carlos F. Menantions to two further examples which illustrate different aspects of algorithm design. These are two important, if unfamiliar, problems which can both be represented pictorially. We could follow them through right down to the level of complete PDL implementations; however, we shall stop at an earlie作者: 碎片 時間: 2025-3-25 23:35
https://doi.org/10.1007/978-3-319-67017-1We do not advocate that Chapter 2A should necessarily be read sequentially and in its entirety. Probably the best approach is to study Sections 2.3.1/2 (Booleans) and 2.3.4 (Integers). Other parts of Section 2.3 can be consulted and studied when necessary. Section 2.4 includes an example of how transformations can be used to manipulate programs.作者: Mri485 時間: 2025-3-26 03:32
Gonzalo Rivas-Torres,María Gloria RivasSo far we have only considered specifications and designs of programs which carry out computations; i.e. situations where, given suitable data, we compute an appropriate result and deposit it in a named location (which was hitherto unused).作者: Anticonvulsants 時間: 2025-3-26 05:38
Transformations II,We do not advocate that Chapter 2A should necessarily be read sequentially and in its entirety. Probably the best approach is to study Sections 2.3.1/2 (Booleans) and 2.3.4 (Integers). Other parts of Section 2.3 can be consulted and studied when necessary. Section 2.4 includes an example of how transformations can be used to manipulate programs.作者: 生氣的邊緣 時間: 2025-3-26 09:58
The Broader Picture,So far we have only considered specifications and designs of programs which carry out computations; i.e. situations where, given suitable data, we compute an appropriate result and deposit it in a named location (which was hitherto unused).作者: 中世紀 時間: 2025-3-26 16:12 作者: 長矛 時間: 2025-3-26 17:36 作者: SLUMP 時間: 2025-3-27 00:41 作者: 凌辱 時間: 2025-3-27 03:21 作者: 易達到 時間: 2025-3-27 07:58
Formal Approaches to Computing and Information Technology (FACIT)http://image.papertrans.cn/c/image/235973.jpg作者: intelligible 時間: 2025-3-27 11:11 作者: 首創(chuàng)精神 時間: 2025-3-27 16:06 作者: 外星人 時間: 2025-3-27 20:42
Sorting, The coverage is by no means complete, in particular there is little attention paid to the creation of clever internal data structures. Our major concern is the detailed application, and a certain amount of customisation., of the general transfinement tactics described earlier.作者: Mediocre 時間: 2025-3-28 00:19 作者: outset 時間: 2025-3-28 04:57 作者: 健壯 時間: 2025-3-28 07:57
Carolina Sampedro,Carlos F. Menast should be split we can simply say that . should be split into, say .. and .. so that ..→.. ?? .. For non-trivial lists there are many ways that this can be done — and therefore we have non-determinism, which must eventually be resolved. Subsequent processing of .. and .. will generally loose deta作者: 來這真柔軟 時間: 2025-3-28 11:07
Introduction,r programming language, nor is it a collection of standard algorithms for solving common problems. It is about the creation of software designs which are . to meet their requirements, that are . — and correctness cannot be qualified, software is either correct or it isn’t.作者: placebo-effect 時間: 2025-3-28 14:46 作者: 禁令 時間: 2025-3-28 20:15
The Specification of Functions II,y of computable functions tells us that there really is nothing else which . be computed — all computations and data values can be encoded into single integers. But not all data . like a single integer and we want to be able perform calculations which act on (uncoded) data in the form that we common作者: inscribe 時間: 2025-3-28 23:20 作者: 袋鼠 時間: 2025-3-29 03:08
Algorithm Extraction,ntation; for the implementation of a program which, given suitable data, can be executed to calculate the function. In most cases we shall have to use a mix of different design strategies for transformation and refinement. So far we have only met (reversible) transformations — refinement comes later作者: 紀念 時間: 2025-3-29 10:50
Specifications Revisited (Quantifications etc.),re more complicated than others but it is often the case that specifiers of software think in terms of units which are too small. Many specifications can be expressed using . data items, but in a way which does not unduly constrain their subsequent refinement down to an implementation. Using the con作者: 凝視 時間: 2025-3-29 15:16
Refinement,ut some particular strategies (such as those given in Chapter 3) we run the risk of going round in circles and wasting much effort getting precisely nowhere. Even when our initial specification is deterministic (and hence specifies a single function rather than a . of functions, any one of which wou作者: flutter 時間: 2025-3-29 19:13
Sorting, The coverage is by no means complete, in particular there is little attention paid to the creation of clever internal data structures. Our major concern is the detailed application, and a certain amount of customisation., of the general transfinement tactics described earlier.作者: Parameter 時間: 2025-3-29 22:06
Two Further Examples,ntions to two further examples which illustrate different aspects of algorithm design. These are two important, if unfamiliar, problems which can both be represented pictorially. We could follow them through right down to the level of complete PDL implementations; however, we shall stop at an earlie
