Most of the existing verification techniques for message-passing programs suppose either that chan-nel 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 demonstra...
The difficulties of verifying concurrent programs lie in their inherent non-determinism and interfer...
This paper motivates and presents a program logic for reasoning about multithreaded Java-like progra...
We develop and prove sound a concurrent separation logic for Pthreads-stylebarriers. Although Pthrea...
Most of the existing verification techniques for message-passing programs suppose either that channe...
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...
This thesis explores two kinds of program logics that have become important for modern program verif...
One common approach for verifying safety properties of multithreaded programs is assigning appropria...
In concurrent verification, separation logic provides a strong story for handling both resources tha...
Abstract. Communicating multi-pushdown systems model networks of multi-threaded recursive programs c...
Abstract. Automated verification of programs that utilize data structures with intrinsic sharing is ...
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. Af...
We develop local reasoning techniques for message passing concurrent programs based on ideas from se...
Separation logic began by describing total separation between the heap space used by separate parts ...
This paper contributes to the development of techniques for the modular proof of programs that inclu...
The difficulties of verifying concurrent programs lie in their inherent non-determinism and interfer...
This paper motivates and presents a program logic for reasoning about multithreaded Java-like progra...
We develop and prove sound a concurrent separation logic for Pthreads-stylebarriers. Although Pthrea...
Most of the existing verification techniques for message-passing programs suppose either that channe...
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...
This thesis explores two kinds of program logics that have become important for modern program verif...
One common approach for verifying safety properties of multithreaded programs is assigning appropria...
In concurrent verification, separation logic provides a strong story for handling both resources tha...
Abstract. Communicating multi-pushdown systems model networks of multi-threaded recursive programs c...
Abstract. Automated verification of programs that utilize data structures with intrinsic sharing is ...
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. Af...
We develop local reasoning techniques for message passing concurrent programs based on ideas from se...
Separation logic began by describing total separation between the heap space used by separate parts ...
This paper contributes to the development of techniques for the modular proof of programs that inclu...
The difficulties of verifying concurrent programs lie in their inherent non-determinism and interfer...
This paper motivates and presents a program logic for reasoning about multithreaded Java-like progra...
We develop and prove sound a concurrent separation logic for Pthreads-stylebarriers. Although Pthrea...