Titlebook: Baltic Computer Science; Selected Papers Janis Bārzdin?,Dines Bj?rner Conference proceedings 1991 Springer-Verlag Berlin Heidelberg 1991 Co

arouse

書(shū)目名稱Baltic Computer Science影響因子(影響力)




書(shū)目名稱Baltic Computer Science影響因子(影響力)學(xué)科排名




書(shū)目名稱Baltic Computer Science網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Baltic Computer Science網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Baltic Computer Science被引頻次




書(shū)目名稱Baltic Computer Science被引頻次學(xué)科排名




書(shū)目名稱Baltic Computer Science年度引用




書(shū)目名稱Baltic Computer Science年度引用學(xué)科排名




書(shū)目名稱Baltic Computer Science讀者反饋




書(shū)目名稱Baltic Computer Science讀者反饋學(xué)科排名

商品

娘娘腔

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

BRAVE

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

獨(dú)輪車(chē)

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

弄皺

Foreknowledge

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

壓碎

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

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