找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Recent Trends in Algebraic Development Techniques; 13th International W José Luiz Fiadeiro Conference proceedings 1999 Springer-Verlag Berl

[復(fù)制鏈接]
樓主: EXTRA
31#
發(fā)表于 2025-3-26 22:04:38 | 只看該作者
Using Reflection to Specify Transaction Sequences in Rewriting Logic,ns networks. The application is illustrated by a process that modifies the demand of a service between two nodes in the network. The strategy language selected for controlling the process is based on the one presented in [2] which has been enhanced with a new operation that applies a strategy over a
32#
發(fā)表于 2025-3-27 01:20:45 | 只看該作者
Concurrency and Data Types: A Specification Method An Example with LOTOS,ation of concurrent activity and the specification of the data types involved. It is applied here to LOTOS specification, but it may be used for other formalisms. Our method is both constraint oriented (for the processes decomposition into parallel subprocesses) and state oriented (for the design of
33#
發(fā)表于 2025-3-27 07:24:58 | 只看該作者
34#
發(fā)表于 2025-3-27 10:44:47 | 只看該作者
35#
發(fā)表于 2025-3-27 15:46:41 | 只看該作者
Parameterisation of Logics,ameter) logic. We provide a categorial characterisation of parameterisation and illustrate it with an example. Under reasonable assumptions, we show that the result logic is a conservative extension of both the parameterised and parameter logics and also that soundness, completeness and decidability are transferred.
36#
發(fā)表于 2025-3-27 17:55:21 | 只看該作者
Parallel Admissible Graph Rewriting,ed relation is always confluent, as well as confluent modulo bisimilarity, for a large class of graphs called admissible graphs. Afterwards, we define a parallel graph rewriting relation and propose an efficient parallel graph rewriting strategy.
37#
發(fā)表于 2025-3-27 22:08:57 | 只看該作者
The Situation and State Calculus versus Branching Temporal Logic,sion of SC is proposed, the situation and state calculus (SSC), where the concept of state is primitive, just like actions, situations and fluents. SSC is then compared with a branching temporal logic (BTL). A representation of BTL in SSC is defined and shown to establish a sound and complete encoding.
38#
發(fā)表于 2025-3-28 03:00:11 | 只看該作者
Complete Strategies for Term Graph Narrowing,r is shown to be complete in the presence of innermost normalization and confluence, the latter in the presence of termination and confluence. Maximally collapsing narrowing sometimes speeds up narrowing derivations drastically. Our results on minimally collapsing basic narrowing correct analogous c
39#
發(fā)表于 2025-3-28 08:00:30 | 只看該作者
0302-9743 ice of Software, is taking place this year in Lisbon. It comprises ?ve conferences (FoSSaCS, FASE, ESOP, CC, TACAS), four workshops (ACoS, VISUAL, WADT, CMCS), seven invited lectures, and nine tutorials.978-3-540-66246-4978-3-540-48483-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
40#
發(fā)表于 2025-3-28 13:58:22 | 只看該作者
Carlos Caleiro,Cristina Sernadas,Amílcar Sernadas Recent developments in the understanding of degradation pathways further impact methodologies used in the pharmaceutical industry for prospective stability assessment. This paper discusses these emerging aspects in terms of limitations of drug-excipient compatibility studies, emerging paradigms in
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-11 04:47
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
六枝特区| 怀化市| 南部县| 哈巴河县| 类乌齐县| 阜平县| 泸溪县| 彭阳县| 长泰县| 海兴县| 郯城县| 揭西县| 明星| 全州县| 原平市| 榆中县| 沧州市| 肇庆市| 建阳市| 绵阳市| 本溪市| 沅陵县| 万山特区| 沂南县| 都昌县| 大英县| 钦州市| 波密县| 樟树市| 东乌珠穆沁旗| 历史| 增城市| 安宁市| 绥江县| 平昌县| 静安区| 达州市| 广昌县| 龙井市| 邵阳县| 南宁市|