Author image not provided
 Parosh Aziz Abdulla

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article11.79
Citation Count1,380
Publication count117
Publication years1992-2017
Available for download10
Average downloads per article118.40
Downloads (cumulative)1,184
Downloads (12 Months)474
Downloads (6 Weeks)61
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


117 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 117
Result page: 1 2 3 4 5 6

Sort by:

1
December 2017 Acta Informatica: Volume 54 Issue 8, December 2017
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We present a technique for efficient stateless model checking of programs that execute under the relaxed memory models TSO and PSO. The basis for our technique is a novel representation of executions under TSO and PSO, called chronological traces. Chronological traces induce a partial order relation on relaxed memory executions, ...

2
October 2017 International Journal on Software Tools for Technology Transfer (STTT): Volume 19 Issue 5, October 2017
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We present a technique for automatically verifying safety properties of concurrent programs, in particular programs that rely on subtle dependencies of local states of different threads, such as lock-free implementations of stacks and queues in an environment without garbage collection. Our technique addresses the joint challenges of infinite-state specifications, an ...
Keywords: Concurrency, Verification, Pointer programs, Unbounded, Linearizability, Queue, Specification, Explicit memory allocation, Stack

3 published by ACM
August 2017 Journal of the ACM (JACM): Volume 64 Issue 4, September 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 20,   Downloads (12 Months): 112,   Downloads (Overall): 112

Full text available: PDFPDF
Stateless model checking is a powerful method for program verification that, however, suffers from an exponential growth in the number of explored executions. A successful technique for reducing this number, while still maintaining complete coverage, is Dynamic Partial Order Reduction (DPOR), an algorithm originally introduced by Flanagan and Godefroid in ...
Keywords: wakeup trees, Dynamic partial order reduction, concurrency, software model checking, source sets, systematic testing

4 published by ACM
June 2017 PLDI 2017: Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 20,   Downloads (12 Months): 177,   Downloads (Overall): 177

Full text available: PDFPDF
We describe a uniform and efficient framework for checking the satisfiability of a large class of string constraints. The framework is based on the observation that both satisfiability and unsatisfiability of common constraints can be demonstrated through witnesses with simple patterns. These patterns are captured using flat automata each of ...
Keywords: Formal Verification, String Equation, Automata Theory
Also published in:
September 2017  ACM SIGPLAN Notices - PLDI '17: Volume 52 Issue 6, June 2017

5
April 2017 Proceedings, Part II, of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 10206
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We propose an under-approximate reachability analysis algorithm for programs running under the POWER memory model, in the spirit of the work on context-bounded analysis intitiated by Qadeer et al. in 2005 for detecting bugs in concurrent programs supposed to be running under the classical SC model. To that end, we ...

6
October 2016 International Journal on Software Tools for Technology Transfer (STTT): Volume 18 Issue 5, October 2016
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

The goal of parameterized verification is to prove the correctness of a system specification regardless of the number of its components. The problem is of interest in several different areas: verification of hardware design, multithreaded programs, distributed systems, and communication protocols. The problem is undecidable in general. Solutions for restricted ...
Keywords: Formal verification, Program analysis, Concurrent and distributed systems

7
October 2016 International Journal on Software Tools for Technology Transfer (STTT): Volume 18 Issue 5, October 2016
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

We present a simple and efficient framework for automatic verification of systems with a parametric number of communicating processes. The processes may be organized in various topologies such as words, multisets, rings, or trees. Our method needs to inspect only a small number of processes in order to show correctness ...
Keywords: Safety, Parameterized systems, Small model properties, View abstraction

8 published by ACM
July 2016 LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 5,   Downloads (12 Months): 26,   Downloads (Overall): 41

Full text available: PDFPDF
We extend the classical model of lossy channel systems by considering systems that operate on a finite set of variables ranging over an infinite data domain. Furthermore, each message inside a channel is equipped with a data item representing its value. Although we restrict the model by allowing the variables ...
Keywords: Lossy Channel Systems, Reachability Problem

9 published by ACM
June 2016 PODS '16: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 29,   Downloads (Overall): 85

Full text available: PDFPDF
We propose a formalism to model database-driven systems, called database manipulating systems (DMS). The actions of a (DMS) modify the current instance of a relational database by adding new elements into the database, deleting tuples from the relations and adding tuples to the relations. The elements which are modified by ...
Keywords: database driven dynamic systems, formal verification, model checking, relational transition systems, data-aware dynamic systems, monadic second order logic, recency boundedness, nested words, under-approximation

10
June 2016 36th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems - Volume 9688
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Cache coherence protocols using 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 that are often not intended by the programmer. We propose a novel formal model ...

11
June 2016 Acta Informatica: Volume 53 Issue 4, June 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We present a general framework for verifying programs with complex dynamic linked data structures whose correctness depends on ordering relations between stored data values. The underlying formalism of our framework is that of forest automata (FA), which has previously been developed for verification of heap-manipulating programs. We extend FA with ...

12
September 2015 FMCAD '15: Proceedings of the 15th Conference on Formal Methods in Computer-Aided Design
Publisher: FMCAD Inc
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 4,   Downloads (Overall): 8

Full text available: PDFPDF
We address the problem of parameterized verification of cache coherence protocols for hardware accelerated transactional memories. In this setting, transactional memories leverage on the versioning capabilities of the underlying cache coherence protocol. The length of the transactions, their number, and the number of manipulated variables (i.e., cache lines) are parameters ...

13
April 2015 Proceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 9035
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 3

We present a technique for efficient stateless model checking of programs that execute under the relaxed memory models TSO and PSO. The basis for our technique is a novel representation of executions under TSO and PSO, called chronological traces . Chronological traces induce a partial order relation on relaxed memory ...

14
April 2015 Proceedings of the 24th European Symposium on Programming on Programming Languages and Systems - Volume 9032
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 3

We present a method for automatic fence insertion in concurrent programs running under weak memory models that provides the best known trade-off between efficiency and optimality. On the one hand, the method can efficiently handle complex aspects of program behaviors such as unbounded buffers and large numbers of processes. On ...

15
October 2014 Formal Methods in System Design: Volume 45 Issue 2, October 2014
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

We address the verification problem for concurrent programs modeled as multi-pushdown systems (MPDS). In general, MPDS are Turing powerful and hence come along with undecidability of all basic decision problems. Because of this, several subclasses of MPDS have been proposed and studied in the literature (Atig et al. in LNCS, ...
Keywords: Reachability problem, Recursive programs, LTL-model-checking, Verification problems, Concurrent pushdown systems

16
July 2014 Proceedings of the 16th International Conference on Computer Aided Verification - Volume 8559
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 5

We present a decision procedure for a logic that combines (i)äword equations over string variables denoting words of arbitrary lengths, together with (ii)äconstraints on the length of words, and on (iii)äthe regular languages to which words belong. Decidability of this general logic is still open. Our procedure is sound for ...

17 published by ACM
July 2014 CSL-LICS '14: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 0,   Downloads (12 Months): 16,   Downloads (Overall): 94

Full text available: PDFPDF
Energy games are a well-studied class of 2-player turn-based games on a finite graph where transitions are labeled with integer vectors which represent changes in a multidimensional resource (the energy). One player tries to keep the cumulative changes non-negative in every component while the other tries to frustrate this. We ...
Keywords: energy games, automata theory

18
March 2014 LATA 2014: Proceedings of the 8th International Conference on Language and Automata Theory and Applications - Volume 8370
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We study priced dense-timed pushdown automata that are a generalization of the classic model of pushdown automata, in the sense that they operate on real-valued clocks, and that the stack symbols have real-valued ages. Furthermore, the model allows a cost function that assigns transition costs to transitions and storage costs ...

19 published by ACM
January 2014 POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Publisher: ACM
Bibliometrics:
Citation Count: 25
Downloads (6 Weeks): 4,   Downloads (12 Months): 80,   Downloads (Overall): 387

Full text available: PDFPDF
Stateless model checking is a powerful technique for program verification, which however suffers from an exponential growth in the number of explored executions. A successful technique for reducing this number, while still maintaining complete coverage, is Dynamic Partial Order Reduction (DPOR). We present a new DPOR algorithm, which is the ...
Keywords: dynamic partial oder reduction, wakeup trees, concurrency, software model checking, source sets, systematic testing
Also published in:
January 2014  ACM SIGPLAN Notices - POPL '14: Volume 49 Issue 1, January 2014

20
August 2013 CONCUR'13: Proceedings of the 24th international conference on Concurrency Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5

We consider parity games on infinite graphs where configurations are represented by control-states and integer vectors. This framework subsumes two classic game problems: parity games on vector addition systems with states (vass) and multidimensional energy parity games. We show that the multidimensional energy parity game problem is inter-reducible with a ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us