標(biāo)題: Titlebook: Unifying Theories of Programming; First International Steve Dunne,Bill Stoddart Conference proceedings 2006 Springer-Verlag Berlin Heidelb [打印本頁(yè)] 作者: ossicles 時(shí)間: 2025-3-21 19:15
書目名稱Unifying Theories of Programming影響因子(影響力)
書目名稱Unifying Theories of Programming影響因子(影響力)學(xué)科排名
書目名稱Unifying Theories of Programming網(wǎng)絡(luò)公開度
書目名稱Unifying Theories of Programming網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Unifying Theories of Programming被引頻次
書目名稱Unifying Theories of Programming被引頻次學(xué)科排名
書目名稱Unifying Theories of Programming年度引用
書目名稱Unifying Theories of Programming年度引用學(xué)科排名
書目名稱Unifying Theories of Programming讀者反饋
書目名稱Unifying Theories of Programming讀者反饋學(xué)科排名
作者: 新義 時(shí)間: 2025-3-21 23:27
Thiago Santos,Ana Cavalcanti,Augusto Sampaio: (i) He delivers a thorough introduction to fr- tional integration calculus and uses the binomial approximation of fractional Brownianmotion to give the reader a ?rst idea of this special market setting.978-3-642-00330-1978-3-642-00331-8Series ISSN 0075-8442 Series E-ISSN 2196-9957 作者: HERTZ 時(shí)間: 2025-3-22 00:44
Jifeng He,Tony Hoarenal agreement has an Australian court stayed its proceedings. There is also a marked difference in how judges perceive parties’ intentions in concluding an optional agreement in intra-national as compared with international cases. In the former, an optional agreement is said to be “a strong indicati作者: 易于出錯(cuò) 時(shí)間: 2025-3-22 07:07 作者: defeatist 時(shí)間: 2025-3-22 09:57
Moshe Deutsch,Martin C. Hensonticated proposals of many contemporary compatibilists. Instead, it turns precisely on insisting that options are analytically simple. Arguments for incompatibilism are shown to rest on auxiliary principles that should, in light of the book’s general account of options, be rejected..?.作者: 任命 時(shí)間: 2025-3-22 12:56 作者: HOWL 時(shí)間: 2025-3-22 17:51 作者: NAVEN 時(shí)間: 2025-3-22 23:23 作者: 喚起 時(shí)間: 2025-3-23 02:50
Walter Guttmann,Bernhard M?ller, the so-called paraxial or Gaussian optics, must then be further refined by taking account of aberrations and finally by exact raytracing before the design is constructed. The Gaussian theory is represented by the linear terms in a power series in several variables which represents the behaviour of作者: Meditate 時(shí)間: 2025-3-23 08:38
CSP Is a Retract of CCS,a function ., which maps the processes of its source theory onto those of its target theory. The image of . defines exactly the set of processes of the target theory. The ordering relation of the target theory is obtained by applying the link . to one or both operands before applying the source theo作者: avarice 時(shí)間: 2025-3-23 11:01
A Design-Based Model of Reversible Computation,pects of the . calculus in terms of Designs, as needed for our proofs..Support for the programming structures described has been incorporated in a reversible virtual machine for i386 platforms with Posix compatibility.作者: Moderate 時(shí)間: 2025-3-23 15:42
Eric Hehnerearning, neural architecture search, urban logistics planning, etc. Despite the success enjoyed by EAs, it is worth noting that most existing EA optimizers conduct the evolutionary search process from scratch, 978-3-030-70922-8978-3-030-70920-4Series ISSN 1867-4534 Series E-ISSN 1867-4542 作者: Mere僅僅 時(shí)間: 2025-3-23 21:39 作者: GUILE 時(shí)間: 2025-3-24 00:03
https://doi.org/10.1007/11768173CCS; CSP; Reversible Computing; Z methodology; object-orientation; programming; programming theory; reactiv作者: 過時(shí) 時(shí)間: 2025-3-24 04:03 作者: transdermal 時(shí)間: 2025-3-24 08:57 作者: 最有利 時(shí)間: 2025-3-24 14:06
0302-9743 Overview: 978-3-540-34750-7978-3-540-34752-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 符合國(guó)情 時(shí)間: 2025-3-24 17:38 作者: Encephalitis 時(shí)間: 2025-3-24 21:56
Constructing Property-Oriented Models for Verification,erties, and construct a heterogeneous untimed model in which time is abstracted away, so that we can verify timing properties in an untimed framework. The correctness of property-oriented model construction is ensured by the conformance of semantic and syntactic mappings.作者: apiary 時(shí)間: 2025-3-25 03:07 作者: 褻瀆 時(shí)間: 2025-3-25 04:16
Unifying Probability,ois connection with the more traditional probabilistic model are provided. Reversibility in the probabilistic guarded-command language is discussed. Finally the formalism is applied to unify quantum computation and cryptography within the probabilistic method.作者: V洗浴 時(shí)間: 2025-3-25 11:15
an be a source of electric energy and heat). So it determines the amount of financial costs (F) and loan installment (R) in its annual activity costs in successive years (t?=?1, 2, …N) together with energy carriers prices and specific charges for emitting pollutants to the environment it also determ作者: ALE 時(shí)間: 2025-3-25 13:00 作者: 打火石 時(shí)間: 2025-3-25 18:32 作者: LIMIT 時(shí)間: 2025-3-25 22:31
Jifeng He,Tony Hoarear distinction is drawn between exclusive choice of court agreements, on the one hand, and optional agreements, on the other. The principles applicable to exclusive agreements and the policies informing them are, however, better developed than those applicable to optional agreements. This chapter ar作者: Rct393 時(shí)間: 2025-3-26 01:35
Jifeng He,Shengchao Qin,Adnan Sherifs in a tactical light. I examined how one could use call options as substitutes for the purchase of an underlying asset (a US Treasury Bond); how to buy puts to protect against declines; how to sell call options to enhance yields by expecting volatility to decrease; and how to write cash-secured put作者: 執(zhí)拗 時(shí)間: 2025-3-26 05:07
Moshe Deutsch,Martin C. Henson an option should be taken as primitive, and that other agentive notions – such as ability, skill, and free will – should be understood in terms of options.?.The main contributions of this book are twofold. First, it resolves many of the outstanding questions in the metaphysics and semantics of agen作者: 嘮叨 時(shí)間: 2025-3-26 11:07 作者: blackout 時(shí)間: 2025-3-26 13:47 作者: 豪華 時(shí)間: 2025-3-26 19:13
Jifeng He,J. W. Sandersals Bestandteil der bankaufsichtsrechtlichen Regelungen zur Kontrolle der Eigenkapitalausstattung von Kreditinstituten vorgesehen sind, mu?ten vereinfachende Annahmen getroffen werden, um die Methoden praktikabel zu gestalten. Um die Auswirkungen dieser Annahmen korrekt überprüfen zu k?nnen, wurde i作者: 腐蝕 時(shí)間: 2025-3-27 00:05 作者: 安撫 時(shí)間: 2025-3-27 04:17 作者: Disk199 時(shí)間: 2025-3-27 07:18
Unifying Theories in ProofPower-Z,ns, is presented here. We aim at providing tool support for further explorations of Hoare & He’s unification, and for the mechanisation of languages based on this unification. More specifically, ., a specification language that combines Z, CSP, specification statements, and Dijkstra’s guarded command language is our final target.作者: 難管 時(shí)間: 2025-3-27 12:17
Hierarchical Organisation of Predicate-Semantic Models,g can be supported by laws of generic composition. The techniques also help simplify the proof of well-definedness of program combinators (i.e.?their closure in the semantic space) so that we no longer need to prove it (in predicate calculus) for every new model.作者: 迫擊炮 時(shí)間: 2025-3-27 16:22
Pointers and Records in the Unifying Theories of Programming,and non-terminating programs. Therefore, we link it with the theory of designs, providing a foundation for reasoning about total correctness of pointer-based sequential programs. Our work is a step towards the semantics of an object-oriented language that also integrates constructs for specifying state-rich and concurrent systems.作者: 是突襲 時(shí)間: 2025-3-27 19:06
Modal Design Algebra,ber of authors. Finally we show that the designs form a left semiring and even a Kleene and omega algebra. This is used to calculate closed expressions for the least and greatest fixed-point semantics of the demonic while loop that are simpler than the ones obtained from standard UTP theory and previous algebraic approaches.作者: notice 時(shí)間: 2025-3-27 22:14 作者: 花費(fèi) 時(shí)間: 2025-3-28 05:37
Mechanising a Unifying Theory,l semantics to an imperative programming language, and use our definitions to create a deep embedding of the language in .. We use ProofPowerZ, a theorem prover for . to provide mechanised support for reasoning about programs in the unifying theory.作者: 大量殺死 時(shí)間: 2025-3-28 07:56
Object-Orientation in the UTP,amming (UTP). This work shows how subtyping, data inheritance, (mutually) recursive methods, and dynamic binding can be described in the UTP by combining and extending the theories of designs and higher-order procedures. A distinguishing feature of our approach is modularity: following the style of 作者: detach 時(shí)間: 2025-3-28 12:10
CSP Is a Retract of CCS,cesses and to prove their correctness. For example, theories based on CCS are often pre-ordered by simulation (or more commonly bisimulation), of which the main varieties are strong or weak or barbed. Theories based on CSP choose as their pre-order a refinement relation, defined as inclusion over se作者: legislate 時(shí)間: 2025-3-28 17:26
A Design-Based Model of Reversible Computation,l link between reversibility and the minimum power requirements of a computation, and we review Zuliani’s work on Reversible Probabilistic Guarded Command Language. We propose an alternative formalisation of reversible computing which accommodates backtracking. To obtain a basic backtracking languag作者: 赤字 時(shí)間: 2025-3-28 21:04
An Operational Semantics in UTP for a Language of Reactive Designs (Abstract),ables. We give this language an operational semantics, with states and transitions represented symbolically. The semantics is described in Z, allowing us to execute the semantics using an animator, and to start work on a mechanical proof of correctness using the deep embedding in ProofPowerZ of the 作者: FECK 時(shí)間: 2025-3-29 01:00 作者: Tonometry 時(shí)間: 2025-3-29 04:02
A Relational Investigation of UTP Designs and Prescriptions,paradigms based on the idea of .: Hoare and He’s . and Dunne’s .. We present the technical analysis in a proof-theoretic relational framework based on two-predicate schema specifications. This enables us to demonstrate the relationships among (what . seem to be) different models of refinement associ作者: LINE 時(shí)間: 2025-3-29 08:08 作者: inventory 時(shí)間: 2025-3-29 12:18
Termination of Real-Time Programs: Definitely, Definitely Not, or Maybe,) may either (i) be guaranteed to terminate, (ii) be guaranteed to never terminate (loop forever), or (iii) may possibly terminate. In dealing with real-time programs and their specifications, we need to be able to represent these possibilities, and define suitable refinement orderings..A refinement作者: formula 時(shí)間: 2025-3-29 16:09 作者: Narcissist 時(shí)間: 2025-3-29 19:46
Unifying Probability,ois connection with the more traditional probabilistic model are provided. Reversibility in the probabilistic guarded-command language is discussed. Finally the formalism is applied to unify quantum computation and cryptography within the probabilistic method.作者: 載貨清單 時(shí)間: 2025-3-30 02:56
Pointers and Records in the Unifying Theories of Programming,nters is based on Paige’s entity groups, which give an abstract view of storage as equivalence classes of variables that share the same memory location. We first define our theory as a restriction of the general theory of relations, and, as a consequence, it does not distinguish between terminating 作者: 賄賂 時(shí)間: 2025-3-30 04:34 作者: 騷擾 時(shí)間: 2025-3-30 12:00
