Sabina Petride

Learn More
To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification exists. This process is particularly effective if the specifications are written in a high-level language that makes it easy for designers to specify their goals. We consider a high-level(More)
Oracle RDBMS has supported XML data management for more than six years since version 9i. Prior to 11g, textcentric XML documents can be stored as-is in a CLOB column and schema-based data-centric documents can be shredded and stored in object-relational (OR) tables mapped from their XML Schema. However, both storage formats have intrinsic(More)
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends on the whole network, the goal is for every agent to eventually compute the value f (N). We call this problem global function computation. Various solutions for instances of this(More)
Much has been done to formally talk about processes in the last decades, especially in the field of process algebras. In [Hoa85] A. Hoare laid the foundations of Communicating Sequential Processes (CSP) formalism, while in [Mil89] Milner proposed the slightly different approach of Calculus of Communicating Systems (CCS). Both process algebras have been(More)
McLean’s notion of Selective Interleaving Functions (SIFs) is perhaps the bestknown attempt to construct a framework for expressing various security properties. We examine the expressive power of SIFs carefully. We show that SIFs cannot capture nondeducibility on strategies (NOS). We also prove that the set of security properties expressed with SIFs is not(More)
  • 1