Sciweavers

328 search results - page 38 / 66
» Proving Termination of Communicating Programs
Sort
View
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
14 years 8 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
14 years 1 months ago
Automatic generation of polynomial loop
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
Enric Rodríguez-Carbonell, Deepak Kapur
ECOOP
2008
Springer
13 years 9 months ago
Session-Based Distributed Programming in Java
This paper demonstrates the impact of integrating session types and object-oriented programming, through their implementation in Java. Seses provide high-level abstraction for stru...
Raymond Hu, Nobuko Yoshida, Kohei Honda
APLAS
2004
ACM
14 years 1 months ago
Protocol Specialization
Abstract. In component-based programming, the programmer assembles applications from prefabricated components. The assembly process has two main steps: adapting a component by twea...
Matthias Neubauer, Peter Thiemann
TCS
2008
13 years 7 months ago
A timed semantics of Orc
Orc is a kernel language for structured concurrent programming. Orc provides three powerful combinators that define the structure of a concurrent computation. These combinators su...
Ian Wehrman, David Kitchin, William R. Cook, Jayad...