Change search
Link to record
Permanent link

Direct link
BETA
Abdulla, Parosh, Professor
Alternative names
Publications (10 of 132) Show all publications
Abdulla, P. A., Atig, M. F., Bouajjani, A. & Ngo, T. P. (2018). A load-buffer semantics for total store ordering. Logical Methods in Computer Science, 14(1), Article ID 9.
Open this publication in new window or tab >>A load-buffer semantics for total store ordering
2018 (English)In: Logical Methods in Computer Science, ISSN 1860-5974, E-ISSN 1860-5974, Vol. 14, no 1, article id 9Article in journal (Refereed) Published
Abstract [en]

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 fixed. However, it is important in general to prove the correctness of a system/algorithm in a parametric way with an arbitrarily large number of processes. 

In this paper, we introduce an alternative (yet equivalent) semantics to the classical one for the TSO semantics that is more amenable to efficient algorithmic verification and for the extension to parametric verification. For that, we adopt a dual view where load buffers are used instead of store buffers. The flow of information is now from the memory to load buffers. We show that this new semantics allows (1) to simplify drastically the safety analysis under TSO, (2) to obtain a spectacular gain in efficiency and scalability compared to existing procedures, and (3) to extend easily the decision procedure to the parametric case, which allows obtaining a new decidability result, and more importantly, a verification algorithm that is more general and more efficient in practice than the one for bounded instances.

Keywords
Verification, TSO, concurrent program, safety property, well-structured transition system
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:uu:diva-337278 (URN)000426512000008 ()
Projects
UPMARC
Available from: 2018-01-23 Created: 2017-12-21 Last updated: 2018-11-21
Abdulla, P. A., Aiswarya, C., Atig, M. F., Montali, M. & Rezine, O. (2018). Complexity of reachability for data-aware dynamic systems. In: Proc. 18th International Conference on Application of Concurrency to System Design: . Paper presented at ACSD 2018, June 24–29, Bratislava, Slovakia (pp. 11-20). IEEE Computer Society
Open this publication in new window or tab >>Complexity of reachability for data-aware dynamic systems
Show others...
2018 (English)In: Proc. 18th International Conference on Application of Concurrency to System Design, IEEE Computer Society, 2018, p. 11-20Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
IEEE Computer Society, 2018
National Category
Computer Sciences
Identifiers
urn:nbn:se:uu:diva-367961 (URN)10.1109/ACSD.2018.000-3 (DOI)978-1-5386-7013-2 (ISBN)
Conference
ACSD 2018, June 24–29, Bratislava, Slovakia
Available from: 2018-11-30 Created: 2018-11-30 Last updated: 2018-12-07Bibliographically approved
Abdulla, P. A., Jonsson, B. & Trinh, C. Q. (2018). Fragment abstraction for concurrent shape analysis. In: Programming Languages and Systems: . Paper presented at ESOP 2018 (pp. 442-471). Springer
Open this publication in new window or tab >>Fragment abstraction for concurrent shape analysis
2018 (English)In: Programming Languages and Systems, Springer, 2018, p. 442-471Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Springer, 2018
Series
Lecture Notes in Computer Science ; 10801
National Category
Computer Sciences
Identifiers
urn:nbn:se:uu:diva-368505 (URN)10.1007/978-3-319-89884-1_16 (DOI)978-3-319-89883-4 (ISBN)
Conference
ESOP 2018
Projects
UPMARC
Available from: 2018-04-14 Created: 2018-12-05 Last updated: 2018-12-07Bibliographically approved
Abdulla, P. A., Atig, M. F., Kaxiras, S., Leonardsson, C., Ros, A. & Zhu, Y. (2018). Mending fences with self-invalidation and self-downgrade. Logical Methods in Computer Science, 14(1), Article ID 6.
Open this publication in new window or tab >>Mending fences with self-invalidation and self-downgrade
Show others...
2018 (English)In: Logical Methods in Computer Science, ISSN 1860-5974, E-ISSN 1860-5974, Vol. 14, no 1, article id 6Article in journal (Refereed) Published
National Category
Computer Sciences
Identifiers
urn:nbn:se:uu:diva-347675 (URN)000426512000004 ()
Available from: 2018-01-16 Created: 2018-04-06 Last updated: 2018-05-17Bibliographically approved
Abdulla, P. A., Sistla, A. P. & Talupur, M. (2018). Model checking parameterized systems. In: Handbook of Model Checking: (pp. 685-725). Springer
Open this publication in new window or tab >>Model checking parameterized systems
2018 (English)In: Handbook of Model Checking, Springer, 2018, p. 685-725Chapter in book (Refereed)
Place, publisher, year, edition, pages
Springer, 2018
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:uu:diva-368568 (URN)10.1007/978-3-319-10575-8_21 (DOI)978-3-319-10574-1 (ISBN)
Available from: 2018-05-19 Created: 2018-12-05 Last updated: 2018-12-07Bibliographically approved
Ngo, T.-P., Abdulla, P., Jonsson, B. & Atig, M. F. (2018). Optimal Stateless Model Checking under the Release-Acquire Semantics. In: SPLASH OOPSLA 2018, Boston, Nov 4-9, 2018: . Paper presented at SPLASH OOPSLA 2018. ACM Digital Library
Open this publication in new window or tab >>Optimal Stateless Model Checking under the Release-Acquire Semantics
2018 (English)In: SPLASH OOPSLA 2018, Boston, Nov 4-9, 2018, ACM Digital Library, 2018Conference paper, Published paper (Refereed)
Abstract [en]

We present a framework for efficient application of stateless model checking (SMC) to concurrent programs running under the Release-Acquire (RA) fragment of the C/C++11 memory model. Our approach is based on exploring the possible program orders, which define the order in which instructions of a thread are executed, and read-from relations, which define how reads obtain their values from writes. This is in contrast to previous approaches, which in addition explore the possible coherence orders, i.e., orderings between conflicting writes. Since unexpected test results such as program crashes or assertion violations depend only on the read-from relation, we avoid a potentially large source of redundancy. Our framework is based on a novel technique for determining whether a particular read-from relation is feasible under the RA semantics. We define an SMC algorithm which is provably optimal in the sense that it explores each program order and read-from relation exactly once. This optimality result is strictly stronger than previous analogous optimality results, which also take coherence order into account. We have implemented our framework in the tool Tracer. Experiments show that Tracer can be significantly faster than state-of-the-art tools that can handle the RA semantics.

Place, publisher, year, edition, pages
ACM Digital Library, 2018
Keywords
Software model checking, C/C++11, Release-Acquire, Concurrent program
National Category
Computer Systems
Research subject
Computer Science
Identifiers
urn:nbn:se:uu:diva-358241 (URN)
Conference
SPLASH OOPSLA 2018
Projects
UPMARC
Available from: 2018-08-26 Created: 2018-08-26 Last updated: 2018-11-21
Abdulla, P. A., Atig, M. F. & Krishna, S. N. (2018). Perfect timed communication is hard. In: Formal Modeling and Analysis of Timed Systems: . Paper presented at FORMATS 2018, September 4–6, Beijing, China (pp. 91-107). Springer
Open this publication in new window or tab >>Perfect timed communication is hard
2018 (English)In: Formal Modeling and Analysis of Timed Systems, Springer, 2018, p. 91-107Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Springer, 2018
Series
Lecture Notes in Computer Science ; 11022
National Category
Computer Sciences
Identifiers
urn:nbn:se:uu:diva-367964 (URN)10.1007/978-3-030-00151-3_6 (DOI)978-3-030-00150-6 (ISBN)
Conference
FORMATS 2018, September 4–6, Beijing, China
Projects
UPMARC
Available from: 2018-08-26 Created: 2018-11-30 Last updated: 2018-12-07Bibliographically approved
Abdulla, P. A., Atig, M. F., Bouajjani, A. & Ngo, T. P. (2018). Replacing store buffers by load buffers in TSO. In: Verification and Evaluation of Computer and Communication Systems: . Paper presented at VECoS 2018, September 26–28, Grenoble, France (pp. 22-28). Springer
Open this publication in new window or tab >>Replacing store buffers by load buffers in TSO
2018 (English)In: Verification and Evaluation of Computer and Communication Systems, Springer, 2018, p. 22-28Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Springer, 2018
Series
Lecture Notes in Computer Science ; 11181
National Category
Computer Systems
Identifiers
urn:nbn:se:uu:diva-366357 (URN)10.1007/978-3-030-00359-3_2 (DOI)978-3-030-00358-6 (ISBN)
Conference
VECoS 2018, September 26–28, Grenoble, France
Projects
UPMARC
Available from: 2018-08-31 Created: 2018-11-20 Last updated: 2018-12-07Bibliographically approved
Abdulla, P. A., Atig, M. F., Chen, Y.-F., Bui, P. D., Holik, L., Rezine, A. & Rümmer, P. (2018). Trau: SMT solver for string constraints. In: The eighteenth in a series of conferences on the theory and applications of formal methods in hardware and system verification (FMCAD 2018): . Paper presented at FMCAD 2018.
Open this publication in new window or tab >>Trau: SMT solver for string constraints
Show others...
2018 (English)In: The eighteenth in a series of conferences on the theory and applications of formal methods in hardware and system verification (FMCAD 2018), 2018Conference paper, Published paper (Refereed)
National Category
Computer Sciences
Identifiers
urn:nbn:se:uu:diva-367967 (URN)978-0-9835678-8-2 (ISBN)
Conference
FMCAD 2018
Available from: 2018-11-30 Created: 2018-11-30 Last updated: 2018-12-07
Abdulla, P. A., Atig, M. F., Ciobanu, R., Mayr, R. & Totzke, P. (2018). Universal safety for timed Petri nets is PSPACE-complete. In: 29th International Conference on Concurrency Theory: . Paper presented at CONCUR 2018 (pp. 6:1-15). Dagstuhl, Germany: Leibniz-Zentrum für Informatik
Open this publication in new window or tab >>Universal safety for timed Petri nets is PSPACE-complete
Show others...
2018 (English)In: 29th International Conference on Concurrency Theory, Dagstuhl, Germany: Leibniz-Zentrum für Informatik , 2018, p. 6:1-15Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Dagstuhl, Germany: Leibniz-Zentrum für Informatik, 2018
Series
Leibniz International Proceedings in Informatics ; 118
National Category
Computer Sciences
Identifiers
urn:nbn:se:uu:diva-367962 (URN)10.4230/LIPIcs.CONCUR.2018.6 (DOI)978-3-95977-087-3 (ISBN)
Conference
CONCUR 2018
Available from: 2018-11-30 Created: 2018-11-30 Last updated: 2018-12-07Bibliographically approved
Organisations

Search in DiVA

Show all publications