Search

• < Previous
• 1
• Next >

---

Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads

Mohamed Faouzi Atig ; Ahmed Bouajjani ; Shaz Qadeer.

Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis explores all behaviors of a concurrent program up to some fixed number of context switches between threads. This&nbsp;[&hellip;]

---

A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes

Ahmed Bouajjani ; Cezara Dragoi ; Constantin Enea ; Yan Jurski ; Mihaela Sighireanu.

We propose a framework for reasoning about unbounded dynamic networks of infinite-state processes. We propose Constrained Petri Nets (CPN) as generic models for these networks. They can be seen as Petri nets where tokens (representing occurrences of processes) are colored by values over some&nbsp;[&hellip;]

---

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;]

---

Robustness Against Transactional Causal Consistency

Sidi Mohamed Beillahi ; Ahmed Bouajjani ; Constantin Enea.

Distributed storage systems and databases are widely used by various types of applications. Transactional access to these storage systems is an important abstraction allowing application programmers to consider blocks of actions (i.e., transactions) as executing atomically. For performance reasons,&nbsp;[&hellip;]

---