Sciweavers

44 search results - page 2 / 9
» Verifying liveness for asynchronous programs
Sort
View
CONCUR
2009
Springer
13 years 2 months ago
On Convergence of Concurrent Systems under Regular Interactions
Convergence is often the key liveness property for distributed systems that interact with physical processes. Techniques for proving convergence (asymptotic stability) have been ex...
Pavithra Prabhakar, Sayan Mitra, Mahesh Viswanatha...
SIGSOFT
2007
ACM
14 years 5 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
FORTE
2011
12 years 8 months ago
A Framework for Verifying Data-Centric Protocols
Abstract. Data centric languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. They simplify greatly the code, whic...
Yuxin Deng, Stéphane Grumbach, Jean-Fran&cc...
ECOOP
2010
Springer
13 years 9 months ago
Verifying Generics and Delegates
Recently, object-oriented languages, such as C , have been extended with language features prevalent in most functional languages: parametric polymorphism and higher-order function...
Kasper Svendsen, Lars Birkedal, Matthew Parkinson
IGPL
2006
130views more  IGPL 2006»
13 years 4 months ago
Verifying Temporal Heap Properties Specified via Evolution Logic
Abstract. This paper addresses the problem of establishing temporal properties of programs written in languages, such as Java, that make extensive use of the heap to allocate-and d...
Eran Yahav, Thomas W. Reps, Shmuel Sagiv, Reinhard...