Sciweavers

1360 search results - page 184 / 272
» Reasoning on Workflow Executions
Sort
View
ENTCS
2010
118views more  ENTCS 2010»
15 years 23 days ago
Transaction Scripts: Making Implicit Scenarios Explicit
We describe a true-concurrent approach for managing dependencies between distributed and concurrent coordinator components of a long-running transaction. In previous work we have ...
Sotiris Moschoyiannis, Amir R. Razavi, Paul J. Kra...
CORR
2010
Springer
96views Education» more  CORR 2010»
14 years 10 months ago
Quantifying Information Leakage in Finite Order Deterministic Programs
Information flow analysis is a powerful technique for reasoning about the sensitive information exposed by a program during its execution. While past work has proposed information...
Ji Zhu, Mudhakar Srivatsa
ICASSP
2011
IEEE
14 years 7 months ago
SRF: Matrix completion based on smoothed rank function
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
Hooshang Ghasemi, Mohmmadreza Malek-Mohammadi, Mas...
151
Voted
PADL
2012
Springer
13 years 11 months ago
Recent Advances in Declarative Networking
Declarative networking is a programming methodology that enables developers to concisely specify network protocols and services, and directly compile these specifications into a d...
Boon Thau Loo, Harjot Gill, Changbin Liu, Yun Mao,...
CADE
2008
Springer
16 years 3 months ago
Precise Dynamic Verification of Confidentiality
Confidentiality is maybe the most popular security property to be formally or informally verified. Noninterference is a baseline security policy to formalize confidentiality of sec...
Gurvan Le Guernic