Most of the existing verification techniques for message-passing programs suppose either that channel endpoints are used in a linear fashion, where at most one thread may send or receive from an endpoint at any given time, or that endpoints may be used arbitrarily by any number of threads. The former approach usually forbids the sharing of channels while the latter limits what is provable about programs. In this paper we propose a midpoint between these techniques by extending a proof system based on separation logic to allow sharing of endpoints. We identify two independent mechanisms for supporting sharing: an extension of fractional shares to endpoints, and a new technique based on what we call reflexive ownership transfer. We demonstrat...
We present a new protocol for the verifiable redistribution of secrets from (m,n) to (m # ,n # ) acc...
The combination of message passing and locking to protect shared state is a useful concurrency patte...
Abstract. The combination of message passing and locking to protect shared state is a useful concurr...
Most of the existing verification techniques for message-passing programs suppose either that chan-n...
Recent advances in the formal verification of message-passing programs are based on proving that pro...
One common approach for verifying safety properties of multithreaded programs is assigning appropria...
One common approach for verifying safety properties of multithreaded programs is assigning appropria...
This thesis explores two kinds of program logics that have become important for modern program verif...
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. Af...
In concurrent verification, separation logic provides a strong story for handling both resources tha...
We develop local reasoning techniques for message passing concurrent programs based on ideas from se...
Abstract. Automated verification of programs that utilize data structures with intrinsic sharing is ...
Abstract. Communicating multi-pushdown systems model networks of multi-threaded recursive programs c...
In this paper we try to shed a new insight on Verifiable Secret Sharing Schemes (VSS). We first defi...
Separation logic began by describing total separation between the heap space used by separate parts ...
We present a new protocol for the verifiable redistribution of secrets from (m,n) to (m # ,n # ) acc...
The combination of message passing and locking to protect shared state is a useful concurrency patte...
Abstract. The combination of message passing and locking to protect shared state is a useful concurr...
Most of the existing verification techniques for message-passing programs suppose either that chan-n...
Recent advances in the formal verification of message-passing programs are based on proving that pro...
One common approach for verifying safety properties of multithreaded programs is assigning appropria...
One common approach for verifying safety properties of multithreaded programs is assigning appropria...
This thesis explores two kinds of program logics that have become important for modern program verif...
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. Af...
In concurrent verification, separation logic provides a strong story for handling both resources tha...
We develop local reasoning techniques for message passing concurrent programs based on ideas from se...
Abstract. Automated verification of programs that utilize data structures with intrinsic sharing is ...
Abstract. Communicating multi-pushdown systems model networks of multi-threaded recursive programs c...
In this paper we try to shed a new insight on Verifiable Secret Sharing Schemes (VSS). We first defi...
Separation logic began by describing total separation between the heap space used by separate parts ...
We present a new protocol for the verifiable redistribution of secrets from (m,n) to (m # ,n # ) acc...
The combination of message passing and locking to protect shared state is a useful concurrency patte...
Abstract. The combination of message passing and locking to protect shared state is a useful concurr...