標題: Titlebook: Algebraic Methodology and Software Technology; 4th International Co V. S. Alagar,Maurice Nivat Conference proceedings 1995 Springer-Verlag [打印本頁] 作者: Addiction 時間: 2025-3-21 18:29
書目名稱Algebraic Methodology and Software Technology影響因子(影響力)
書目名稱Algebraic Methodology and Software Technology影響因子(影響力)學科排名
書目名稱Algebraic Methodology and Software Technology網(wǎng)絡公開度
書目名稱Algebraic Methodology and Software Technology網(wǎng)絡公開度學科排名
書目名稱Algebraic Methodology and Software Technology被引頻次
書目名稱Algebraic Methodology and Software Technology被引頻次學科排名
書目名稱Algebraic Methodology and Software Technology年度引用
書目名稱Algebraic Methodology and Software Technology年度引用學科排名
書目名稱Algebraic Methodology and Software Technology讀者反饋
書目名稱Algebraic Methodology and Software Technology讀者反饋學科排名
作者: ALLEY 時間: 2025-3-21 21:46
Verification in continuous time by discrete reasoning,作者: Cocker 時間: 2025-3-22 03:43
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152665.jpg作者: 兒童 時間: 2025-3-22 08:05
https://doi.org/10.1007/3-540-60043-4Algebraic Foundations; Algebraische Grundlagen; Category Theoory; Echtzeit-Systeme; Formal Methods; Forma作者: NEG 時間: 2025-3-22 11:15 作者: IRS 時間: 2025-3-22 14:56 作者: 人造 時間: 2025-3-22 18:54
Aditya Rawal,Jason Liang,Risto Miikkulainenhen writing formal specifications. The most conspicuous problem is learning to abstract. I address all these problems indirectly by giving a list of hints to specifiers. Thus this paper should be of interest not only to teachers of formal methods but also to their students.作者: 癡呆 時間: 2025-3-22 23:19 作者: 不可侵犯 時間: 2025-3-23 01:36
Marvin Klingner,Tim Fingscheidtasynchronously by means of multiparty channels can be easily created. In this paper we study correctness these programs. In particular, we propose proof methods allowing us to deal with occur check freedom, absence of deadlock, absence of errors in presence of arithmetic relations, and termination. 作者: effrontery 時間: 2025-3-23 06:30
Oliver Grau,Korbinian Hagn,Qutub Syed Shabeyond terms, so as to include: Horn clause logic, with and without equality; all variants of order and many sorted equational logic, including working modulo a set of axioms; constraint logic programming over arbitrary user-defined data types; and any combination of the above. This unifies several 作者: alabaster 時間: 2025-3-23 10:44
SpringerBriefs in Computer Sciencea generalisation to the order-sorted case of an approach given by M?ller, Tarlecki and Wirsing for the many-sorted case. The main idea in the proposal is to only consider reachable extensional algebras. This leads to a very simple theory, where it is possible to relate the higher-order specification作者: circumvent 時間: 2025-3-23 15:26
Himanshu Singh,Yunis Ahmad Loneal equality). The central objective of this work is the investigation of proof rules that first allow us to establish the correctness of behavioural implementations in a modular way and moreover are practicable enough to induce proof obligations that can be discharged with existing theorem provers. 作者: HEDGE 時間: 2025-3-23 21:49
Himanshu Singh,Yunis Ahmad Loneability Theorem states that up to finite name spaces and up to a static normalisation procedure, the set of reachable agent expressions is finite. Secondly a Boundedness Lemma shows that no potential computations are missed when name spaces are chosen large enough, but finite. We show how these resu作者: 氣候 時間: 2025-3-24 00:05 作者: 心神不寧 時間: 2025-3-24 02:48
https://doi.org/10.1007/978-3-030-11605-7tional and logic programming. We present several refinements of higher-order lazy narrowing for convergent (terminating and confluent) term rewrite systems and their application to program transformation. The improvements of narrowing include a restriction of narrowing at variables, generalizing the作者: resistant 時間: 2025-3-24 08:34 作者: RALES 時間: 2025-3-24 10:55 作者: 消息靈通 時間: 2025-3-24 18:20 作者: 洞穴 時間: 2025-3-24 20:21
https://doi.org/10.1007/978-88-470-1866-2ions. An existing system of derivation of the relation among non-parametric specifications is enlarged so as to comprise parametric specifications. The new system is correct and complete under certain assumptions. By means of this system the calculus of parametric specifications can be enhanced with作者: 涂掉 時間: 2025-3-25 02:04
Hao Dong,Zihan Ding,Shanghang Zhangtrix calculi can handle only the case of programs whose dimensions are rigidly fixed. In this paper, the notion of dynamic matrix is presented. Dynamic matrices are special matrices having extensible dimensions (rows and columns) which allow matrix product to be always defined. We put forward the th作者: RAGE 時間: 2025-3-25 07:15 作者: AGONY 時間: 2025-3-25 10:02 作者: ANTE 時間: 2025-3-25 13:48
SpringerBriefs in Computer Sciencea generalisation to the order-sorted case of an approach given by M?ller, Tarlecki and Wirsing for the many-sorted case. The main idea in the proposal is to only consider reachable extensional algebras. This leads to a very simple theory, where it is possible to relate the higher-order specifications to first order specifications.作者: Occupation 時間: 2025-3-25 18:17
Teaching mathematics to software engineers,hen writing formal specifications. The most conspicuous problem is learning to abstract. I address all these problems indirectly by giving a list of hints to specifiers. Thus this paper should be of interest not only to teachers of formal methods but also to their students.作者: Feature 時間: 2025-3-25 23:20 作者: 逢迎春日 時間: 2025-3-26 03:41 作者: 不可思議 時間: 2025-3-26 05:56 作者: 鄙視 時間: 2025-3-26 11:45 作者: Mendicant 時間: 2025-3-26 14:02
Marieke Zeinstra-Helfrich,Albertinka J. Murkhanized support including tactics for building goal-directed proofs. Our representation of a language in Coq is influenced by the encoding of logics used by Church [6] and in the Edinburgh Logical Framework (ELF) [15, 3].作者: 思想上升 時間: 2025-3-26 20:17
Verification of logic programs with delay declarations,These methods turn out to be simple modifications of the corresponding methods dealing with Prolog programs. This allows us to derive correct delay declarations by analyzing Prolog programs. Finally, we point out difficulties concerning proofs of termination.作者: GRILL 時間: 2025-3-26 21:40 作者: Anthology 時間: 2025-3-27 03:51
Encoding natural semantics in Coq,hanized support including tactics for building goal-directed proofs. Our representation of a language in Coq is influenced by the encoding of logics used by Church [6] and in the Edinburgh Logical Framework (ELF) [15, 3].作者: 量被毀壞 時間: 2025-3-27 08:28 作者: archaeology 時間: 2025-3-27 12:50
0302-9743 29 refereed papers presented were selected from some 100 submissions; they are organized in sections on algebraic and logical foundations, concurrent and reactive systems, software technology, logic programming and databases.978-3-540-60043-5978-3-540-49410-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 跑過 時間: 2025-3-27 14:27
0302-9743 al, Canada in July 1995..It includes full papers or extended abstracts of the invited talks, refereed selected contributions, and research prototype tools. The invited speakers are David Gries, Jeanette Wing, Dan Craigen, Ted Ralston, Ewa Orlowska, Krzysztof Apt, Joseph Goguen, and Rohit Parikh. The作者: Loathe 時間: 2025-3-27 20:28 作者: 細微的差異 時間: 2025-3-28 02:00 作者: colloquial 時間: 2025-3-28 05:26
William Lehr,Scott A. Socolofskye) .. We show that the category of such coalgebras and structure preserving functions is comonadic over sets. Therefore we introduce the notion of a ‘mongruence’ (predicate) on a coalgebra. It plays the dual role of a congrence (relation) on an algebra.作者: 重畫只能放棄 時間: 2025-3-28 06:44 作者: 不再流行 時間: 2025-3-28 11:46 作者: Infinitesimal 時間: 2025-3-28 17:09 作者: Frequency 時間: 2025-3-28 21:00
Mongruences and cofree coalgebras,e) .. We show that the category of such coalgebras and structure preserving functions is comonadic over sets. Therefore we introduce the notion of a ‘mongruence’ (predicate) on a coalgebra. It plays the dual role of a congrence (relation) on an algebra.作者: 聽覺 時間: 2025-3-29 01:50 作者: 漂亮 時間: 2025-3-29 04:08 作者: 褪色 時間: 2025-3-29 08:11
William Lehr,Scott A. Socolofsky: Term (..) → diagr (..) which maps specifications to diagrams, and specification morphisms to diagram morphisms. This interpretation is sound in that the colimit of a diagram representing a specification is isomorphic to this specification. The problem of isomorphisms of modular specifications is solved by detecting isomorphisms of diagrams.作者: Arb853 時間: 2025-3-29 12:38 作者: 掙扎 時間: 2025-3-29 15:34
The role of education and training in the industrial application of formal methods,issues as in-house company education; external education; differences in curricula between North America and Europe; profiles of personnel working on formal methods projects; and the role of tools as educational media.作者: 冷漠 時間: 2025-3-29 22:42 作者: 混合物 時間: 2025-3-30 02:07
Semantic typing for parametric algebraic specifications,d by the semantic parameter restriction. This typing can be derived, and so function application is conditional to the derivability of the parameter restrictions instantiated with the actual argument.作者: Albumin 時間: 2025-3-30 04:40 作者: PARA 時間: 2025-3-30 08:14 作者: 善于 時間: 2025-3-30 14:12 作者: HEPA-filter 時間: 2025-3-30 19:55 作者: prodrome 時間: 2025-3-31 00:42 作者: 服從 時間: 2025-3-31 02:34
Context-free event domains are recognizable,trace automaton recognizing that event domain. The advantage of trace automata over unlabelled graph grammars is to provide for a more concrete and therefore more tractable representation of event domains,well suited to an automated verification of their properties.作者: giggle 時間: 2025-3-31 08:18
Equational logic as a tool,re are avid users of mechanical verifiers and proof checkers, but they are a small the minority.) One reason for this is that the foundation of many formalisms —propositional and predicate logic— has been viewed and taught more as an object of study than as a useful tool..We believe that formal logi
