找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: EXTRA
发表于 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
发表于 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
发表于 2025-3-27 07:24:58 | 显示全部楼层
发表于 2025-3-27 10:44:47 | 显示全部楼层
发表于 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.
发表于 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.
发表于 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.
发表于 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
发表于 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
发表于 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
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-9 00:00
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表