Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
4 results

Sampled Semantics of Timed Automata

Pavel Krcal ; Parosh Aziz Abdulla ; Wang Yi.
Sampled semantics of timed automata is a finite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems with a fixed granularity of time, the abstract character of the latter makes it appealing for system modeling and verification. We study&nbsp;[&hellip;]
Published on September 1, 2010

Stochastic Parity Games on Lossy Channel Systems

Parosh Aziz Abdulla ; Lorenzo Clemente ; Richard Mayr ; Sven Sandberg.
We give an algorithm for solving stochastic parity games with almost-sure winning conditions on {\it lossy channel systems}, under the constraint that both players are restricted to finite-memory strategies. First, we describe a general framework, where we consider the class of 2 1/2-player games&nbsp;[&hellip;]
Published on January 5, 2015

A Load-Buffer Semantics for Total Store Ordering

Parosh Aziz Abdulla ; Mohamed Faouzi Atig ; Ahmed Bouajjani ; Tuan Phong Ngo.
We address the problem of verifying safety properties of concurrent programs running over the Total Store Order (TSO) memory model. Known decision procedures for this model are based on complex encodings of store buffers as lossy channels. These procedures assume that the number of processes is&nbsp;[&hellip;]
Published on January 23, 2018

Mending Fences with Self-Invalidation and Self-Downgrade

Parosh Aziz Abdulla ; Mohamed Faouzi Atig ; Stefanos Kaxiras ; Carl Leonardsson ; Alberto Ros ; Yunyun Zhu.
Cache coherence protocols based on self-invalidation and self-downgrade have recently seen increased popularity due to their simplicity, potential performance efficiency, and low energy consumption. However, such protocols result in memory instruction reordering, thus causing extra program behaviors&nbsp;[&hellip;]
Published on January 16, 2018

  • < Previous
  • 1
  • Next >