140 search results - page 1 / 28 » Verifying timing properties of concurrent algorithms |
FORTE
1994
13 years 6 months ago
1994
SIGSOFT
1994
ACM
13 years 9 months ago
1994
ACM
In this paper we present an approach, based on data ow analysis, that can provide cost-e ective analysis of concurrent programs with respect to explicitly stated correctness prope...
JUCS
2006
13 years 4 months ago
2006
: The size and complexity of software systems are continuously increasing, which makes them difficult and labor-intensive to develop, test and evolve. Since concurrent systems are ...
KBSE
2005
IEEE
13 years 10 months ago
2005
IEEE
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
ATVA
2006
Springer
13 years 8 months ago
2006
Springer
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...