Titlebook: Semantics: Foundations and Applications; REX Workshop, Beekbe J. W. Bakker,W. -P. Roever,G. Rozenberg Conference proceedings 1993 Springer-

物种起源

Proving total correctness of programs in weak second-order logic,weakest precondition for an imperative programming language similar to Dijkstra‘s language of guarded commands. It is demonstrated how to express and prove important properties of wp in this logic. Here a new normal form representation for wp plays an important rôle.

勉强

结果

A categorical model for logic programs: Indexed monoidal categories,n techniques for providing a categorical semantics for logical systems. On the other hand, it allows us to keep the effectiveness of the Horn Clause Logic fragment of first order logic. This is shown by providing an effective construction of the initial model of a program, obtained through the appli

CORE

Compact metric information systems,y of compact metric information systems and metric approximable mappings, dual to the category of compact metric spaces and non-expansive maps, is a partially complete I-category in which canonical solution of domain equations can be found by taking the union (least upper bound) of certain Cauchy ch

CLAN

Asynchronous rendez-vous in distributed logic programming,g with object oriented features and parallelism. For an abstract subset of DLP both an operational and denotational semantics is given. The language DLP supports active objects, method call by rendez-vous and moreover (distributed) backtracking over the results of such a rendez-vous. To enable furth

允许

绝缘

Temporal preconditions of recursive procedures,s weakest precondition, the proposed behaviour is termination in a state with a given postcondition. For the temporal predicate transformers of Lukkien, the proposed behaviour is specified in terms of predicates on the intermediate states. For example, for a command c and predicates . and ., the pre

RAGE

Towards an epistemic approach to reasoning about concurrent programs,text of distributed systems, where they use the interleaving model, we extend this to a setting where also truly concurrent computations can be modelled, viz. posets of action labels. Moreover, and more importantly, we prepare grounds for the verification of concurrent programs. We focus on a varian

歌唱队

A fully abstract model for a nonuniform concurrent language with parameterization and locality, atomic statements generally depends on the current state; it has . with . and . and . in the form of . and ., in addition to more conventional constructs: . to variables, . with CSP/CCS-like communication, ., and .. First two operational models .. and .. for . are introduced in terms of a Plotkin-s