Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2024
Verification under Intel-x86 with Persistency
Proceedings of the ACM on Programming Languages (PACMPL), Volume 8, Issue PLDIArticle No.: 195, Pages 1189–1212https://doi.org/10.1145/3656425The full semantics of the Intel-x86 architecture has been defined by Raad et al in POPL 2022, extending the earlier formalization based on the TSO memory model incorporating persistency. This new semantics involves an intricate combination of the SC, TSO,...
- ArticleApril 2024
Verification under TSO with an infinite Data Domain
Tools and Algorithms for the Construction and Analysis of SystemsApr 2024, Pages 276–295https://doi.org/10.1007/978-3-031-57256-2_14AbstractWe examine verification of concurrent programs under the total store ordering (TSO) semantics used by the x86 architecture. In our model, threads manipulate variables over infinite domains and they can check whether variables are related for a ...
- ArticleJanuary 2024
Boosting Constrained Horn Solving by Unsat Core Learning
Verification, Model Checking, and Abstract InterpretationJan 2024, Pages 280–302https://doi.org/10.1007/978-3-031-50524-9_13AbstractThe Relational Hyper-Graph Neural Network (R-HyGNN) was introduced in [1] to learn domain-specific knowledge from program verification problems encoded in Constrained Horn Clauses (CHCs). It exhibits high accuracy in predicting the occurrence of ...
- ArticleOctober 2023
Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs
- Parosh Aziz Abdulla,
- Mohamed Faouzi Atig,
- Frederik Meyer Bønneland,
- Sarbojit Das,
- Bengt Jonsson,
- Magnus Lång,
- Konstantinos Sagonas
Automated Technology for Verification and AnalysisOct 2023, Pages 176–198https://doi.org/10.1007/978-3-031-45332-8_9AbstractEvent-driven multi-threaded programming is an important idiom for structuring concurrent computations. Stateless Model Checking (SMC) is an effective verification technique for multi-threaded programs, especially when coupled with Dynamic Partial ...
- ArticleJuly 2023
Overcoming Memory Weakness with Unified Fairness: Systematic Verification of Liveness in Weak Memory Models
AbstractWe consider the verification of liveness properties for concurrent programs running on weak memory models. To that end, we identify notions of fairness that preclude demonic non-determinism, are motivated by practical observations, and are ...
-
Optimal Reads-From Consistency Checking for C11-Style Memory Models
- Hünkar Can Tunç,
- Parosh Aziz Abdulla,
- Soham Chakraborty,
- Shankaranarayanan Krishna,
- Umang Mathur,
- Andreas Pavlogiannis
Proceedings of the ACM on Programming Languages (PACMPL), Volume 7, Issue PLDIArticle No.: 137, Pages 761–785https://doi.org/10.1145/3591251Over the years, several memory models have been proposed to capture the subtle concurrency semantics of C/C++. One of the most fundamental problems associated with a memory model M is consistency checking: given an execution X, is X consistent with M? ...
- ArticleApril 2023
Parameterized Verification under TSO with Data Types
- Parosh Aziz Abdulla,
- Mohamad Faouzi Atig,
- Florian Furbach,
- Adwait A. Godbole,
- Yacoub G. Hendi,
- Shankara N. Krishna,
- Stephan Spengler
Tools and Algorithms for the Construction and Analysis of SystemsApr 2023, Pages 588–606https://doi.org/10.1007/978-3-031-30823-9_30AbstractWe consider parameterized verification of systems executing according to the total store ordering (TSO) semantics. The processes manipulate abstract data types over potentially infinite domains. We present a framework that translates the ...
- ArticleMay 2022
Verifying Reachability for TSO Programs with Dynamic Thread Creation
AbstractThe verification of reachability properties for programs under weak memory models is a hard problem, even undecidable in some cases. The decidability of this problem has been investigated so far in the case of static programs where the number of ...
- ArticleApril 2022
Probabilistic Total Store Ordering
Programming Languages and SystemsApr 2022, Pages 317–345https://doi.org/10.1007/978-3-030-99336-8_12AbstractWe present Probabilistic Total Store Ordering (PTSO) – a probabilistic extension of the classical TSO semantics. For a given (finite-state) program, the operational semantics of PTSO induces an infinite-state Markov chain. We resolve the inherent ...
- ArticleOctober 2021
Solving Not-Substring Constraint withFlat Abstraction
- Parosh Aziz Abdulla,
- Mohamed Faouzi Atig,
- Yu-Fang Chen,
- Bui Phi Diep,
- Lukáš Holík,
- Denghang Hu,
- Wei-Lun Tsai,
- Zhillin Wu,
- Di-De Yen
Programming Languages and SystemsOct 2021, Pages 305–320https://doi.org/10.1007/978-3-030-89051-3_17AbstractNot-substring is currently among the least supported types of string constraints, and existing solvers use only relatively crude heuristics. Yet, not-substring occurs relatively often in practical examples and is useful in encoding other types of ...
- correctionOctober 2021
Correction to: An integrated specification and verification technique for highly concurrent data structures
International Journal on Software Tools for Technology Transfer (STTT) (STTT), Volume 23, Issue 5Oct 2021, Page 825https://doi.org/10.1007/s10009-021-00629-9A correction to this paper has been published: https://doi.org/10.1007/s10009-021-00629-9
- ArticleMarch 2021
The Decidability of Verification under PS 2.0
AbstractWe consider the reachability problem for finite-state multi-threaded programs under the promising semantics (PS 2.0) of Lee et al., which captures most common program transformations. Since reachability is already known to be undecidable in the ...
- research-articleJanuary 2021
Deciding reachability under persistent x86-TSO
Proceedings of the ACM on Programming Languages (PACMPL), Volume 5, Issue POPLArticle No.: 56, Pages 1–32https://doi.org/10.1145/3434337We address the problem of verifying the reachability problem in programs running under the formal model Px86 defined recently by Raad et al. in POPL'20 for the persistent Intel x86 architecture. We prove that this problem is decidable. To achieve that, ...
- research-articleJune 2020
Efficient handling of string-number conversion
- Parosh Aziz Abdulla,
- Mohamed Faouzi Atig,
- Yu-Fang Chen,
- Bui Phi Diep,
- Julian Dolby,
- Petr Janků,
- Hsin-Hung Lin,
- Lukáš Holík,
- Wei-Cheng Wu
PLDI 2020: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2020, Pages 943–957https://doi.org/10.1145/3385412.3386034String-number conversion is an important class of constraints needed for the symbolic execution of string-manipulating programs. In particular solving string constraints with string-number conversion is necessary for the analysis of scripting languages ...
- ArticleJune 2020
On the State Reachability Problem for Concurrent Programs Under Power
- Parosh Aziz Abdulla,
- Mohamed Faouzi Atig,
- Ahmed Bouajjani,
- Egor Derevenetc,
- Carl Leonardsson,
- Roland Meyer
AbstractWe consider the problem of safety verification, formalized as control-state reachability, for concurrent programs running on the Power architecture. Our main result shows that safety verification under Power is undecidable for programs with just ...
- research-articleDecember 2019
Parameterized verification under TSO is PSPACE-complete
Proceedings of the ACM on Programming Languages (PACMPL), Volume 4, Issue POPLArticle No.: 26, Pages 1–29https://doi.org/10.1145/3371094We consider parameterized verification of concurrent programs under the Total Store Order (TSO) semantics. A program consists of a set of processes that share a set of variables on which they can perform read and write operations. We show that the ...
- ArticleOctober 2019
Chain-Free String Constraints
Automated Technology for Verification and AnalysisOct 2019, Pages 277–293https://doi.org/10.1007/978-3-030-31784-3_16AbstractWe address the satisfiability problem for string constraints that combine relational constraints represented by transducers, word equations, and string length constraints. This problem is undecidable in general. Therefore, we propose a new ...
Optimal stateless model checking for reads-from equivalence under sequential consistency
- Parosh Aziz Abdulla,
- Mohamed Faouzi Atig,
- Bengt Jonsson,
- Magnus Lång,
- Tuan Phong Ngo,
- Konstantinos Sagonas
Proceedings of the ACM on Programming Languages (PACMPL), Volume 3, Issue OOPSLAArticle No.: 150, Pages 1–29https://doi.org/10.1145/3360576We present a new approach for stateless model checking (SMC) of multithreaded programs under Sequential Consistency (SC) semantics. To combat state-space explosion, SMC is often equipped with a partial-order reduction technique, which defines an ...
- research-articleJune 2019
Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding
PODS '19: Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsJune 2019, Pages 335–352https://doi.org/10.1145/3294052.3319705A prominent research direction of the database theory community is to develop techniques for verification of database-driven systems operating over relational and numerical data. Along this line, we lift the framework of database manipulating systems \...