Sciweavers

603 search results - page 98 / 121
» A Formal Operational Semantics for SOFL
Sort
View
124
Voted
ENTCS
2008
91views more  ENTCS 2008»
15 years 1 months ago
A Name Abstraction Functor for Named Sets
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
Vincenzo Ciancia, Ugo Montanari
CJ
2004
105views more  CJ 2004»
15 years 1 months ago
Generalized Template Splay: A Basic Theory and Calculus
act interpretation. R. Barbuti, C. Bernardeschi and N. De Francesco With mobile technology more and more prominent, the problem of security leakages becomes more and more important...
George F. Georgakopoulos, David J. McClurkin
LOGCOM
2002
142views more  LOGCOM 2002»
15 years 1 months ago
Two Logical Theories of Plan Recognition
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
Wayne Wobcke
ICFEM
2010
Springer
15 years 12 days ago
Dynamic Resource Reallocation between Deployment Components
Abstract. Today’s software systems are becoming increasingly configurable and designed for deployment on a plethora of architectures, ranging from sequential machines via multic...
Einar Broch Johnsen, Olaf Owe, Rudolf Schlatte, Si...
134
Voted
KR
2000
Springer
15 years 5 months ago
Reasoning with Axioms: Theory and Practice
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
Ian Horrocks, Stephan Tobies