作者: 商品 時間: 2025-3-21 22:31 作者: 娘娘腔 時間: 2025-3-22 02:06
Toward knowledge-based specifications of languages, question of using object-oriented paradigm for the specification of a language treated as a collection of classes of concepts. On the other hand, this is the question of employing syntax-directed methods for software construction in knowledge-based systems.作者: Angiogenesis 時間: 2025-3-22 07:49 作者: BRAVE 時間: 2025-3-22 12:19
Inductive inference of recursive functions: Complexity bounds, inference is a process to find an algorithm from sample computations. In the case when the given class of functions is recursively enumerable it is easy to define a natural complexity measure for the inductive inference, namely, the worst-case mindchange number for the first n functions in the give作者: 獨輪車 時間: 2025-3-22 16:16
Inductive synthesis of dot expressions,which is based on a formalization of the intuitive notion of ellipsis (‘...’). Whilst formally the dot expressions are simply a language describing sets of words, on the other hand, it can be considered as a programming language supporting quite a wide class of programs. Equivalence and asymptotical作者: 弄皺 時間: 2025-3-22 17:06 作者: Foreknowledge 時間: 2025-3-23 00:11
Automatic construction of test sets: Theoretical approach,necessary to execute all feasible branches of program at least once on the tests of CTS. A simple programming language is introduced with the property that the values used in conditional statements are not arithmetically deformed. For this language the CTS problem is proved to be algorithmically sol作者: 壓碎 時間: 2025-3-23 04:13
Aggregate approach for specification, validation, simulation and implementation of computer networked in the paper. With this approach the above mentioned design stages can be executed using a single mathematical scheme. The method of reachability states is used for the validation of protocol general properties, while individual characteristics are analysed by the invariant method which enables t作者: bromide 時間: 2025-3-23 08:31
A compositional proof system for distributed programs,ain class of distributed programs with a synchronous mode of communication regarded as standard. A compositional proof system dealing with partial correctness of distributed programs is presented. The correctness of formalization is justified by proving the system to be sound and relatively complete作者: anthesis 時間: 2025-3-23 10:18
Investigation of finitary calculus for a discrete linear time logic by means of infinitary calculustaining some infinitary rules reflecting semantics of the temporal logic. Some semantic (e.g., completeness) and proof theoretical (e.g., cut elimination) properties for this infinitary calculus are proved. The main part of the method consists of reducing an arbitrary derivation in the infinitary re作者: 密切關系 時間: 2025-3-23 17:24 作者: coddle 時間: 2025-3-23 20:22
0302-9743 cs of Estonia, Latvia and Lithuania. It includes results previously published only in Russian as well as completely new results. The following main topics are addressed: deductive synthesis of programs, automatic test case generation, and specification and generation of distributed systems. These ar作者: 詼諧 時間: 2025-3-24 00:31
https://doi.org/10.1007/978-3-642-52750-0 program synthesis. PRIZ is not bound to any particular problem domain, but applicable for synthesis of programs solving problems of a wide class called computational problems. From the theoretical side it has the deductive power of the intuitionistic propositional calculus.作者: heirloom 時間: 2025-3-24 03:30
The programming system PRIZ, program synthesis. PRIZ is not bound to any particular problem domain, but applicable for synthesis of programs solving problems of a wide class called computational problems. From the theoretical side it has the deductive power of the intuitionistic propositional calculus.作者: Absenteeism 時間: 2025-3-24 07:17 作者: 星星 時間: 2025-3-24 10:41 作者: 媒介 時間: 2025-3-24 18:37
0302-9743 e all fields where Baltic scientists have made substantial contributions. The volume contains both theoretical results and general descriptions and logical outlines of some practical systems.978-3-540-54131-8978-3-540-47427-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 甜食 時間: 2025-3-24 21:17 作者: cogent 時間: 2025-3-25 01:24 作者: nutrition 時間: 2025-3-25 06:47 作者: Phonophobia 時間: 2025-3-25 10:11 作者: cyanosis 時間: 2025-3-25 14:49 作者: 導師 時間: 2025-3-25 16:31
Using resolution for deciding solvable classes and building finite models,wn methods of B.Dreben and W.D.Goldfarb, although it doesn‘t improve the known upper bounds on the size of the models..The work described here has been guided by G.Mints. We would also like to thank N.Zamov for helpful discussions.作者: 暴露他抗議 時間: 2025-3-25 22:35
Aggregate approach for specification, validation, simulation and implementation of computer network based on the specification language ESTELLE/AG is presented. Formal description and results of alternating -bit protocol validation and simulation as its speciffication in AGREGAT 84 and Estelle/Ag are presented for illustration.作者: 燒烤 時間: 2025-3-26 01:35
Conference proceedings 1991nia, Latvia and Lithuania. It includes results previously published only in Russian as well as completely new results. The following main topics are addressed: deductive synthesis of programs, automatic test case generation, and specification and generation of distributed systems. These are all fiel作者: Amendment 時間: 2025-3-26 05:45 作者: 包庇 時間: 2025-3-26 08:58 作者: conceal 時間: 2025-3-26 16:06
Some models of inductive syntactical synthesis from sample computations, different approaches), then loops can be synthesized in more traditional WHILE-form, where loop conditions are separated from actions. The model in Section 3 is developed to handle the synthesis from incomplete sample computations (initial fragments). This model can be useful for the synthesis of some divide-and-conquer algorithms.作者: 皺痕 時間: 2025-3-26 16:58 作者: Keratin 時間: 2025-3-26 22:18 作者: right-atrium 時間: 2025-3-27 03:10
https://doi.org/10.1007/BFb0019352Compiler; Distributed Systems; Programmsynthese; Spezifikation; Synthesis of Programs; Test Case Generati作者: indicate 時間: 2025-3-27 08:26 作者: 兒童 時間: 2025-3-27 09:53 作者: osteocytes 時間: 2025-3-27 14:49
,Rigal — a programming language for compiler writing, advanced pattern matching. All phases of compilation, including parsing, optimization and code generation, can be programmed in this language in short and readable form. Sample compiler written in RIGAL is presented.作者: Panacea 時間: 2025-3-27 19:30
,Anlagen zur Herstellung und Füllung,Fast algorithm for inductive synthesis of term rewriting systems is described and proved to be correct. It is implemented and successfully applied for inductive synthesis of different algorithms, including the binary multiplication. The algorithm proposed supports automatic learning process and can be used for designing and implementation of ADT.作者: 蒸發(fā) 時間: 2025-3-28 01:03 作者: Talkative 時間: 2025-3-28 05:27 作者: Synovial-Fluid 時間: 2025-3-28 09:55
Automatic construction of test sets: Practical approach,The problem of symbolic execution and test generation is considered both for sequential and concurrent programs. Practical methods for test construction for the given program path are presented.作者: Cabinet 時間: 2025-3-28 12:48 作者: HAUNT 時間: 2025-3-28 15:56 作者: 講個故事逗他 時間: 2025-3-28 21:21 作者: Priapism 時間: 2025-3-29 02:52 作者: 我不明白 時間: 2025-3-29 03:56 作者: Ceramic 時間: 2025-3-29 10:09
https://doi.org/10.1007/978-3-7091-6519-5which is based on a formalization of the intuitive notion of ellipsis (‘...’). Whilst formally the dot expressions are simply a language describing sets of words, on the other hand, it can be considered as a programming language supporting quite a wide class of programs. Equivalence and asymptotical作者: adhesive 時間: 2025-3-29 11:51 作者: 輕彈 時間: 2025-3-29 15:36 作者: medium 時間: 2025-3-29 20:58 作者: 小隔間 時間: 2025-3-30 02:12
Analyse der Reinheit und Zusammensetzung,ain class of distributed programs with a synchronous mode of communication regarded as standard. A compositional proof system dealing with partial correctness of distributed programs is presented. The correctness of formalization is justified by proving the system to be sound and relatively complete作者: anchor 時間: 2025-3-30 04:33
https://doi.org/10.1007/3-540-27654-8taining some infinitary rules reflecting semantics of the temporal logic. Some semantic (e.g., completeness) and proof theoretical (e.g., cut elimination) properties for this infinitary calculus are proved. The main part of the method consists of reducing an arbitrary derivation in the infinitary re作者: Habituate 時間: 2025-3-30 11:05
Analyse der Reinheit und Zusammensetzung, advanced pattern matching. All phases of compilation, including parsing, optimization and code generation, can be programmed in this language in short and readable form. Sample compiler written in RIGAL is presented.作者: CRAMP 時間: 2025-3-30 14:21 作者: 侵害 時間: 2025-3-30 20:28 作者: indenture 時間: 2025-3-30 22:42 作者: 新鮮 時間: 2025-3-31 03:07 作者: 愛好 時間: 2025-3-31 08:26
Inductive inference of recursive functions: Complexity bounds,to const·n. Additionally, effects previously found in the Kolmogorov complexity theory are discovered in the complexity of inductive inference as well..The time complexity of prediction strategies (the value f(m+1) is predicted from f(0),..., f(m)) is investigated. It turns out that, if a prediction作者: 侵害 時間: 2025-3-31 12:23
Inductive synthesis of dot expressions,o the given) expression by one sufficiently long example. Some instances of the application of the model for program inductive synthesis are also given. Particularly, there are given examples of the euclidean and bubblesort algorithm synthesis within acceptable time from completely natural sample de作者: dandruff 時間: 2025-3-31 17:25
Ausgeführte Regler und Regeleinrichtungenntains several results showing that the inference of indices in computable numberings can differ very much. For instance, there are computable numberings which are difficult for the inference, and only finite classes of total recursive functions can be identified. This shows that computable numberin作者: 傳染 時間: 2025-3-31 17:48
Ausgeführte Regler und Regeleinrichtungento const·n. Additionally, effects previously found in the Kolmogorov complexity theory are discovered in the complexity of inductive inference as well..The time complexity of prediction strategies (the value f(m+1) is predicted from f(0),..., f(m)) is investigated. It turns out that, if a prediction作者: 貿易 時間: 2025-4-1 01:16
https://doi.org/10.1007/978-3-7091-6519-5o the given) expression by one sufficiently long example. Some instances of the application of the model for program inductive synthesis are also given. Particularly, there are given examples of the euclidean and bubblesort algorithm synthesis within acceptable time from completely natural sample de作者: 自傳 時間: 2025-4-1 01:54
Type-theoretical semantics of some declarative languages,作者: 散布 時間: 2025-4-1 06:32 作者: Tinea-Capitis 時間: 2025-4-1 12:49
