標題: Titlebook: Algebraic Methodology and Software Technology; 13th International C Michael Johnson,Dusko Pavlovic Conference proceedings 2011 The Editor(s [打印本頁] 作者: 變更 時間: 2025-3-21 18:33
書目名稱Algebraic Methodology and Software Technology影響因子(影響力)
書目名稱Algebraic Methodology and Software Technology影響因子(影響力)學科排名
書目名稱Algebraic Methodology and Software Technology網絡公開度
書目名稱Algebraic Methodology and Software Technology網絡公開度學科排名
書目名稱Algebraic Methodology and Software Technology被引頻次
書目名稱Algebraic Methodology and Software Technology被引頻次學科排名
書目名稱Algebraic Methodology and Software Technology年度引用
書目名稱Algebraic Methodology and Software Technology年度引用學科排名
書目名稱Algebraic Methodology and Software Technology讀者反饋
書目名稱Algebraic Methodology and Software Technology讀者反饋學科排名
作者: 非秘密 時間: 2025-3-21 22:43
Verification of Common Interprocedural Compiler Optimizations Using Visibly Pushdown Kleene Algebra programming languages (sequences, alternatives, loops and code blocks) in a natural way. In this paper, this system is used to verify the following interprocedural compiler optimizations: interprocedural dead code elimination, inlining of functions, tail-recursion elimination, procedure reordering 作者: 水獺 時間: 2025-3-22 00:40 作者: 現(xiàn)暈光 時間: 2025-3-22 08:27
Model Refinement Using Bisimulation Quotientsuced into a smallish, finite bisimulation quotient. Second, the reduced system is refined in order to ensure a given property, using any known finite-state method. Third, the refined reduced system is expanded back into an adequate refinement of the system given initially. The proposed method is bas作者: 寬容 時間: 2025-3-22 09:52 作者: 采納 時間: 2025-3-22 13:32
Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programminggic programming supports recursive computations, and some logic programs resemble the inductive or coinductive definitions written in functional programming languages. In this paper, we give a coalgebraic semantics to logic programming. We show that ground logic programs can be modelled by either ..作者: Perigee 時間: 2025-3-22 21:03 作者: opprobrious 時間: 2025-3-22 22:10
Matching Logic: An Alternative to Hoare/Floyd Logics. Matching logic specifications are particular first-order formulae with constrained algebraic structure, called .. Program configurations satisfy patterns iff they . their algebraic structure and satisfy their constraints. Using a simple imperative language (IMP), it is shown that a restricted use作者: 剛毅 時間: 2025-3-23 04:45
Program Calculation in Coqy. It requires human insights and creativity, and needs systems to help human to focus on clever parts of the derivation by automating tedious ones and verifying correctness of transformations. Different from many existing systems, we show in this paper that Coq, a popular theorem prover, provides a作者: 我正派 時間: 2025-3-23 08:29 作者: arrogant 時間: 2025-3-23 10:33 作者: 工作 時間: 2025-3-23 13:59
BAL Tool in Flexible Manufacturing Systemsesources as well. BAL begins by first making the syntactic analysis of the system specification, and then draws up its relevant transition graph by applying the rules of the operational semantics and solves a performance optimization problem relevant to optimize of the maximum throughout. Usage of B作者: 宿醉 時間: 2025-3-23 21:22 作者: 極大的痛苦 時間: 2025-3-24 00:21
An Assume Guarantee Approach for Checking Quantified Array Assertionsion expresses a property over an array segment such as .. Given a program .. annotated with assertion .., our method rewrites .. to either . or . where . is a code fragment. The validity of the assertion is then proven by induction: assuming that .. holds for .. and proving that .. holds for ... The作者: LITHE 時間: 2025-3-24 05:04
Type Fusions conditions for fusing an application of a functor with an initial algebra to form another initial algebra. We provide a novel proof of type fusion based on adjoint folds and discuss several applications: type firstification, type specialisation and tabulation.作者: 震驚 時間: 2025-3-24 08:22
A Complete Declarative Debugger for Maudebut . result is obtained) due to both wrong and missing statements and wrong search conditions. The debugger builds a tree representing the computation and guides the user through it to find the bug. We present the debugger’s latest commands and features, illustrating its use with several examples.作者: tendinitis 時間: 2025-3-24 13:56
Conference proceedings 2011d in?Lac-Beauport, QC, Canada, in June 2010..The 14 revised full papers presented were carefully reviewed and selected from 33 submissions. The papers are organized in 1 invited paper, 10 contributed research papers, and 4 system demonstrations..作者: NEX 時間: 2025-3-24 14:56 作者: 附錄 時間: 2025-3-24 22:15 作者: SEED 時間: 2025-3-25 00:03 作者: Hallowed 時間: 2025-3-25 03:37 作者: 課程 時間: 2025-3-25 09:35 作者: Anthology 時間: 2025-3-25 12:58
On the Expressiveness of the ,-Calculus and the Mobile AmbientsWe investigate the expressivity of two classical distributed paradigms by defining an encoding of the pure mobile ambient calculus into the synchronous .-calculus. We show that the encoding is complete and ‘weakly’ sound, since it may introduce loops. For this purpose we introduce the notions of . and of ..作者: intoxicate 時間: 2025-3-25 16:22
Algebraic Methodology and Software Technology978-3-642-17796-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 發(fā)電機 時間: 2025-3-25 20:51
https://doi.org/10.1007/978-3-031-36793-9s conditions for fusing an application of a functor with an initial algebra to form another initial algebra. We provide a novel proof of type fusion based on adjoint folds and discuss several applications: type firstification, type specialisation and tabulation.作者: 起來了 時間: 2025-3-26 01:39 作者: addict 時間: 2025-3-26 05:36 作者: 種族被根除 時間: 2025-3-26 11:33 作者: Isolate 時間: 2025-3-26 13:00
Deterministic Policy Gradient and the DDPG,quirements. However, Maude lacks the formal tools to perform some of these analyses and thus they can only be done by hand. The Heterogeneous Tool Set . is an institution-based combination of different logics and corresponding rewriting, model checking and proof tools. We present in this paper an in作者: frugal 時間: 2025-3-26 17:30 作者: fledged 時間: 2025-3-26 23:15
https://doi.org/10.1007/978-3-031-36793-9s conditions for fusing an application of a functor with an initial algebra to form another initial algebra. We provide a novel proof of type fusion based on adjoint folds and discuss several applications: type firstification, type specialisation and tabulation.作者: 清楚說話 時間: 2025-3-27 04:26
https://doi.org/10.1007/978-3-031-36793-9gic programming supports recursive computations, and some logic programs resemble the inductive or coinductive definitions written in functional programming languages. In this paper, we give a coalgebraic semantics to logic programming. We show that ground logic programs can be modelled by either ..作者: Peculate 時間: 2025-3-27 09:07
https://doi.org/10.1007/978-3-030-10546-4mated agents in a changing world. Unlike most treatments of dynamic epistemic logic, we have transitions that “change the state” of the underlying system and not just the state of knowledge of the agents. The key novel feature that emerges is the need to have a way of “inverting transitions” and dis作者: 不妥協(xié) 時間: 2025-3-27 10:19
https://doi.org/10.1007/978-1-4842-6503-1s. Matching logic specifications are particular first-order formulae with constrained algebraic structure, called .. Program configurations satisfy patterns iff they . their algebraic structure and satisfy their constraints. Using a simple imperative language (IMP), it is shown that a restricted use作者: 符合你規(guī)定 時間: 2025-3-27 16:28 作者: 評論性 時間: 2025-3-27 17:54 作者: 野蠻 時間: 2025-3-27 23:57
Deep Reinforcement Learning with Pythonermination of innermost rewriting, termination of order-sorted rewriting, termination of context-sensitive rewriting, termination of innermost context-sensitive rewriting and termination of rewriting modulo specific axioms. Such termination properties are essential to prove termination of programs i作者: Lamina 時間: 2025-3-28 03:25
Integrated Planning and Learning,esources as well. BAL begins by first making the syntactic analysis of the system specification, and then draws up its relevant transition graph by applying the rules of the operational semantics and solves a performance optimization problem relevant to optimize of the maximum throughout. Usage of B作者: 笨拙的我 時間: 2025-3-28 08:49
Background: Deep Reinforcement Learning,but . result is obtained) due to both wrong and missing statements and wrong search conditions. The debugger builds a tree representing the computation and guides the user through it to find the bug. We present the debugger’s latest commands and features, illustrating its use with several examples.作者: 大吃大喝 時間: 2025-3-28 13:23
Background: Deep Reinforcement Learning,ion expresses a property over an array segment such as .. Given a program .. annotated with assertion .., our method rewrites .. to either . or . where . is a code fragment. The validity of the assertion is then proven by induction: assuming that .. holds for .. and proving that .. holds for ... The作者: Muscularis 時間: 2025-3-28 14:55
Cooperation of Algebraic Constraint Domains in Higher-Order Functional and Logic Programming novel higher-order constraint domain equipped with a sound and complete constraint solver for solving higher-order equations. We argue the applicability of our approach describing a prototype implementation on top of the constraint functional logic system ..作者: 不適 時間: 2025-3-28 19:30
Yinyan Zhang,Shuai Li,Xuefeng Zhou novel higher-order constraint domain equipped with a sound and complete constraint solver for solving higher-order equations. We argue the applicability of our approach describing a prototype implementation on top of the constraint functional logic system ..作者: Ccu106 時間: 2025-3-29 02:38
Jingqing Zhang,Hang Yuan,Hao Donge instead consider qualitative analysis, looking at how recent developments to tackle state space explosion in quantified analysis can be also harnessed to establish properties such as freedom from deadlock in an efficient manner.作者: 怕失去錢 時間: 2025-3-29 06:38
Deterministic Policy Gradient and the DDPG,tegration of Maude into . that allows to use the logics and tools already integrated in . with Maude specifications. To achieve such integration we have defined an institution for Maude based on preordered algebras and a comorphism between Maude and ., the central logic in ..作者: 磨坊 時間: 2025-3-29 07:59 作者: Petechiae 時間: 2025-3-29 14:11
Deep Reinforcement Learning with Pythonn sophisticated rewriting-based programming languages. Specific methods have been developed and implemented in . in order to efficiently deal with most of them. In this paper, we report on these new features of the tool.作者: 我還要背著他 時間: 2025-3-29 16:30 作者: 有幫助 時間: 2025-3-29 21:33 作者: Campaign 時間: 2025-3-30 02:52
https://doi.org/10.1007/978-1-4842-6503-1 using the other. Extensions to IMP including a heap with dynamic memory allocation and pointer arithmetic are given, requiring no extension of the underlying first-order logic; moreover, heap patterns such as lists, trees, queues, graphs, etc., are given algebraically using fist-order constraints over patterns.作者: 小說 時間: 2025-3-30 07:39 作者: 尾隨 時間: 2025-3-30 10:40
Background: Deep Reinforcement Learning,d real life examples taken from system code show performance improvement compared to our previous approach for checking quantified assertions. Moreover, this new technique enables us to verify challenging programs which are not handled by our previous method and many exiting tools as well.作者: minaret 時間: 2025-3-30 15:43 作者: Conspiracy 時間: 2025-3-30 19:14
Matching Logic: An Alternative to Hoare/Floyd Logic using the other. Extensions to IMP including a heap with dynamic memory allocation and pointer arithmetic are given, requiring no extension of the underlying first-order logic; moreover, heap patterns such as lists, trees, queues, graphs, etc., are given algebraically using fist-order constraints over patterns.作者: 平項山 時間: 2025-3-30 23:18 作者: 時代錯誤 時間: 2025-3-31 02:22
An Assume Guarantee Approach for Checking Quantified Array Assertionsd real life examples taken from system code show performance improvement compared to our previous approach for checking quantified assertions. Moreover, this new technique enables us to verify challenging programs which are not handled by our previous method and many exiting tools as well.作者: Osteons 時間: 2025-3-31 06:28 作者: 楓樹 時間: 2025-3-31 09:44 作者: 有權威 時間: 2025-3-31 15:52
Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming..-coalgebras or ...-coalgebras on .. We analyse different kinds of derivation strategies and derivation trees (proof-trees, SLD-trees, and-or parallel trees) used in logic programming, and show how they can be modelled coalgebraically.作者: 窒息 時間: 2025-3-31 19:02
Proving Termination Properties with ,n sophisticated rewriting-based programming languages. Specific methods have been developed and implemented in . in order to efficiently deal with most of them. In this paper, we report on these new features of the tool.作者: enchant 時間: 2025-3-31 22:24
0302-9743 2010, held in?Lac-Beauport, QC, Canada, in June 2010..The 14 revised full papers presented were carefully reviewed and selected from 33 submissions. The papers are organized in 1 invited paper, 10 contributed research papers, and 4 system demonstrations..978-3-642-17795-8978-3-642-17796-5Series ISS作者: indecipherable 時間: 2025-4-1 04:48
Hierarchical Reinforcement Learning,nterprocedural compiler optimizations: interprocedural dead code elimination, inlining of functions, tail-recursion elimination, procedure reordering and function cloning. The proofs are equational and machine-verifiable.作者: negotiable 時間: 2025-4-1 07:15
