標(biāo)題: Titlebook: Rewriting Logic and Its Applications; 8th International Wo Peter Csaba ?lveczky Conference proceedings 2010 Springer Berlin Heidelberg 2010 [打印本頁] 作者: breath-focus 時(shí)間: 2025-3-21 16:18
書目名稱Rewriting Logic and Its Applications影響因子(影響力)
書目名稱Rewriting Logic and Its Applications影響因子(影響力)學(xué)科排名
書目名稱Rewriting Logic and Its Applications網(wǎng)絡(luò)公開度
書目名稱Rewriting Logic and Its Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Rewriting Logic and Its Applications被引頻次
書目名稱Rewriting Logic and Its Applications被引頻次學(xué)科排名
書目名稱Rewriting Logic and Its Applications年度引用
書目名稱Rewriting Logic and Its Applications年度引用學(xué)科排名
書目名稱Rewriting Logic and Its Applications讀者反饋
書目名稱Rewriting Logic and Its Applications讀者反饋學(xué)科排名
作者: pester 時(shí)間: 2025-3-21 20:13 作者: conservative 時(shí)間: 2025-3-22 02:47 作者: 兩棲動物 時(shí)間: 2025-3-22 05:02 作者: charisma 時(shí)間: 2025-3-22 11:50
The Third Rewrite Engines CompetitionThis paper presents the main results and conclusions of the Third Rewrite Engines Competition (REC III). This edition of the competition took place as part of the 8th Workshop on Rewriting Logic and its Applications (WRLA 2010), and the systems ASF+SDF, Maude, Stratego/XT, Tom, and TXL participated in it.作者: mastopexy 時(shí)間: 2025-3-22 15:56 作者: 征兵 時(shí)間: 2025-3-22 20:34
https://doi.org/10.1007/978-3-642-16310-4Debugging; LA; Rewriting logic; concurrency; concurrent systems; distributed systems; first-order logics; h作者: Infect 時(shí)間: 2025-3-23 01:05 作者: Missile 時(shí)間: 2025-3-23 03:29
Natarajan Shankarons . and . to be eigenfunctions for the unperturbed Hamiltonian, which are basis functions for irreducible representations of the group of Schr?dinger’s equation. Here . transforms according to an irreducible representation of the group of Schr?dinger’s equation. This product involves the direct pr作者: 舊石器 時(shí)間: 2025-3-23 08:42
José Meseguerrepresentations. The results are applied to chemical reaction theory, and to the theory of the Jahn–Teller effect. Selection rules are illustrated for linear and circular dichroism. Finally, the polyhedral Euler theorem is introduced and applied to valence-bond theory for clusters.作者: conception 時(shí)間: 2025-3-23 13:37
Raúl Gutiérrez,Salvador Lucasrepresentations. The results are applied to chemical reaction theory, and to the theory of the Jahn–Teller effect. Selection rules are illustrated for linear and circular dichroism. Finally, the polyhedral Euler theorem is introduced and applied to valence-bond theory for clusters.作者: connoisseur 時(shí)間: 2025-3-23 17:02
Beatriz Alarcón,Salvador Lucas,José Meseguerrepresentations. The results are applied to chemical reaction theory, and to the theory of the Jahn–Teller effect. Selection rules are illustrated for linear and circular dichroism. Finally, the polyhedral Euler theorem is introduced and applied to valence-bond theory for clusters.作者: Bumptious 時(shí)間: 2025-3-23 20:19
Santiago Escobar,Ralf Sasse,José Meseguerrepresentations. The results are applied to chemical reaction theory, and to the theory of?the Jahn–Teller effect. Selection rules?are illustrated for linear and circular dichroism. Finally, the polyhedral Euler theorem?is introduced and applied to valence-bond theory for clusters.作者: ear-canal 時(shí)間: 2025-3-24 01:15
Francisco Durán,José Meseguerrepresentations. The results are applied to chemical reaction theory, and to the theory of?the Jahn–Teller effect. Selection rules?are illustrated for linear and circular dichroism. Finally, the polyhedral Euler theorem?is introduced and applied to valence-bond theory for clusters.作者: Trigger-Point 時(shí)間: 2025-3-24 06:10 作者: arrhythmic 時(shí)間: 2025-3-24 07:30 作者: 偽證 時(shí)間: 2025-3-24 14:41
José E. Rivera,Francisco Durán,Antonio Vallecilloquations which govern this state. These integral equations are characterized by kernels of interaction and normalization operators which depend on the choice of the internal states, on the choice of the orbital partition and on the nucleon-nucleon interaction. The kernels of these operators are expr作者: Heretical 時(shí)間: 2025-3-24 18:42
Fernando Rosa-Velardoons in the Hilbert space of quantum mechanics. The second reason for dealing with these transformations is the fact that certain operators encountered in quantum mechanics may be interpreted as representatives of underlying geometric transformations in classical phase space. This applies in particul作者: STIT 時(shí)間: 2025-3-24 19:50
Proving Termination in the Context-Sensitive Dependency Pair Frameworkcontext-sensitive computations gets lost. This leads to a less intuitive and accurate description of the termination behavior of the system. In this paper, we show how to get the best of the two approaches, thus obtaining a powerful . which satisfies all practical and theoretical expectations.作者: HUMP 時(shí)間: 2025-3-25 02:23
Folding Variant Narrowing and Optimal Variant Terminatione just as important as computing .?∪?.-unifiers in recent applications of folding variant narrowing such as termination methods modulo axioms, and checking confluence and coherence of rules modulo axioms.作者: Insul島 時(shí)間: 2025-3-25 03:56
A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specificationsging case of associativity without commutativity for which no finitary unification algorithms exist. In this paper we present the foundations and illustrate the design and use of a completely new version of the Maude Church-Rosser Checker tool that addresses all the above-mentioned challenges and ca作者: myalgia 時(shí)間: 2025-3-25 09:29
Enhancing the Debugging of Maude Specificationsnd a proper abbreviation of the trees obtained with it. These trees increase both the causes (missing equations and memberships) and the errors (erroneous normal forms and least sorts) detected in our debugging framework.作者: 樹木中 時(shí)間: 2025-3-25 13:16
Francisco Durán,Manuel Roldán,Jean-Christophe Bach,Emilie Balland,Mark van den Brand,James R. Cordy,作者: ANTH 時(shí)間: 2025-3-25 17:21
K-Maude: A Rewriting Based Tool for Semantics of Programming Languagesexecution or analysis, or into . for documentation purposes. The current K-Maude prototype was successfully used in defining several languages and language analysis tools, both for research and for teaching purposes. This paper describes the K-Maude tool, both from a user and from an implementer perspective.作者: forestry 時(shí)間: 2025-3-25 20:55 作者: 秘方藥 時(shí)間: 2025-3-26 04:08
Rewriting, Inference, and Proofe discuss a range of issues at the intersection of rewriting and inference. How can other inference procedures be combined with rewriting? Can rewriting be used to describe inference procedures? What are some of the theoretical challenges and practical applications of combining rewriting and inferen作者: 抗體 時(shí)間: 2025-3-26 05:37
Twenty Years of Rewriting Logiche world have made important contributions to its foundations, tools, and applications. Since 1996, the WRLA workshop has met biennially, with the 2010 Paphos meeting being its eighth edition, and many hundreds of papers have been published on the subject (for a bibliography up to 2002 see [1]).作者: nauseate 時(shí)間: 2025-3-26 11:27
Proving Termination in the Context-Sensitive Dependency Pair Frameworklike ., ., ., etc. The dependency pair approach, one of the most powerful techniques for proving termination of rewriting, has been adapted to be used for proving termination of .. The corresponding notion of . (CSDP) is different from the standard one in that . (i.e., rules whose right-hand side is作者: hemoglobin 時(shí)間: 2025-3-26 13:02 作者: 含糊 時(shí)間: 2025-3-26 17:22
Folding Variant Narrowing and Optimal Variant Terminationcation algorithm. However, except for the hopelessly inefficient case of full narrowing, nothing seems to be known about effective narrowing strategies in the general modulo case beyond the quite depressing observation that basic narrowing is . modulo .. In this work we propose an effective strategy作者: hereditary 時(shí)間: 2025-3-27 00:40
A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specificationsr having a complete agreement between the specification’s initial algebra, mathematical semantics, and its operational semantics by rewriting. Checking this property for expressive specifications that are order-sorted, conditional with possibly extra variables in their condition, and whose equations作者: Antarctic 時(shí)間: 2025-3-27 03:25
A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theoriesbe (ground) coherent with . modulo .. The correctness of many important formal verification tasks, including search, LTL model checking, and the development of abstractions, crucially depends on the theory being ground coherent. Furthermore, many specifications of interest are typed, have equations 作者: notice 時(shí)間: 2025-3-27 06:53
K-Maude: A Rewriting Based Tool for Semantics of Programming Languagesccepting K modules along with regular Maude modules and a collection of tools for transforming K language definitions into Maude rewrite theories for execution or analysis, or into . for documentation purposes. The current K-Maude prototype was successfully used in defining several languages and lan作者: Infusion 時(shí)間: 2025-3-27 09:55
Collecting Semantics under Predicate Abstraction in the K Frameworkicate abstraction technique into the K framework. To express this technique in K, we go to the foundations of predicate abstraction, that is abstract interpretation, and use its collecting semantics. As such, we propose a suitable description in K for collecting semantics under predicate abstraction作者: avulsion 時(shí)間: 2025-3-27 14:01
Concurrent Rewriting Semantics and Analysis of Asynchronous Digital Circuitsge of . (PRs). One of the present limitations of the state of the art in asynchronous circuit design is that no formal executable semantics of asynchronous circuits has yet been given at the PR level. The primary contribution of this paper is to define, using rewriting logic and Maude, an executable作者: 注視 時(shí)間: 2025-3-27 20:45
A Formal Pattern Architecture for Safe Medical Systemser, such patterns should also provide formal guarantees that critical safety properties are met. We leverage the power of rewriting logic and parameterization available in Real-Time Maude to add a formal basis for analysis of a novel safety pattern for medical devices. We demonstrate practicality an作者: badinage 時(shí)間: 2025-3-27 22:08 作者: BILIO 時(shí)間: 2025-3-28 06:00 作者: confide 時(shí)間: 2025-3-28 08:05
The Linear Temporal Logic of Rewriting Maude Model Checkerstem. The Linear Temporal Logic of Rewriting (LTLR) extends linear temporal logic with spatial action patterns which represent rewriting events. LTLR generalizes and extends various state-based and event-based logics and aims to avoid certain types of mismatches between a system and its temporal log作者: 甜食 時(shí)間: 2025-3-28 10:29
Enhancing the Debugging of Maude Specificationsutation and guiding the user through it to find the error. Two different kinds of errors are considered for debugging: .—a wrong result obtained from an initial value—and .—a term that should be reachable but cannot be obtained from an initial value—, where the latter has only been considered in non作者: 人類 時(shí)間: 2025-3-28 15:13
Rewriting, Inference, and Proofce? How can rewriters, decision procedures, and their combination be certified? We discuss these problems in the context of our ongoing effort to use PVS as a metatheoretic framework to construct a proof kernel for justifying the claims of theorem provers, rewriters, model checkers, and satisfiability solvers.作者: 善于 時(shí)間: 2025-3-28 19:53 作者: 領(lǐng)先 時(shí)間: 2025-3-29 00:13 作者: Anguish 時(shí)間: 2025-3-29 06:43 作者: ILEUM 時(shí)間: 2025-3-29 09:18
Concurrent Rewriting Semantics and Analysis of Asynchronous Digital Circuitsuce the state space of circuits in our formal semantics and investigate the impact of these reductions experimentally. The analysis scales up to circuits of over 100 PRs in spite of the high levels of concurrency involved.作者: MAOIS 時(shí)間: 2025-3-29 11:56 作者: 兇兆 時(shí)間: 2025-3-29 18:39
The Linear Temporal Logic of Rewriting Maude Model Checkeroperties involving both events and state predicates. This greater expressiveness is gained without compromising performance, because the LTLR implementation minimizes the extra costs involved in handling the events of systems.作者: insurrection 時(shí)間: 2025-3-29 20:09
On the Behavioral Semantics of Real-Time Domain Specific Visual Languagesally generated from the visual specifications. The use of Real-Time Maude provides additional interesting benefits, such as being able to simulate the DSVL specifications or to conduct formal analysis on them.作者: –吃 時(shí)間: 2025-3-30 03:38 作者: fulmination 時(shí)間: 2025-3-30 07:19 作者: 預(yù)示 時(shí)間: 2025-3-30 12:10
José Meseguerors are like communicating vessels, reality is neither the operation nor the representation, but the interaction. The evaluation of the corresponding matrix elements requires the coupling of representations, and can be factorized into an intrinsic scalar quantity that contains the physics of the int作者: 法官 時(shí)間: 2025-3-30 14:01 作者: indicate 時(shí)間: 2025-3-30 18:45
Beatriz Alarcón,Salvador Lucas,José Meseguerors are like communicating vessels, reality is neither the operation nor the representation, but the interaction. The evaluation of the corresponding matrix elements requires the coupling of representations, and can be factorized into an intrinsic scalar quantity that contains the physics of the int作者: 預(yù)示 時(shí)間: 2025-3-30 21:16 作者: 漂泊 時(shí)間: 2025-3-31 01:18
Francisco Durán,José Meseguertors are like communicating vessels, reality is neither the operation nor the representation, but the interaction. The evaluation of the corresponding matrix elements?requires the coupling of representations and can be factorized into an intrinsic scalar quantity that contains the physics of the int作者: 追蹤 時(shí)間: 2025-3-31 06:55 作者: synovium 時(shí)間: 2025-3-31 10:57 作者: 修飾語 時(shí)間: 2025-3-31 17:19
