標題: Titlebook: Mathematics of Program Construction; 375th Anniversary of J. L. A. Snepscheut Conference proceedings 1989 Springer-Verlag Berlin Heidelberg [打印本頁] 作者: 水平 時間: 2025-3-21 16:34
書目名稱Mathematics of Program Construction影響因子(影響力)
書目名稱Mathematics of Program Construction影響因子(影響力)學(xué)科排名
書目名稱Mathematics of Program Construction網(wǎng)絡(luò)公開度
書目名稱Mathematics of Program Construction網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Mathematics of Program Construction被引頻次
書目名稱Mathematics of Program Construction被引頻次學(xué)科排名
書目名稱Mathematics of Program Construction年度引用
書目名稱Mathematics of Program Construction年度引用學(xué)科排名
書目名稱Mathematics of Program Construction讀者反饋
書目名稱Mathematics of Program Construction讀者反饋學(xué)科排名
作者: 一再煩擾 時間: 2025-3-21 22:59
Jayadev Misralutions with small amplitudes are unstable..When the Floquet exponents at criticality are complex and rationally independent of the fixed frequency, the solution of the spectral problem is quasi-periodic. The formal construction then gives the natural frequency of the bifurcating solution as a power作者: 向下 時間: 2025-3-22 00:56 作者: aesthetician 時間: 2025-3-22 07:46 作者: evasive 時間: 2025-3-22 12:37
A. Bijlsmalutions with small amplitudes are unstable..When the Floquet exponents at criticality are complex and rationally independent of the fixed frequency, the solution of the spectral problem is quasi-periodic. The formal construction then gives the natural frequency of the bifurcating solution as a power作者: 步兵 時間: 2025-3-22 14:53 作者: 混合 時間: 2025-3-22 19:49
Wei Chen,Jan Tijmen Uddinglutions with small amplitudes are unstable..When the Floquet exponents at criticality are complex and rationally independent of the fixed frequency, the solution of the spectral problem is quasi-periodic. The formal construction then gives the natural frequency of the bifurcating solution as a power作者: Serenity 時間: 2025-3-22 23:46 作者: 暫時休息 時間: 2025-3-23 03:48 作者: 先兆 時間: 2025-3-23 06:53
Martin C. Hensonlutions with small amplitudes are unstable..When the Floquet exponents at criticality are complex and rationally independent of the fixed frequency, the solution of the spectral problem is quasi-periodic. The formal construction then gives the natural frequency of the bifurcating solution as a power作者: CURT 時間: 2025-3-23 13:29
Wim H. Hesselinklutions with small amplitudes are unstable..When the Floquet exponents at criticality are complex and rationally independent of the fixed frequency, the solution of the spectral problem is quasi-periodic. The formal construction then gives the natural frequency of the bifurcating solution as a power作者: considerable 時間: 2025-3-23 17:07 作者: 剛開始 時間: 2025-3-23 21:28
Anne Kaldewaij,Berry Schoenmakerslutions with small amplitudes are unstable..When the Floquet exponents at criticality are complex and rationally independent of the fixed frequency, the solution of the spectral problem is quasi-periodic. The formal construction then gives the natural frequency of the bifurcating solution as a power作者: Highbrow 時間: 2025-3-23 23:22 作者: cacophony 時間: 2025-3-24 03:59
L. D. J. C. Loyens,R. H. Bisselinglutions with small amplitudes are unstable..When the Floquet exponents at criticality are complex and rationally independent of the fixed frequency, the solution of the spectral problem is quasi-periodic. The formal construction then gives the natural frequency of the bifurcating solution as a power作者: 四指套 時間: 2025-3-24 08:19
0302-9743 ditional boundaries between the two disciplines have become blurred. The varieties of mathematics of program construction are wide-ranging. They include calculi978-3-540-51305-6978-3-540-46191-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 一致性 時間: 2025-3-24 11:33
Initialisation with a final value, an exercise in program transformation,作者: Detain 時間: 2025-3-24 16:27 作者: 土坯 時間: 2025-3-24 21:39
Termination is timing,Termination is treated as a special case of timing, with the result that the logic of programming is simplified and generalized.作者: 指令 時間: 2025-3-25 00:39
Towards a calculus of data refinement,In this paper we lay a foundation for a calculus of data refinement. We introduce the concept of conditional data refinement which enables us to incorporate contextual information in a refinement step. We give a number of its properties and show in several examples how data refinement can be used in practice.作者: Nucleate 時間: 2025-3-25 06:55
Stepwise refinement and concurrency: A small exercise,A simple methodology for the design of concurrent programs is illustrated by a short example. This methodology formalizes the classical concept of “stepwise refinement”.作者: 的是兄弟 時間: 2025-3-25 11:23 作者: 蛙鳴聲 時間: 2025-3-25 12:02
The formal construction of a parallel triangular system solver,A parallel program for the solution of a triangular system of equations is formally derived. The program assumes the grid distribution of the .×. triangular matrix across .=.. processes. The complexity is ../.+. (.), both for a complete and for a square mesh communication network.作者: collagenase 時間: 2025-3-25 19:41
https://doi.org/10.1007/3-540-51305-1Computer; Hardware; Programmspezifikation und Transformation; Programmverifikation; Schrittweise Verfein作者: 狗舍 時間: 2025-3-25 22:53
A formal approach to large SOFTWARE CONSTRUCTION,ich are quite different from those of the programming theory; in fact, we have not spoken of recursivity or algorithmics; on the other hand, we spoke of proofs..The design of a software system might be nothing else but the proof of its construction.作者: 形狀 時間: 2025-3-26 04:03
Specifications of concurrently accessed data,an be manipulated easily. This allowed us to derive several properties of the buffer (Appendix A) and construct a proof of buffer concatenation (Section 4). Also refinement of the specification with the eventual goal of implementation seems feasible with this scheme.作者: 細頸瓶 時間: 2025-3-26 07:27
Stepwise refinement of action systems,rried out in the context of purely sequential programs. The resulting parallel algorithms can be efficiently executed on different architectures. The methodology is illustrated by showing the main derivation steps in a construction of a parallel algorithm for matrix multiplication.作者: 圖畫文字 時間: 2025-3-26 08:54
A derivation of a systolic rank order filter with constant response time,rder filtering. The derivation proceeds in a calculational manner, originating from a formal specification and guided by performance considerations. The resulting solution is a linear systolic array of . cells, where . is the window size. It has constant response time and latency ..作者: 墻壁 時間: 2025-3-26 14:00 作者: 反復(fù)拉緊 時間: 2025-3-26 17:46
Mathematics of Program Construction978-3-540-46191-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: bypass 時間: 2025-3-27 00:22
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/626968.jpg作者: Scleroderma 時間: 2025-3-27 01:38
0302-9743 The conference was organized by the Department of Computing Science, Groningen University, The Netherlands, at the occasion of the University‘s 375th anniversary. The creative inspiration of the modern computer has led to the development of new mathematics, the mathematics of program construction. I作者: excursion 時間: 2025-3-27 08:31
Conference proceedings 1989ence was organized by the Department of Computing Science, Groningen University, The Netherlands, at the occasion of the University‘s 375th anniversary. The creative inspiration of the modern computer has led to the development of new mathematics, the mathematics of program construction. Initially c作者: Obvious 時間: 2025-3-27 10:11
Networks of communicating processes and their (De-)composition,ract space turns out to be the space of delay-insensitive specifications. As operator we study composition of networks. The composition operator on the resulting space is shown to have a surprisingly simple factorization property, the prove of which turns out to be very simple due to the approach taken.作者: 慢跑 時間: 2025-3-27 14:34 作者: mechanical 時間: 2025-3-27 20:27 作者: lethal 時間: 2025-3-27 23:17
Towards totally verified systems,o show how a simple application could be verified. An application is implemented in a simple language and verified to be correct. This program is then compiled for a simple instruction set by a verified compiler. This instruction set is then implemented on a simple verified processor.作者: 乳白光 時間: 2025-3-28 04:00
A lattice-theoretical basis for a specification language,e sense that all monotonic predicate transformers can be constructed in it. The base language provides a unifying framework for various specification languages; we show how two Dijkstra-style specification languages can be embedded in the base language.作者: 沒收 時間: 2025-3-28 08:12
Searching by elimination,eneral scheme is refined — depending on the mathematical properties of the objects involved — to a particular program. This is illustrated by some examples, varying from elementary problems to more advanced problems.作者: tangle 時間: 2025-3-28 10:50
Realizability models for program construction,recursion equations. Our aim is to ensure that, when constructive reasoning is harnessed for the derivation of programs from proofs of specifications, the programs we obtain are expressed in a natural way.作者: 使?jié)M足 時間: 2025-3-28 15:44 作者: originality 時間: 2025-3-28 19:15
Lambert Meertensutions into quasi-periodic solutions with more frequencies. The simplest case is the bifurcation of periodic solutions from steady solutions. The next hardest problem is the bifurcation of quasi-periodic solutions from basic time periodic solutions of fixed frequency. This problem is treated in the 作者: scrutiny 時間: 2025-3-29 01:22
Jayadev Misrautions into quasi-periodic solutions with more frequencies. The simplest case is the bifurcation of periodic solutions from steady solutions. The next hardest problem is the bifurcation of quasi-periodic solutions from basic time periodic solutions of fixed frequency. This problem is treated in the 作者: INTER 時間: 2025-3-29 06:12 作者: 尖 時間: 2025-3-29 07:20
R. J. R. Back,J. von Wrightutions into quasi-periodic solutions with more frequencies. The simplest case is the bifurcation of periodic solutions from steady solutions. The next hardest problem is the bifurcation of quasi-periodic solutions from basic time periodic solutions of fixed frequency. This problem is treated in the 作者: Lament 時間: 2025-3-29 11:32
A. Bijlsmautions into quasi-periodic solutions with more frequencies. The simplest case is the bifurcation of periodic solutions from steady solutions. The next hardest problem is the bifurcation of quasi-periodic solutions from basic time periodic solutions of fixed frequency. This problem is treated in the 作者: BILIO 時間: 2025-3-29 15:32 作者: 土坯 時間: 2025-3-29 20:06
Wei Chen,Jan Tijmen Uddingutions into quasi-periodic solutions with more frequencies. The simplest case is the bifurcation of periodic solutions from steady solutions. The next hardest problem is the bifurcation of quasi-periodic solutions from basic time periodic solutions of fixed frequency. This problem is treated in the 作者: 影響深遠 時間: 2025-3-30 01:55
E. Pascal Gribomontutions into quasi-periodic solutions with more frequencies. The simplest case is the bifurcation of periodic solutions from steady solutions. The next hardest problem is the bifurcation of quasi-periodic solutions from basic time periodic solutions of fixed frequency. This problem is treated in the 作者: Mortal 時間: 2025-3-30 06:15 作者: intention 時間: 2025-3-30 08:53 作者: 美色花錢 時間: 2025-3-30 16:27 作者: 圍巾 時間: 2025-3-30 18:10
Anne Kaldewaij,Martin Remutions into quasi-periodic solutions with more frequencies. The simplest case is the bifurcation of periodic solutions from steady solutions. The next hardest problem is the bifurcation of quasi-periodic solutions from basic time periodic solutions of fixed frequency. This problem is treated in the 作者: filicide 時間: 2025-3-30 23:46
Anne Kaldewaij,Berry Schoenmakersutions into quasi-periodic solutions with more frequencies. The simplest case is the bifurcation of periodic solutions from steady solutions. The next hardest problem is the bifurcation of quasi-periodic solutions from basic time periodic solutions of fixed frequency. This problem is treated in the 作者: 使苦惱 時間: 2025-3-31 02:49 作者: Gingivitis 時間: 2025-3-31 06:26 作者: 恫嚇 時間: 2025-3-31 11:38
A formal approach to large SOFTWARE CONSTRUCTION,ich are quite different from those of the programming theory; in fact, we have not spoken of recursivity or algorithmics; on the other hand, we spoke of proofs..The design of a software system might be nothing else but the proof of its construction.作者: deriver 時間: 2025-3-31 15:30
Mathematics of program construction applied to analog neural networks,tics has demonstrated its critical importance in the design of deterministic as well as nondeterministic programs, and in the design of both synchronous and self-timed circuits. This short note is to explore the use of this mathematics in the design of continuous systems such as analog neural networ作者: Distribution 時間: 2025-3-31 19:00 作者: Anthology 時間: 2025-4-1 01:27
Constructing a calculus of programs,compounded by notations that require many marks on paper for expressing one elementary concept, and ‘a(chǎn)dministrative overhead’, consisting of algorithmically uninteresting but technically necessary steps, like shuffling parts of an expression around without change in computational meaning, and the in作者: 固定某物 時間: 2025-4-1 02:15
Specifications of concurrently accessed data,an be manipulated easily. This allowed us to derive several properties of the buffer (Appendix A) and construct a proof of buffer concatenation (Section 4). Also refinement of the specification with the eventual goal of implementation seems feasible with this scheme.作者: 寬度 時間: 2025-4-1 07:51 作者: 有組織 時間: 2025-4-1 12:27
A lattice-theoretical basis for a specification language,nguage permits unbounded nondeterminism, demonic and angelic nondeterminism and is extended to permit miracles also. It is shown to be complete, in the sense that all monotonic predicate transformers can be constructed in it. The base language provides a unifying framework for various specification 作者: 光亮 時間: 2025-4-1 18:17 作者: Embolic-Stroke 時間: 2025-4-1 21:56
Deriving mixed evaluation from standard evaluation for a simple functional language,cation for mixed evaluation. Using techniques inspired by natural semantics we specify a standard evaluator by a set of inference rules. The evaluation of programs is then performed by a restricted kind of theorem proving in this logic. We then describe a systematic method for extending the proof sy
