標題: Titlebook: Logic Based Program Synthesis and Transformation; 15th International S Patricia M. Hill Conference proceedings 2006 Springer-Verlag Berlin [打印本頁] 作者: 脾氣好 時間: 2025-3-21 18:29
書目名稱Logic Based Program Synthesis and Transformation影響因子(影響力)
書目名稱Logic Based Program Synthesis and Transformation影響因子(影響力)學科排名
書目名稱Logic Based Program Synthesis and Transformation網絡公開度
書目名稱Logic Based Program Synthesis and Transformation網絡公開度學科排名
書目名稱Logic Based Program Synthesis and Transformation被引頻次
書目名稱Logic Based Program Synthesis and Transformation被引頻次學科排名
書目名稱Logic Based Program Synthesis and Transformation年度引用
書目名稱Logic Based Program Synthesis and Transformation年度引用學科排名
書目名稱Logic Based Program Synthesis and Transformation讀者反饋
書目名稱Logic Based Program Synthesis and Transformation讀者反饋學科排名
作者: 費解 時間: 2025-3-21 21:38
Declarative Programming with Function Patternsansformation into standard functional logic programs. Since this transformation might introduce an infinite number of rules, we suggest an implementation that can be easily integrated with existing functional logic programming systems.作者: 全部逛商店 時間: 2025-3-22 04:04 作者: fallible 時間: 2025-3-22 06:25
Converting One Type-Based Abstract Domain to Anothert. We develop a method which has been applied in order to generate call and success patterns from the . assertions for built-ins, for any given regular type-based domain. In the paper we present the method as an instance of the more general problem of mapping elements of one abstract domain to another, with as little loss in precision as possible.作者: 鉤針織物 時間: 2025-3-22 09:43
An Algorithm for Local Variable Elimination in Normal Logic Programsence of local variables yields better performance of several tools and is a prerequisite for many technical results. In this paper, we introduce an algorithm that eliminates local variables from a wide proper subclass of normal logic programs. The proposed transformation preserves the Clark-Kunen semantics for normal logic programs.作者: 焦慮 時間: 2025-3-22 13:51
Transformational Verification of Parameterized Protocols Using Array Formulasby applying suitable unfold/fold transformations to the specification of that protocol. We demonstrate our method by proving that the parameterized Peterson’s protocol among?. processes, for any .?≥?2, ensures the mutual exclusion property.作者: arrogant 時間: 2025-3-22 21:05
Temporal Logic Constraints in the Biochemical Abstract Machine BIOCHAMenge is to break the complexity walls for reasoning about large biomolecular interaction systems. Pioneered by Regev, Silverman and Shapiro, the application of process calculi to the description of biological processes has been a source of inspiration for many researchers coming from the programming作者: 打包 時間: 2025-3-23 00:27 作者: 序曲 時間: 2025-3-23 03:43
Transformational Verification of Parameterized Protocols Using Array Formulasic programming and program transformation. We specify the properties of parameterized protocols by using an extension of stratified logic programs. This extension allows premises of clauses to contain first order formulas over arrays of parameterized length. A property of a given protocol is proved 作者: cushion 時間: 2025-3-23 07:28 作者: pester 時間: 2025-3-23 11:23 作者: 起來了 時間: 2025-3-23 17:10 作者: DNR215 時間: 2025-3-23 18:21
Extension of Type-Based Approach to Generation of Stream-Processing Programs by Automatic Insertion n writing programs that require buffering of input data, a user has to explicitly use . which copy data from input stream to memory or copy constructed trees from memory to an output stream. Such explicit insertion of buffering primitives is often cumbersome and worsens the readability of the progra作者: Anterior 時間: 2025-3-24 01:05
Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicatests, raise errors (or exceptions), and those whose truth value varies according to the degree of instantiation of arguments. In particular, non-leftmost unfolding steps can produce incorrect results since the independence of the computation rule no longer holds in the presence of impure predicates. E作者: 整潔漂亮 時間: 2025-3-24 03:39
A Transformational Semantics of Static Embedded Implications of Normal Logic Programsing a number of composition operators. The second approach consists in enriching logic programming with a mechanism of abstraction and scoping rules that are frequently found, for instance, in procedural programming. More precisely, this approach has been advocated by Miller and others using implica作者: 完整 時間: 2025-3-24 09:40 作者: Ambiguous 時間: 2025-3-24 11:45
Experiments in Context-Sensitive Analysis of Modular Programsrade-offs. The advantage of these context-sensitive analyses is that they provide information which is potentially more accurate than that provided by context-free analyses. Such information can then be applied to validating/debugging the program and/or to specializing the program in order to obtain作者: acrobat 時間: 2025-3-24 17:12 作者: 輕快來事 時間: 2025-3-24 20:35 作者: licence 時間: 2025-3-24 23:47
Logic Based Program Synthesis and Transformation978-3-540-32656-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Nonporous 時間: 2025-3-25 03:38
0302-9743 Overview: 978-3-540-32654-0978-3-540-32656-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Explicate 時間: 2025-3-25 10:55 作者: 別炫耀 時間: 2025-3-25 14:03 作者: 昏睡中 時間: 2025-3-25 17:33
Design and Implementation of ,: A Real-Time Action Description Languageant as the time at which the action occurs. In order to be able to model such real-time systems, the action description language A is extended with real-time clocks and constraints. The formal syntax and semantics of the extended language are defined, and the use of logic programming as a means to an implementation of real-time A is discussed.作者: anthropologist 時間: 2025-3-25 23:00
Removing Superfluous Versions in Polyvariant Specialization of Prolog Programsand a very limited class of builtins. Herein we propose an extension to traditional characteristic trees which can be used in the presence of calls to external predicates. This includes all builtins, libraries, other user modules, etc. Second, we propose the possibility of collapsing versions which 作者: 分開 時間: 2025-3-26 02:12 作者: mutineer 時間: 2025-3-26 06:08
A Transformational Semantics of Static Embedded Implications of Normal Logic Programsded with embedded implications with a static visibility rule. This class of programs combines the expressive power of normal programs with the capability to organize and to enhance dinamically their sets of clauses. In particular, first, we introduce an operational semantics based on constructive ne作者: 特征 時間: 2025-3-26 10:07
Experiments in Context-Sensitive Analysis of Modular Programsnd we provide an empirical comparison of the different models proposed in previous work, as well as experimental data on the different choices left open in those designs. On the other hand we explore the scalability of these models by using larger modular programs as benchmarks. The results have bee作者: audiologist 時間: 2025-3-26 13:23 作者: coddle 時間: 2025-3-26 19:34
Alberto Pettorossi,Maurizio Proietti,Valerio Senni作者: 使入迷 時間: 2025-3-26 23:34
Edelmira Pasarella,Fernando Orejas,Elvira Pino,Marisa Navarro作者: Consensus 時間: 2025-3-27 02:28 作者: 小臼 時間: 2025-3-27 06:08
7樓作者: Ornament 時間: 2025-3-27 12:36
7樓作者: PATHY 時間: 2025-3-27 15:24
8樓作者: 催眠 時間: 2025-3-27 20:57
8樓作者: languid 時間: 2025-3-27 23:35
8樓作者: Mindfulness 時間: 2025-3-28 03:24
8樓作者: Meager 時間: 2025-3-28 09:27
9樓作者: recession 時間: 2025-3-28 12:24
9樓作者: OTHER 時間: 2025-3-28 16:27
9樓作者: forager 時間: 2025-3-28 19:03
9樓作者: growth-factor 時間: 2025-3-29 02:31
10樓作者: 符合規(guī)定 時間: 2025-3-29 05:39
10樓作者: Carbon-Monoxide 時間: 2025-3-29 07:21
10樓作者: Landlocked 時間: 2025-3-29 15:00
10樓
