Sciweavers

1418 search results - page 148 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
138
Voted
FSEN
2007
Springer
15 years 10 months ago
Regulating Data Exchange in Service Oriented Applications
We define a type system for COWS, a formalism for specifying and combining services, while modelling their dynamic behaviour. Our types permit to express policies constraining dat...
Alessandro Lapadula, Rosario Pugliese, Francesco T...
OOPSLA
2009
Springer
15 years 11 months ago
Reimagining literate programming
In this paper we describe Ginger, a new language with first class support for literate programming. Literate programming refers to a philosophy that argues computer programs shou...
James Dean Palmer, Eddie Hillenbrand
ICAC
2007
IEEE
15 years 11 months ago
Adaptive Multi-levels Dictionaries and Singular Value Decomposition Techniques for Autonomic Problem Determination
An autonomic problem determination system can adapt to changing environments, react to existing or new error condition and predict possible problems. In this report, we propose su...
Hoi Chan, Thomas Kwok
AOSD
2007
ACM
15 years 8 months ago
Open bisimulation for aspects
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
Radha Jagadeesan, Corin Pitcher, James Riely
SYNTHESE
2008
99views more  SYNTHESE 2008»
15 years 4 months ago
Public and private communication are different: results on relative expressivity
Dynamic Epistemic Logic (DEL) is the study of how to reason about knowledge, belief, and communication. This paper studies the relative expressivity of certain fragments of the DE...
Bryan Renne