4 results
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 […]
Published on January 16, 2018
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 […]
Published on January 23, 2018
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 […]
Published on September 1, 2010
Richard M. Mayr ; Parosh Aziz Abdulla.
We consider priced timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints on the ages of tokens. Furthermore, our cost model assigns token storage costs per time unit to places, and firing […]
Published on November 12, 2013