Sciweavers

140 search results - page 4 / 28
» Verifying timing properties of concurrent algorithms
Sort
View
ISORC
2005
IEEE
14 years 1 months ago
Model-Checking of Component-Based Event-Driven Real-Time Embedded Software
As complexity of real-time embedded software grows, it is desirable to use formal verification techniques to achieve a high level of assurance. We discuss application of model-ch...
Zonghua Gu, Kang G. Shin
ICST
2008
IEEE
14 years 1 months ago
Verifying and Analyzing Adaptive Logic through UML State Models
It is becoming increasingly important to be able to adapt an application’s behavior at run time in response to changing requirements and environmental conditions. Adaptive progr...
Andres J. Ramirez, Betty H. C. Cheng
ASYNC
2005
IEEE
118views Hardware» more  ASYNC 2005»
14 years 1 months ago
Modeling and Verifying Circuits Using Generalized Relative Timing
We propose a novel technique for modeling and verifying timed circuits based on the notion of generalized relative timing. Generalized relative timing constraints can express not ...
Sanjit A. Seshia, Randal E. Bryant, Kenneth S. Ste...
CAV
1994
Springer
111views Hardware» more  CAV 1994»
13 years 11 months ago
Automatic Verification of Timed Circuits
This paper presents a new formalism and a new algorithm for verifying timed circuits. The formalism, called orbital nets, allows hierarchical verification based on abehavioralseman...
Tomas Rokicki, Chris J. Myers
CONCUR
2010
Springer
13 years 8 months ago
Reasoning about Optimistic Concurrency Using a Program Logic for History
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...
Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, Yu Zhang