Sciweavers

1548 search results - page 134 / 310
» Semantics and Extensions of WS-Agreement
Sort
View
ASIAN
1999
Springer
99views Algorithms» more  ASIAN 1999»
14 years 2 months ago
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sa...
Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakr...
ATAL
1999
Springer
14 years 2 months ago
Reasoning about Visibility, Perception and Knowledge
Although many formalisms have been proposed for reasoning about intelligent agents, few of these have been semantically grounded in a concrete computational model. This paper prese...
Michael Wooldridge, Alessio Lomuscio
ERSHOV
1999
Springer
14 years 2 months ago
Enhanced Control Flow Graphs in Montages
A semi-visual framework for the speci cation of syntax and semantics of imperative programming languages, called Montages, was proposed in an earlier work by the authors. The prima...
Matthias Anlauff, Philipp W. Kutter, Alfonso Piera...
ICCL
1998
IEEE
14 years 2 months ago
Modular Compilers Based on Monad Transformers
The monadic style of language speci cation has the advantages of modularity and extensibility: it is simple to add or change features in an interpreter to re ect modi cations in t...
William L. Harrison, Samuel N. Kamin
CSFW
1996
IEEE
14 years 2 months ago
Comparing Two Information Flow Security Properties
In this paper we compare two information flow security properties: the lazy security (L-Sec) [11] and the Bisimulation Non-deducibility on Compositions (BNDC) [4]. To make this we...
Riccardo Focardi