標(biāo)題: Titlebook: CAAP ‘88; 13th Colloquium on T M. Dauchet,M. Nivat Conference proceedings 1988 Springer-Verlag Berlin Heidelberg 1988 Algorithms.Analysis.A [打印本頁] 作者: 解放 時(shí)間: 2025-3-21 17:57
書目名稱CAAP ‘88影響因子(影響力)
書目名稱CAAP ‘88影響因子(影響力)學(xué)科排名
書目名稱CAAP ‘88網(wǎng)絡(luò)公開度
書目名稱CAAP ‘88網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱CAAP ‘88被引頻次
書目名稱CAAP ‘88被引頻次學(xué)科排名
書目名稱CAAP ‘88年度引用
書目名稱CAAP ‘88年度引用學(xué)科排名
書目名稱CAAP ‘88讀者反饋
書目名稱CAAP ‘88讀者反饋學(xué)科排名
作者: 嘲笑 時(shí)間: 2025-3-21 23:50 作者: Homocystinuria 時(shí)間: 2025-3-22 01:16
Porphyroblasts and Reaction Rims,a refinement of our techniques for obtaining a denotational semantics for OCCAM [HGR]. We prove that the model is fully abstract with respect to some natural notion of observable behaviour. The model presented will serve as a basis for a further study of specification and proof systems within the ESPRIT-project DESCARTES.作者: Chronic 時(shí)間: 2025-3-22 05:03 作者: Mucosa 時(shí)間: 2025-3-22 11:32 作者: 裝入膠囊 時(shí)間: 2025-3-22 13:39
Modelling statecharts behaviour in a fully abstract way,a refinement of our techniques for obtaining a denotational semantics for OCCAM [HGR]. We prove that the model is fully abstract with respect to some natural notion of observable behaviour. The model presented will serve as a basis for a further study of specification and proof systems within the ESPRIT-project DESCARTES.作者: 裝入膠囊 時(shí)間: 2025-3-22 18:38 作者: 鬧劇 時(shí)間: 2025-3-23 00:20
Lumped Modeling of Dissipative Processesound complete set of E-unifiers are given; as well as an algorithm transforming specifications satisfying Huet and Hullot‘s principle of definition, into specifications fulfilling the proposed criteria.作者: Encephalitis 時(shí)間: 2025-3-23 04:10
Lumped Modeling of Dissipative Processese functional languages, where the order in which subterms are evaluate (the .) is fixed for all programs, in Dactl the evaluation strategy is programmed explicitly. We define a translation of a functional language into Dactl, describe the problems encountered and their solution, and outline a proof that the translation is correct.作者: Etching 時(shí)間: 2025-3-23 06:29 作者: comely 時(shí)間: 2025-3-23 11:43 作者: badinage 時(shí)間: 2025-3-23 14:34 作者: Foregery 時(shí)間: 2025-3-23 21:22
https://doi.org/10.1007/3-540-29359-0ion procedures for certain kinds of interval logics. One system of interval logic is considered, and its associated system of machines is constructed. With this construction we also obtain a kind of translation between this interval logic and extended discrete propositional linear temporal logic.作者: 讓步 時(shí)間: 2025-3-23 23:07 作者: 山羊 時(shí)間: 2025-3-24 02:31
On completeness of narrowing strategies,ound complete set of E-unifiers are given; as well as an algorithm transforming specifications satisfying Huet and Hullot‘s principle of definition, into specifications fulfilling the proposed criteria.作者: Entirety 時(shí)間: 2025-3-24 08:44 作者: 金哥占卜者 時(shí)間: 2025-3-24 10:46
Unification in primal algebras,s..Two applications are studied in more detail: Post algebras and matrix rings over finite fields. The former are algebraic models for many-valued logics, the latter cover in particular modular arithmetic..It is indicated that the results extend to arbitrary varieties of primal algebras which include all Boolean and Post algebras and .-rings.作者: 假設(shè) 時(shí)間: 2025-3-24 16:38
Product and iteration of module specifications,odule. The iteration of a module M can be viewed as the limit of a sequence of products of the module with itself. The construction is shown to be well defined and to provide a solution to a fixed point equation at the specification level. More general recursive definitions are discussed and certain fixed point equations solved.作者: fender 時(shí)間: 2025-3-24 21:42 作者: gruelling 時(shí)間: 2025-3-25 00:57
Interval logics and sequential transducers,ion procedures for certain kinds of interval logics. One system of interval logic is considered, and its associated system of machines is constructed. With this construction we also obtain a kind of translation between this interval logic and extended discrete propositional linear temporal logic.作者: 并置 時(shí)間: 2025-3-25 07:23
A2CCS: A simple extension of CCS for handling atomic actions,omposition are proved to commute. The approach is applied to an extended version of CCS, called A.CCS, where a prefix operation containing an underlined action symbol expresses the fact that the action, when executed, must be part of a sequence of actions performed in an atomic manner.作者: 乏味 時(shí)間: 2025-3-25 11:20
Conference proceedings 1988eding 12 colloquia were held in France, Italy and Germany. CAAP ‘85 and CAAP ‘87 were integrated into the International Joint Conference on Theory and Practice of Software Development, TAPSOFT (see Lecture Notes in Computer Science volumes 185 and 249). As another effort to link theory and practice 作者: 字形刻痕 時(shí)間: 2025-3-25 14:02
Decomposition trees: Structured graph representation and efficient algorithms,an be constructed in polynomial time..Put together, these algorithms solve a number of .-complete problems in polynomial time on many graph classes, including all those graph languages that can be generated by any sort of context-free graph grammars, e.g., (hyper-)edge replacement grammars.作者: 糾纏 時(shí)間: 2025-3-25 18:21
Parameter-reduction of higher level grammars,ively..We introduce a hierarchy of restrictions to the deletion capability of the grammars which allow a gradual decrease in the complexity of the algorithms from n-iterated exponential time to polynomial time.作者: 承認(rèn) 時(shí)間: 2025-3-25 23:03
Algebraic specification with built-in domain constructions, principle also for the built-in constructions; this means that e.g. in the higher-order case not . functions use considered but only those that can be denoted by terms. This leads to a particularly simple theory by which the extended specifications can be related to the usual first-order ones.作者: resistant 時(shí)間: 2025-3-26 04:00 作者: 光明正大 時(shí)間: 2025-3-26 07:15
Dissipation and the Thermal Energy Domainively..We introduce a hierarchy of restrictions to the deletion capability of the grammars which allow a gradual decrease in the complexity of the algorithms from n-iterated exponential time to polynomial time.作者: 戰(zhàn)役 時(shí)間: 2025-3-26 08:45
https://doi.org/10.1007/978-3-642-18293-8 principle also for the built-in constructions; this means that e.g. in the higher-order case not . functions use considered but only those that can be denoted by terms. This leads to a particularly simple theory by which the extended specifications can be related to the usual first-order ones.作者: ANNUL 時(shí)間: 2025-3-26 12:53
,Analysis of dynamic algorithms in D.E.Knuth’s model,ons of linear lists, priority queues and dictionaries. The problem of finding the limiting distributions is also considered and the linear list case is treated in detail. The method uses continued fractions and orthogonal polynomials but in a paper in preparation, we show that the same results can b作者: LAITY 時(shí)間: 2025-3-26 20:26 作者: Affectation 時(shí)間: 2025-3-26 23:47
0302-9743 The papers are on word, tree or graph languages, with algorithmic or complexity studies, on abstract data types (another classical topic of CAAP) and/or term rewriting systems and on non-standard logics, and parallelism and concurrency.978-3-540-19021-9978-3-540-38930-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: cutlery 時(shí)間: 2025-3-27 04:46
https://doi.org/10.1007/b117574ons of linear lists, priority queues and dictionaries. The problem of finding the limiting distributions is also considered and the linear list case is treated in detail. The method uses continued fractions and orthogonal polynomials but in a paper in preparation, we show that the same results can b作者: PACK 時(shí)間: 2025-3-27 05:33
A tree pattern matching algorithm with reasonable space requirements,作者: pus840 時(shí)間: 2025-3-27 11:16 作者: ABASH 時(shí)間: 2025-3-27 16:05 作者: 大溝 時(shí)間: 2025-3-27 21:30 作者: 到婚嫁年齡 時(shí)間: 2025-3-28 00:07
,Analysis of dynamic algorithms in D.E.Knuth’s model,tive (resp. negative) queries Q. (resp.Q.) under the following assumptions: if the size of the data structure is k (k ε N), then the number of possibilities for the operations D and Q. is a linear function of k, whereas the number of possibilities for the i-th insertion or negative query is equal to作者: 說明 時(shí)間: 2025-3-28 02:57
On completeness of narrowing strategies,em relating narrowing and reduction relations. The completeness of narrowing strategies is proved and conditions for the computation of a "minimal" ground complete set of E-unifiers are given; as well as an algorithm transforming specifications satisfying Huet and Hullot‘s principle of definition, i作者: 預(yù)兆好 時(shí)間: 2025-3-28 07:05
Implementing term rewrite languages in Dactl,the limited form of graph rewriting which is commonly used to implement functional languages such as Miranda, ML, Hope, and Clean. In contrast to these functional languages, where the order in which subterms are evaluate (the .) is fixed for all programs, in Dactl the evaluation strategy is programm作者: Foreknowledge 時(shí)間: 2025-3-28 13:03
Unification in primal algebras, all solutions and coding them up in a single vector of terms. The other two methods are generalizations of unification algorithms for Boolean algebras..Two applications are studied in more detail: Post algebras and matrix rings over finite fields. The former are algebraic models for many-valued log作者: Affectation 時(shí)間: 2025-3-28 15:16 作者: 帶子 時(shí)間: 2025-3-28 20:09
Product and iteration of module specifications,y related to the operations of union and composition and it is motivated by the need to define potentially infinite export interfaces using a single module. The iteration of a module M can be viewed as the limit of a sequence of products of the module with itself. The construction is shown to be wel作者: modifier 時(shí)間: 2025-3-29 02:19 作者: 使更活躍 時(shí)間: 2025-3-29 04:25
Expressiveness bounds for completeness in trace-based network proof systems,vents is permitted. Relatively complete trace-based proof systems using temporal logic have been described, but full temporal logic is more powerful than necessary. Using the interleaving approach, we isolate the expressiveness required of a relatively complete trace logic. A hierarchy of temporal l作者: 人類的發(fā)源 時(shí)間: 2025-3-29 09:28
Proof systems for Hennessy-Milner Logic with recursion, a . one. Minimal interpretations of formulas are useful for expressing . properties of processes, whereas maximal interpretations are useful for expressing . properties. We present sound and complete proof systems for both interpretations for when a process satisfies a (possibly recursive) formula.作者: dry-eye 時(shí)間: 2025-3-29 14:01
Interval logics and sequential transducers,ended discrete propositional linear temporal logic and sequential machines with infinite input/output. The machines obtained enable us to derive decision procedures for certain kinds of interval logics. One system of interval logic is considered, and its associated system of machines is constructed.作者: BRIEF 時(shí)間: 2025-3-29 17:57
A2CCS: A simple extension of CCS for handling atomic actions,igher level transition systems is defined, where actions, in the higher level correspond to sequences of actions in the lower level. Abstraction and composition are proved to commute. The approach is applied to an extended version of CCS, called A.CCS, where a prefix operation containing an underlin作者: 織布機(jī) 時(shí)間: 2025-3-29 22:59
Modelling statecharts behaviour in a fully abstract way,eveloped by Harel [H]. This requires first of all defining a proper syntax for the graphical language. Apart from more conventional syntactical operators and their semantic counterparts, we encounter unconventional ones, dealing with the typical graphical structure of the language. The synchronous n作者: FAR 時(shí)間: 2025-3-30 03:19
Dissipation and the Thermal Energy Domains for many difficult graph problems..For a number of .-complete problems these algorithms are shown to run in linear time on decomposition trees with bounded .. Furthermore it is shown that for those graphs which have decomposition tree representations with bounded label size such a representation c作者: 含沙射影 時(shí)間: 2025-3-30 06:45 作者: 來自于 時(shí)間: 2025-3-30 08:35 作者: SEVER 時(shí)間: 2025-3-30 16:17
https://doi.org/10.1007/b117574tive (resp. negative) queries Q. (resp.Q.) under the following assumptions: if the size of the data structure is k (k ε N), then the number of possibilities for the operations D and Q. is a linear function of k, whereas the number of possibilities for the i-th insertion or negative query is equal to作者: Presbycusis 時(shí)間: 2025-3-30 17:18
Lumped Modeling of Dissipative Processesem relating narrowing and reduction relations. The completeness of narrowing strategies is proved and conditions for the computation of a "minimal" ground complete set of E-unifiers are given; as well as an algorithm transforming specifications satisfying Huet and Hullot‘s principle of definition, i作者: Surgeon 時(shí)間: 2025-3-30 23:00
Lumped Modeling of Dissipative Processesthe limited form of graph rewriting which is commonly used to implement functional languages such as Miranda, ML, Hope, and Clean. In contrast to these functional languages, where the order in which subterms are evaluate (the .) is fixed for all programs, in Dactl the evaluation strategy is programm作者: SPECT 時(shí)間: 2025-3-31 04:25 作者: Thyroid-Gland 時(shí)間: 2025-3-31 08:23 作者: exhilaration 時(shí)間: 2025-3-31 10:54
Microsystems for Emulsification,y related to the operations of union and composition and it is motivated by the need to define potentially infinite export interfaces using a single module. The iteration of a module M can be viewed as the limit of a sequence of products of the module with itself. The construction is shown to be wel作者: 確定的事 時(shí)間: 2025-3-31 14:17
https://doi.org/10.1007/3-540-29359-0nits. The semantics of this language allows the reduction of the network of processes to an equivalent sequential program, the correctness of which can be proved by the classical invariant method. The compatibility of the language with CSP is investigated. As a result, the language can also be used
