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

hidebound

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

宣傳

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

無王時(shí)期,

uncertain

安心地散步

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.

ALERT

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.

斜谷

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.

變化無常

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

離開真充足

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

Respond

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