Sciweavers

140 search results - page 5 / 28
» Verifying timing properties of concurrent algorithms
Sort
View
FM
2009
Springer
157views Formal Methods» more  FM 2009»
14 years 2 months ago
Symbolic Predictive Analysis for Concurrent Programs
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
Chao Wang, Sudipta Kundu, Malay K. Ganai, Aarti Gu...
SRDS
2000
IEEE
13 years 11 months ago
Detection of Livelocks in Communication Protocols by Means of a Polygon Time Structure
As has been shown, the polygon time structure overcomes the main limitations of the interval time structure, and allows to verify communication protocols, in which the explicit co...
Jerzy Brzezinski, Michal Sajkowski
PASTE
1998
ACM
13 years 11 months ago
Efficient Composite Data Flow Analysis Applied to Concurrent Programs
FLAVERS, a tool for verifying properties of concurrent systems, uses composite data flow analysis to incrementally improve the precision of the results of its verifications. Altho...
Gleb Naumovich, Lori A. Clarke, Leon J. Osterweil
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 7 months ago
Concurrent general composition of secure protocols in the timing model
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
SIGSOFT
2009
ACM
14 years 8 months ago
Symbolic pruning of concurrent program executions
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
Chao Wang, Swarat Chaudhuri, Aarti Gupta, Yu Yang