作者: 擋泥板 時間: 2025-3-21 22:58 作者: disparage 時間: 2025-3-22 01:01
On Programmingations on programs and programming — and on ways in which programmers have tried to ‘guarantee’ that their programs were ‘right’. In Chapter 3, we shall set about the formal derivation of programs from specifications. In some sense, therefore, these chapters are competing. We make no pretence that t作者: 高興一回 時間: 2025-3-22 08:00 作者: adequate-intake 時間: 2025-3-22 11:44 作者: Phenothiazines 時間: 2025-3-22 16:30
Quantificationsare 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 that does not unduly constrain their subsequent refinement down to an implementation. Using the con作者: Phenothiazines 時間: 2025-3-22 17:43 作者: Hemoptysis 時間: 2025-3-22 21:43
Data Refinementaddressed hand-in-hand with the construction/derivation/generation of implementations. Another topic that comes into play when addressing more complex problems (apart from the characterization and measurement of complexity) is that of Data Structures. So far we have taken the stance that any data ty作者: 傷心 時間: 2025-3-23 02:59 作者: Pantry 時間: 2025-3-23 06:39 作者: anticipate 時間: 2025-3-23 11:14
Introductionrticular 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 cannnot be qualified — software is either correct or it isn’t作者: Limited 時間: 2025-3-23 16:21
Sorting sorting. We demonstrate how a selection of different algorithms can be derived from a single specification, but our coverage is by no means exhaustive. Our major concern is the detailed application, and a certain amount of customisation., of the general transfinement tactics.作者: BOLT 時間: 2025-3-23 21:07 作者: 有法律效應(yīng) 時間: 2025-3-24 01:00
Resilience History and Focus in the USAWe now present some variants of the high-level designs given in Chapter 7. We shall use the same broad sub-divisions used there, namely exchange sorts, merge sorts and partition sorts — but beware that the distinction is often confusing, and that in array based implementations most operations are achieved by means of exchanges作者: HEW 時間: 2025-3-24 04:24
Richard de Satgé,Vanessa WatsonThis book has focussed on the specification and design 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 that was hitherto unused).作者: 墻壁 時間: 2025-3-24 08:25 作者: 使隔離 時間: 2025-3-24 10:43 作者: 文字 時間: 2025-3-24 18:07 作者: languor 時間: 2025-3-24 21:59
978-1-85233-820-6Springer-Verlag London 2005作者: 消散 時間: 2025-3-25 00:57 作者: chiropractor 時間: 2025-3-25 04:42 作者: 等級的上升 時間: 2025-3-25 11:02
Zakaria Ye,Rachid Elazouzi,Tania Jiménezations on programs and programming — and on ways in which programmers have tried to ‘guarantee’ that their programs were ‘right’. In Chapter 3, we shall set about the formal derivation of programs from specifications. In some sense, therefore, these chapters are competing. We make no pretence that t作者: Nonporous 時間: 2025-3-25 11:41
Oussama Mjihil,Dijiang Huang,Abdelkrim Haqiqntation of a program that, 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), and so we shall have t作者: craven 時間: 2025-3-25 16:57 作者: nettle 時間: 2025-3-25 21:48
Urban Disaster Resilience and Securityare 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 that does not unduly constrain their subsequent refinement down to an implementation. Using the con作者: 行乞 時間: 2025-3-26 03:26
Urban Disaster Resilience and Security sorting. We demonstrate how a selection of different algorithms can be derived from a single specification, but our coverage is by no means exhaustive. Our major concern is the detailed application, and a certain amount of customisation., of the general transfinement tactics.作者: monologue 時間: 2025-3-26 05:13
Hanna Christine Schmitt,Stefan Greivingaddressed hand-in-hand with the construction/derivation/generation of implementations. Another topic that comes into play when addressing more complex problems (apart from the characterization and measurement of complexity) is that of Data Structures. So far we have taken the stance that any data ty作者: DEBT 時間: 2025-3-26 11:14 作者: Postmenopause 時間: 2025-3-26 15:19 作者: 冷峻 時間: 2025-3-26 18:42 作者: drusen 時間: 2025-3-26 23:59
http://image.papertrans.cn/c/image/235974.jpg作者: 同步信息 時間: 2025-3-27 04:21 作者: Charlatan 時間: 2025-3-27 08:09
Urban Disaster Resilience and Security sorting. We demonstrate how a selection of different algorithms can be derived from a single specification, but our coverage is by no means exhaustive. Our major concern is the detailed application, and a certain amount of customisation., of the general transfinement tactics.作者: babble 時間: 2025-3-27 13:10 作者: Incommensurate 時間: 2025-3-27 17:09 作者: Inflated 時間: 2025-3-27 19:04 作者: 業(yè)余愛好者 時間: 2025-3-27 22:27
https://doi.org/10.1007/978-3-319-68774-2stage in the synthesis. Here we are less concerned with details than the basic approach — the smaller subcalculations that are generated as we proceed can be tackled in the same way as earlier examples作者: Pde5-Inhibitors 時間: 2025-3-28 02:19 作者: Adornment 時間: 2025-3-28 10:02 作者: Subdue 時間: 2025-3-28 11:28
Textbook 2005Latest editionh can often be re-used). ..Constructing Correct Software. will provide invaluable reading for students and practitioners of Computer Science and Software Engineering to whom correctness of software is of prime importance. .作者: 鋸齒狀 時間: 2025-3-28 15:23 作者: 癡呆 時間: 2025-3-28 22:08
Zakaria Ye,Rachid Elazouzi,Tania Jiménezll set about the formal derivation of programs from specifications. In some sense, therefore, these chapters are competing. We make no pretence that the competition is fair. For the reader who skips through this chapter, some common elements are repeated in Chapter 3作者: abysmal 時間: 2025-3-29 01:45
Textbook 2005Latest edition of traditional program testing and, more recently, of program verification (in which the theorem must be proved). Proofs are difficult, though even with the use of powerful theorem provers. This volume explains and illustrates an alternative method, which allows the construction of (necessarily cor作者: 發(fā)誓放棄 時間: 2025-3-29 05:35 作者: Affection 時間: 2025-3-29 11:07 作者: CREST 時間: 2025-3-29 14:42
Oussama Mjihil,Dijiang Huang,Abdelkrim Haqiqnon-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)作者: Irksome 時間: 2025-3-29 15:42
Urban Disaster Resilience and Securitygive shorter, more immediate, derivation sequences. The price that must be paid for using . rules is that the designs produced are constrained; they have a certain structure and may be less efficient (at run time) than more tailored designs作者: 浪費時間 時間: 2025-3-29 21:02
Hanna Christine Schmitt,Stefan Greivingructure directly in the solution, we may have to provide a bespoke implementation of an ‘a(chǎn)bstract’ type within our implementation/program. In general terms, this chapter considers the replacement, the refinement of data structures作者: 相同 時間: 2025-3-30 01:42
Algorithm Extractionnon-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)作者: Incompetent 時間: 2025-3-30 04:44
