140 search results - page 23 / 28 » Verifying timing properties of concurrent algorithms |
IFM
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. We present a framework for model checking concurrent software systems which incorporates both states and events. Contrary to other state/event approaches, our work also i...
DAC
2007
ACM
14 years 8 months ago
2007
ACM
This paper argues for an implicitly parallel programming model for many-core microprocessors, and provides initial technical approaches towards this goal. In an implicitly paralle...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
ICCAD
1994
IEEE
13 years 11 months ago
1994
IEEE
Language containment is a method for design verification that involves checking if the behavior of the system to be verified is a subset of the behavior of the specifications (pro...
TON
2010
13 years 2 months ago
2010
This paper develops a new model that describes the queueing process of a communication network when data sources use window flow control. The model takes into account the burstines...