Sciweavers

55 search results - page 11 / 11
» Reasoning About Imperative Quantum Programs
Sort
View
POPL
2008
ACM
14 years 5 months ago
Cryptographically sound implementations for typed information-flow security
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...
Cédric Fournet, Tamara Rezk
VSTTE
2012
Springer
12 years 8 days ago
Deciding Functional Lists with Sublist Sets
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
Thomas Wies, Marco Muñiz, Viktor Kuncak
POPL
2011
ACM
12 years 7 months ago
The essence of compiling with traces
The technique of trace-based just-in-time compilation was introduced by Bala et al. and was further developed by Gal et al. It currently enjoys success in Mozilla Firefox’s Java...
Shu-yu Guo, Jens Palsberg
WWW
2005
ACM
14 years 5 months ago
A service creation environment based on end to end composition of Web services
The demand for quickly delivering new applications is increasingly becoming a business imperative today. Application development is often done in an ad hoc manner, without standar...
Vikas Agarwal, Koustuv Dasgupta, Neeran M. Karnik,...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 4 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner