default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDParosh Aziz Abdulla
Person information
- affiliation: Uppsala University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j51]Parosh Aziz Abdulla
, Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Verification under Intel-x86 with Persistency. Proc. ACM Program. Lang. 8(PLDI): 1189-1212 (2024)- [c155]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Adwait Godbole, Shankara Narayanan Krishna, Mihir Vahanwala:
Fairness and Liveness Under Weak Consistency. Taming the Infinities of Concurrency 2024: 1-21 - [c154]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Sarbojit Das, Bengt Jonsson, Konstantinos Sagonas:
Parsimonious Optimal Dynamic Partial Order Reduction. CAV (2) 2024: 19-43 - [c153]Daniel Stan, Muhammad Najib, Anthony Widjaja Lin, Parosh Aziz Abdulla:
Concurrent Stochastic Lossy Channel Games. CSL 2024: 46:1-46:19 - [c152]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Florian Furbach, Shashwat Garg:
Verification under TSO with an infinite Data Domain. TACAS (3) 2024: 276-295 - [c151]Parosh Aziz Abdulla, Chencheng Liang, Philipp Rümmer:
Boosting Constrained Horn Solving by Unsat Core Learning. VMCAI (1) 2024: 280-302 - [i33]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Florian Furbach, Shashwat Garg:
Verification under TSO with an infinite Data Domain. CoRR abs/2401.10423 (2024) - [i32]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Sarbojit Das, Bengt Jonsson, Konstantinos Sagonas:
Parsimonious Optimal Dynamic Partial Order Reduction. CoRR abs/2405.11128 (2024) - 2023
- [j50]Hünkar Can Tunç, Parosh Aziz Abdulla, Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis:
Optimal Reads-From Consistency Checking for C11-Style Memory Models. Proc. ACM Program. Lang. 7(PLDI): 761-785 (2023) - [c150]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Frederik Meyer Bønneland, Sarbojit Das, Bengt Jonsson, Magnus Lång, Konstantinos Sagonas:
Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs. ATVA 2023: 176-198 - [c149]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Adwait Godbole, Shankaranarayanan Krishna, Mihir Vahanwala:
Overcoming Memory Weakness with Unified Fairness - Systematic Verification of Liveness in Weak Memory Models. CAV (1) 2023: 184-205 - [c148]Parosh Aziz Abdulla, Mohamed Faouzi Atig, S. Krishna, Ashutosh Gupta, Omkar Tuppe:
Optimal Stateless Model Checking for Causal Consistency. TACAS (1) 2023: 105-125 - [c147]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Florian Furbach, Adwait Amit Godbole, Yacoub G. Hendi, Shankara Narayanan Krishna, Stephan Spengler:
Parameterized Verification under TSO with Data Types. TACAS (1) 2023: 588-606 - [d3]Hünkar Can Tunç, Parosh Aziz Abdulla, Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis:
Optimal Reads-From Consistency Checking for C11-Style Memory Models. Zenodo, 2023
- [d2]Hünkar Can Tunç, Parosh Aziz Abdulla, Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis:
Optimal Reads-From Consistency Checking for C11-Style Memory Models. Zenodo, 2023 - [i31]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Florian Furbach, Adwait Godbole, Yacoub G. Hendi, Shankaranarayanan Krishna, Stephan Spengler:
Parameterized Verification under TSO with Data Types. CoRR abs/2302.02163 (2023) - [i30]Parosh Aziz Abdulla, Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç:
Optimal Reads-From Consistency Checking for C11-Style Memory Models. CoRR abs/2304.03714 (2023) - [i29]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Adwait Godbole, Shankaranarayanan Krishna, Mihir Vahanwala:
Overcoming Memory Weakness with Unified Fairness. CoRR abs/2305.17605 (2023) - [i28]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bui Phi Diep, Lukás Holík, Petr Janku:
Chain-Free String Constraints (Technical Report). CoRR abs/2307.03970 (2023) - [i27]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Frederik Meyer Bønneland, Sarbojit Das, Bengt Jonsson, Magnus Lång, Konstantinos Sagonas:
Tailoring Stateless Model Checking for Event-Driven Multi-Threaded Programs. CoRR abs/2307.15930 (2023) - [i26]Daniel Stan, Muhammad Najib, Anthony Widjaja Lin, Parosh Aziz Abdulla:
Concurrent Stochastic Lossy Channel Games. CoRR abs/2311.17037 (2023) - 2022
- [c146]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Bengt Jonsson, K. Narayan Kumar, Prakash Saivasan:
Consistency and Persistency in Program Verification: Challenges and Opportunities. Principles of Systems Design 2022: 494-510 - [c145]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Raj Aryan Agarwal, Adwait Godbole, S. Krishna:
Probabilistic Total Store Ordering. ESOP 2022: 317-345 - [c144]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Verifying Reachability for TSO Programs with Dynamic Thread Creation. NETYS 2022: 283-300 - [i25]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Raj Aryan Agarwal, Adwait Godbole, S. Krishna:
Probabilistic Total Store Ordering. CoRR abs/2201.10213 (2022) - [i24]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ashutosh Gupta, Shankaranarayanan Krishna, Omkar Tuppe:
Optimal SMC for Transactional Programs. CoRR abs/2211.09020 (2022) - 2021
- [j49]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Deciding reachability under persistent x86-TSO. Proc. ACM Program. Lang. 5(POPL): 1-32 (2021) - [j48]Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, Ahmed Rezine:
Correction to: An integrated specification and verification technique for highly concurrent data structures. Int. J. Softw. Tools Technol. Transf. 23(5): 825 (2021) - [c143]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík, Denghang Hu, Wei-Lun Tsai, Zhilin Wu, Di-De Yen:
Solving Not-Substring Constraint withFlat Abstraction. APLAS 2021: 305-320 - [c142]Parosh Aziz Abdulla:
Regular Model Checking: Evolution and Perspectives. Model Checking, Synthesis, and Learning 2021: 78-96 - [c141]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Adwait Godbole, S. Krishna, Viktor Vafeiadis:
The Decidability of Verification under PS 2.0. ESOP 2021: 1-29 - 2020
- [j47]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Rojin Rezvan:
Parameterized verification under TSO is PSPACE-complete. Proc. ACM Program. Lang. 4(POPL): 26:1-26:29 (2020) - [c140]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Vrunda Dave, Shankara Narayanan Krishna:
On the Separability Problem of String Constraints. CONCUR 2020: 16:1-16:19 - [c139]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Egor Derevenetc, Carl Leonardsson, Roland Meyer:
On the State Reachability Problem for Concurrent Programs Under Power. NETYS 2020: 47-59 - [c138]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Giorgio Delzanno, Marco Montali, Arnaud Sangnier:
On the Formalization of Decentralized Contact Tracing Protocols. OVERLAY 2020: 65-70 - [c137]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Julian Dolby, Petr Janku, Hsin-Hung Lin, Lukás Holík, Wei-Cheng Wu:
Efficient handling of string-number conversion. PLDI 2020: 943-957 - [i23]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Vrunda Dave, Shankara Narayanan Krishna:
On the Separability Problem of String Constraints. CoRR abs/2005.09489 (2020) - [i22]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Adwait Godbole, Shankaranarayanan Krishna, Viktor Vafeiadis:
The Decidability of Verification under Promising 2.0. CoRR abs/2007.09944 (2020)
2010 – 2019
- 2019
- [j46]Parosh Aziz Abdulla, Carole Delporte:
Special Issue on NETYS'2016. Computing 101(1): 1-2 (2019) - [j45]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Magnus Lång, Tuan Phong Ngo, Konstantinos Sagonas:
Optimal stateless model checking for reads-from equivalence under sequential consistency. Proc. ACM Program. Lang. 3(OOPSLA): 150:1-150:29 (2019) - [c136]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bui Phi Diep, Lukás Holík, Petr Janku:
Chain-Free String Constraints. ATVA 2019: 277-293 - [c135]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Tuan Phong Ngo:
Dynamic Partial Order Reduction Under the Release-Acquire Semantics (Tutorial). NETYS 2019: 3-18 - [c134]Parosh Aziz Abdulla, Jatin Arora, Mohamed Faouzi Atig, Shankara Narayanan Krishna:
Verification of programs under the release-acquire semantics. PLDI 2019: 1117-1132 - [c133]Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig, Marco Montali:
Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding. PODS 2019: 335-352 - [d1]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Magnus Lång, Tuan Phong Ngo, Konstantinos Sagonas:
Optimal Stateless Model Checking for Reads-From Equivalence under Sequential Consistency. Zenodo, 2019 - 2018
- [j44]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Tuan Phong Ngo:
A Load-Buffer Semantics for Total Store Ordering. Log. Methods Comput. Sci. 14(1) (2018) - [j43]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Stefanos Kaxiras, Carl Leonardsson, Alberto Ros, Yunyun Zhu:
Mending Fences with Self-Invalidation and Self-Downgrade. Log. Methods Comput. Sci. 14(1) (2018) - [j42]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Tuan Phong Ngo:
Optimal stateless model checking under the release-acquire semantics. Proc. ACM Program. Lang. 2(OOPSLA): 135:1-135:29 (2018) - [c132]Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig, Marco Montali, Othmane Rezine:
Complexity of Reachability for Data-Aware Dynamic Systems. ACSD 2018: 11-20 - [c131]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke:
Universal Safety for Timed Petri Nets is PSPACE-complete. CONCUR 2018: 6:1-6:15 - [c130]Parosh Aziz Abdulla, Bengt Jonsson, Cong Quy Trinh:
Fragment Abstraction for Concurrent Shape Analysis. ESOP 2018: 442-471 - [c129]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík, Ahmed Rezine, Philipp Rümmer:
Trau: SMT solver for string constraints. FMCAD 2018: 1-5 - [c128]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Shankara Narayanan Krishna:
Perfect Timed Communication Is Hard. FORMATS 2018: 91-107 - [c127]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Shankara Narayanan Krishna, Shaan Vaidya:
Verification of Timed Asynchronous Programs. FSTTCS 2018: 8:1-8:16 - [c126]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Tuan Phong Ngo:
Replacing Store Buffers by Load Buffers in TSO. VECoS 2018: 22-28 - [p1]Parosh Aziz Abdulla, A. Prasad Sistla, Muralidhar Talupur:
Model Checking Parameterized Systems. Handbook of Model Checking 2018: 685-725 - [i21]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke:
Universal Safety for Timed Petri Nets is PSPACE-complete. CoRR abs/1806.08170 (2018) - [i20]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Tuan Phong Ngo:
Optimal Stateless Model Checking under the Release-Acquire Semantics. CoRR abs/1808.00843 (2018) - 2017
- [j41]Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, Konstantinos Sagonas:
Stateless model checking for TSO and PSO. Acta Informatica 54(8): 789-818 (2017) - [j40]Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson, Konstantinos Sagonas:
Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction. J. ACM 64(4): 25:1-25:49 (2017) - [j39]Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, Ahmed Rezine:
An integrated specification and verification technique for highly concurrent data structures. Int. J. Softw. Tools Technol. Transf. 19(5): 549-563 (2017) - [c125]Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson, Konstantinos Sagonas:
Comparing Source Sets and Persistent Sets for Partial Order Reduction. Models, Algorithms, Logics and Tools 2017: 516-536 - [c124]Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig:
Data Multi-Pushdown Automata. CONCUR 2017: 38:1-38:17 - [c123]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík, Ahmed Rezine, Philipp Rümmer:
Flatten and conquer: a framework for efficient analysis of string constraints. PLDI 2017: 602-617 - [c122]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Tuan Phong Ngo:
Context-Bounded Analysis for POWER. TACAS (2) 2017: 56-74 - [i19]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Tuan Phong Ngo:
The Benefits of Duality in Verifying Concurrent Programs under TSO. CoRR abs/1701.08682 (2017) - [i18]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Tuan Phong Ngo:
Context-Bounded Analysis for POWER. CoRR abs/1702.01655 (2017) - [i17]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Shankara Narayanan Krishna:
What is Decidable about Perfect Timed Channels? CoRR abs/1708.05063 (2017) - 2016
- [j38]Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar:
Verification of heap manipulating programs with ordered data by extended forest automata. Acta Informatica 53(4): 357-385 (2016) - [j37]Parosh Aziz Abdulla, Stéphane Demri, Alain Finkel, Jérôme Leroux, Igor Potapov:
Preface. Fundam. Informaticae 143(3-4): i-ii (2016) - [j36]Parosh Aziz Abdulla, Giorgio Delzanno:
Parameterized verification. Int. J. Softw. Tools Technol. Transf. 18(5): 469-473 (2016) - [j35]Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík:
Parameterized verification through view abstraction. Int. J. Softw. Tools Technol. Transf. 18(5): 495-516 (2016) - [j34]Parosh Aziz Abdulla, Giorgio Delzanno, Othmane Rezine, Arnaud Sangnier, Riccardo Traverso:
Parameterized verification of time-sensitive models of ad hoc network protocols. Theor. Comput. Sci. 612: 1-22 (2016) - [c121]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson:
Stateless Model Checking for POWER. CAV (2) 2016: 134-156 - [c120]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Tuan Phong Ngo:
The Benefits of Duality in Verifying Concurrent Programs under TSO. CONCUR 2016: 5:1-5:15 - [c119]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bui Phi Diep:
Counter-Example Guided Program Verification. FM 2016: 25-42 - [c118]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Stefanos Kaxiras, Carl Leonardsson, Alberto Ros, Yunyun Zhu:
Fencing Programs with Self-Invalidation and Self-Downgrade. FORTE 2016: 19-35 - [c117]Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston:
Qualitative Analysis of VASS-Induced MDPs. FoSSaCS 2016: 319-334 - [c116]Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig:
Data Communicating Processes with Unreliable Channels. LICS 2016: 166-175 - [c115]Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig, Marco Montali, Othmane Rezine:
Recency-Bounded Verification of Dynamic Database-Driven Systems. PODS 2016: 195-210 - [c114]Parosh Aziz Abdulla, Bengt Jonsson, Cong Quy Trinh:
Automated Verification of Linearization Policies. SAS 2016: 61-83 - [e4]Parosh Aziz Abdulla, Carole Delporte-Gallet:
Networked Systems - 4th International Conference, NETYS 2016, Marrakech, Morocco, May 18-20, 2016, Revised Selected Papers. Lecture Notes in Computer Science 9944, Springer 2016, ISBN 978-3-319-46139-7 [contents] - [i16]Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig, Marco Montali, Othmane Rezine:
Recency-Bounded Verification of Dynamic Database-Driven Systems (Extended Version). CoRR abs/1604.03413 (2016) - [i15]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson:
Stateless Model Checking for POWER. CoRR abs/1605.02185 (2016) - [i14]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Stefanos Kaxiras, Carl Leonardsson, Alberto Ros, Yunyun Zhu:
Mending Fences with Self-Invalidation and Self-Downgrade. CoRR abs/1611.07372 (2016) - 2015
- [c113]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Lukás Holík, Ahmed Rezine, Philipp Rümmer, Jari Stenman:
Norn: An SMT Solver for String Constraints. CAV (1) 2015: 462-469 - [c112]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ngo Tuan Phong:
The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO. ESOP 2015: 308-332 - [c111]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Zeinab Ganjei, Ahmed Rezine, Yunyun Zhu:
Verification of Cache Coherence Protocols wrt. Trace Filters. FMCAD 2015: 9-16 - [c110]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Roland Meyer, Mehdi Seyed Salehi:
What's Decidable about Availability Languages?. FSTTCS 2015: 192-205 - [c109]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmet Kara, Othmane Rezine:
Verification of Buffered Dynamic Register Automata. NETYS 2015: 15-31 - [c108]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Magnus Lång, Tuan Phong Ngo:
Precise and Sound Automatic Fence Insertion Procedure under PSO. NETYS 2015: 32-47 - [c107]Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík:
View Abstraction - A Tutorial (Invited Paper). SynCoP 2015: 1-15 - [c106]Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, Konstantinos Sagonas:
Stateless Model Checking for TSO and PSO. TACAS 2015: 353-367 - [c105]Parosh Aziz Abdulla, Giorgio Delzanno, Marco Montali:
Well Structured Transition Systems with History. GandALF 2015: 115-128 - [i13]Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, Konstantinos Sagonas:
Stateless Model Checking for TSO and PSO. CoRR abs/1501.02069 (2015) - [i12]Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston:
Qualitative Analysis of VASS-Induced MDPs. CoRR abs/1512.08824 (2015) - [i11]Parosh Aziz Abdulla, Fabio Gadducci, Barbara König, Viktor Vafeiadis:
Verification of Evolving Graph Structures (Dagstuhl Seminar 15451). Dagstuhl Reports 5(11): 1-28 (2015) - 2014
- [j33]Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg:
Stochastic Parity Games on Lossy Channel Systems. Log. Methods Comput. Sci. 10(4) (2014) - [j32]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Othmane Rezine, Jari Stenman:
Budget-bounded model-checking pushdown systems. Formal Methods Syst. Des. 45(2): 273-301 (2014) - [j31]Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Tomás Vojnar:
Mediating for reduction (on minimizing alternating Büchi automata). Theor. Comput. Sci. 552: 26-43 (2014) - [c104]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Lukás Holík, Ahmed Rezine, Philipp Rümmer, Jari Stenman:
String Constraints for Verification. CAV 2014: 150-166 - [c103]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke:
Infinite-state energy games. CSL-LICS 2014: 7:1-7:10 - [c102]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jonathan Cederberg, Subham Modi, Othmane Rezine, Gaurav Saini:
MPass: An Efficient Tool for the Analysis of Message-Passing Programs. FACS 2014: 198-206 - [c101]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmet Kara, Othmane Rezine:
Verification of Dynamic Register Automata. FSTTCS 2014: 653-665 - [c100]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman:
Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata. LATA 2014: 62-75 - [c99]Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson, Konstantinos Sagonas:
Optimal dynamic partial order reduction. POPL 2014: 373-384 - [c98]Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík:
Block Me If You Can! - Context-Sensitive Parameterized Verification. SAS 2014: 1-17 - [i10]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke:
Infinite-State Energy Games. CoRR abs/1405.0628 (2014) - 2013
- [j30]Parosh Aziz Abdulla, Richard Mayr:
Priced Timed Petri Nets. Log. Methods Comput. Sci. 9(4) (2013) - [j29]Parosh Aziz Abdulla, Jonathan Cederberg, Tomás Vojnar:
Monotonic Abstraction for Programs with Multiply-Linked Structures. Int. J. Found. Comput. Sci. 24(2): 187-210 (2013) - [j28]Parosh Aziz Abdulla, K. Rustan M. Leino:
Tools for software verification - Introduction to the special section from the seventeenth international conference on tools and algorithms for the construction and analysis of systems. Int. J. Softw. Tools Technol. Transf. 15(2): 85-88 (2013) - [c97]Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar:
Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. ATVA 2013: 224-239 - [c96]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jonathan Cederberg:
Analysis of Message Passing Programs Using SMT-Solvers. ATVA 2013: 272-286 - [c95]Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston:
Solving Parity Games on Integer Vectors. CONCUR 2013: 106-120 - [c94]Parosh Aziz Abdulla, Sandhya Dwarkadas, Ahmed Rezine, Arrvindh Shriraman, Yunyun Zhu:
Verifying safety and liveness for the FlexTM hybrid transactional memory. DATE 2013: 785-790 - [c93]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Othmane Rezine:
Verification of Directed Acyclic Ad Hoc Networks. FMOODS/FORTE 2013: 193-208 - [c92]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Giorgio Delzanno, Andreas Podelski:
Push-Down Automata with Gap-Order Constraints. FSEN 2013: 199-216 - [c91]Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg:
Stochastic Parity Games on Lossy Channel Systems. QEST 2013: 338-354 - [c90]Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, Ahmed Rezine:
An Integrated Specification and Verification Technique for Highly Concurrent Data Structures. TACAS 2013: 324-338 - [c89]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Carl Leonardsson, Ahmed Rezine:
Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO. TACAS 2013: 530-536 - [c88]Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík:
All for the Price of Few. VMCAI 2013: 476-495 - [c87]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman:
Zenoness for Timed Pushdown Automata. INFINITY 2013: 35-47 - [e3]Parosh Aziz Abdulla, Igor Potapov:
Reachability Problems - 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings. Lecture Notes in Computer Science 8169, Springer 2013, ISBN 978-3-642-41035-2 [contents] - [i9]Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg:
Stochastic Parity Games on Lossy Channel Systems. CoRR abs/1305.5228 (2013) - [i8]Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston:
Solving Parity Games on Integer Vectors. CoRR abs/1306.2806 (2013) - 2012
- [j27]Parosh Aziz Abdulla:
Regular model checking. Int. J. Softw. Tools Technol. Transf. 14(2): 109-118 (2012) - [j26]Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, Mayank Saksena:
Regular model checking for LTL(MSO). Int. J. Softw. Tools Technol. Transf. 14(2): 223-241 (2012) - [c86]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Othmane Rezine, Jari Stenman:
Multi-pushdown systems with budgets. FMCAD 2012: 24-33 - [c85]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jonathan Cederberg:
Timed Lossy Channel Systems. FSTTCS 2012: 374-386 - [c84]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman:
The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems. LATA 2012: 58-69 - [c83]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman:
Dense-Timed Pushdown Automata. LICS 2012: 35-44 - [c82]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Carl Leonardsson, Ahmed Rezine:
Automatic Fence Insertion in Integer Programs via Predicate Abstraction. SAS 2012: 164-180 - [c81]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Carl Leonardsson, Ahmed Rezine:
Counter-Example Guided Fence Insertion under TSO. TACAS 2012: 204-219 - [c80]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman:
Adding Time to Pushdown Automata. QFM 2012: 1-16 - [c79]Parosh Aziz Abdulla, Richard Mayr:
Petri Nets with Time and Cost. Infinity 2012: 9-24 - 2011
- [j25]Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin:
A classification of the expressive power of well-structured transition systems. Inf. Comput. 209(3): 248-279 (2011) - [j24]Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine:
Automatic Verification of Directory-Based Consistency Protocols with Graph Constraints. Int. J. Found. Comput. Sci. 22(4): 761-782 (2011) - [c78]Parosh Aziz Abdulla:
Carrying Probabilities to the Infinite World. CONCUR 2011: 1-16 - [c77]Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar:
Advanced Ramsey-Based Büchi Automata Inclusion Testing. CONCUR 2011: 187-202 - [c76]Parosh Aziz Abdulla, Giorgio Delzanno, Othmane Rezine, Arnaud Sangnier, Riccardo Traverso:
On the Verification of Timed Ad Hoc Networks. FORMATS 2011: 256-270 - [c75]Parosh Aziz Abdulla, Richard Mayr:
Computing Optimal Coverability Costs in Priced Timed Petri Nets. LICS 2011: 399-408 - [c74]Parosh Aziz Abdulla, Jonathan Cederberg, Tomás Vojnar:
Monotonic Abstraction for Programs with Multiply-Linked Structures. RP 2011: 125-138 - [e2]Parosh Aziz Abdulla, K. Rustan M. Leino:
Tools and Algorithms for the Construction and Analysis of Systems - 17th International Conference, TACAS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26-April 3, 2011. Proceedings. Lecture Notes in Computer Science 6605, Springer 2011, ISBN 978-3-642-19834-2 [contents] - [i7]Parosh Aziz Abdulla, Richard Mayr:
Computing Optimal Coverability Costs in Priced Timed Petri Nets. CoRR abs/1104.0617 (2011) - 2010
- [j23]Parosh Aziz Abdulla:
Well (and better) quasi-ordered transition systems. Bull. Symb. Log. 16(4): 457-515 (2010) - [j22]Parosh Aziz Abdulla, Pavel Krcál, Wang Yi:
Sampled Semantics of Timed Automata. Log. Methods Comput. Sci. 6(3) (2010) - [c73]Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar:
Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing. CAV 2010: 132-147 - [c72]Parosh Aziz Abdulla, Yu-Fang Chen, Giorgio Delzanno, Frédéric Haziza, Chih-Duo Hong, Ahmed Rezine:
Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification. CONCUR 2010: 86-101 - [c71]Parosh Aziz Abdulla, Jonathan Cederberg, Lisa Kaati:
Analyzing the Security in the GSM Radio Network Using Attack Jungles. ISoLA (1) 2010: 60-74 - [c70]Parosh Aziz Abdulla:
Forcing Monotonicity in Parameterized Verification: From Multisets to Words. SOFSEM 2010: 1-15 - [c69]Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Richard Mayr, Tomás Vojnar:
When Simulation Meets Antichains. TACAS 2010: 158-174
2000 – 2009
- 2009
- [j21]Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine:
Approximated parameterized verification of infinite-state processes with global conditions. Formal Methods Syst. Des. 34(2): 126-156 (2009) - [j20]Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar:
Composed Bisimulation for Tree Automata. Int. J. Found. Comput. Sci. 20(4): 685-700 (2009) - [j19]Parosh Aziz Abdulla, Giorgio Delzanno, Noomene Ben Henda, Ahmed Rezine:
Monotonic Abstraction: on Efficient Verification of Parameterized Systems. Int. J. Found. Comput. Sci. 20(5): 779-801 (2009) - [c68]Parosh Aziz Abdulla, Muhsin Atto, Jonathan Cederberg, Ran Ji:
Automated Analysis of Data-Dependent Programs with Dynamic Memory. ATVA 2009: 197-212 - [c67]Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine:
Approximated Context-Sensitive Analysis for Parameterized Verification. FMOODS/FORTE 2009: 41-56 - [c66]Parosh Aziz Abdulla, Richard Mayr:
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets. FoSSaCS 2009: 348-363 - [c65]Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Tomás Vojnar:
Mediating for Reduction (on Minimizing Alternating Büchi Automata). FSTTCS 2009: 1-12 - [c64]Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin:
A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations. LATA 2009: 71-82 - [c63]Parosh Aziz Abdulla:
Infinite-State Verification: From Transition Systems to Markov Chains. QEST 2009: 4 - [c62]Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine:
Automatic Verification of Directory-Based Consistency Protocols. RP 2009: 36-50 - [c61]Parosh Aziz Abdulla, Pavel Krcál, Wang Yi:
Universality of R-automata with Value Copying. INFINITY 2009: 131-141 - 2008
- [j18]Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, Karin Quaas, James Worrell:
Universality Analysis for One-Clock Timed Automata. Fundam. Informaticae 89(4): 419-450 (2008) - [j17]Parosh Aziz Abdulla, Ahmed Bouajjani, Julien d'Orso:
Monotonic and Downward Closed Games. J. Log. Comput. 18(1): 153-169 (2008) - [j16]Parosh Aziz Abdulla, Frédéric Haziza, Mats Kindahl:
Model checking race-freeness. SIGARCH Comput. Archit. News 36(5): 72-79 (2008) - [c60]Parosh Aziz Abdulla, Ahmed Bouajjani, Jonathan Cederberg, Frédéric Haziza, Ahmed Rezine:
Monotonic Abstraction for Programs with Dynamic Memory Heaps. CAV 2008: 341-354 - [c59]Parosh Aziz Abdulla, Pavel Krcál, Wang Yi:
R-Automata. CONCUR 2008: 67-81 - [c58]Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio Delzanno, Frédéric Haziza, Ahmed Rezine:
Parameterized Tree Systems. FORTE 2008: 69-83 - [c57]Parosh Aziz Abdulla, Noomene Ben Henda, Luca de Alfaro, Richard Mayr, Sven Sandberg:
Stochastic Games with Lossy Channels. FoSSaCS 2008: 35-49 - [c56]Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine:
Monotonic Abstraction in Action. ICTAC 2008: 50-65 - [c55]Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin:
On the Qualitative Analysis of Conformon P Systems. Workshop on Membrane Computing 2008: 78-94 - [c54]Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar:
Computing Simulations over Tree Automata. TACAS 2008: 93-108 - [c53]Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio Delzanno, Ahmed Rezine:
Handling Parameterized Systems with Non-atomic Global Conditions. VMCAI 2008: 22-36 - [c52]Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar:
Composed Bisimulation for Tree Automata. CIAA 2008: 212-222 - [c51]Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine:
Monotonic Abstraction in Parameterized Verification. RP 2008: 3-14 - [c50]Parosh Aziz Abdulla, Lukás Holík, Lisa Kaati, Tomás Vojnar:
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. MEMICS 2008: 27-48 - [i6]Parosh Aziz Abdulla, Ahmed Bouajjani, Jonathan Cederberg, Frédéric Haziza, Ran Ji, Ahmed Rezine:
Shape Analysis via Monotonic Abstraction. Beyond the Finite: New Challenges in Verification and Semistructured Data 2008 - 2007
- [j15]Parosh Aziz Abdulla, Johanna Högberg, Lisa Kaati:
Bisimulation Minimization of Tree Automata. Int. J. Found. Comput. Sci. 18(4): 699-713 (2007) - [j14]Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr:
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness. Log. Methods Comput. Sci. 3(1) (2007) - [j13]Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr:
Decisive Markov Chains. Log. Methods Comput. Sci. 3(4) (2007) - [j12]Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata, Aletta Nylén:
Using Forward Reachability Analysis for Verification of Timed Petri Nets. Nord. J. Comput. 14(1-2): 1-42 (2007) - [c49]Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine:
Parameterized Verification of Infinite-State Processes with Global Conditions. CAV 2007: 145-157 - [c48]Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin:
Comparing the Expressive Power of Well-Structured Transition Systems. CSL 2007: 99-114 - [c47]Parosh Aziz Abdulla, Pavel Krcál, Wang Yi:
Sampled Universality of Timed Automata. FoSSaCS 2007: 2-16 - [c46]Parosh Aziz Abdulla, Joël Ouaknine, Karin Quaas, James Worrell:
Zone-Based Universality Analysis for Single-Clock Timed Automata. FSEN 2007: 98-112 - [c45]Parosh Aziz Abdulla, Giorgio Delzanno, Noomene Ben Henda, Ahmed Rezine:
Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems). TACAS 2007: 721-736 - [i5]Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr:
Decisive Markov Chains. CoRR abs/0706.2585 (2007) - 2006
- [j11]Parosh Aziz Abdulla, Axel Legay, Julien d'Orso, Ahmed Rezine:
Tree regular model checking: A simulation-based approach. J. Log. Algebraic Methods Program. 69(1-2): 93-121 (2006) - [c44]Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, Sven Sandberg:
Eager Markov Chains. ATVA 2006: 24-38 - [c43]Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena:
Proving Liveness by Backwards Reachability. CONCUR 2006: 95-109 - [c42]Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, Sven Sandberg:
Limiting Behavior of Markov Chains with Eager Attractors. QEST 2006: 253-264 - [c41]Parosh Aziz Abdulla, Lisa Kaati, Johanna Högberg:
Bisimulation Minimization of Tree Automata. CIAA 2006: 173-185 - [e1]Parosh Aziz Abdulla, Ahmed Bouajjani, Markus Müller-Olm:
Software Verification: Infinite-State Model Checking and Static Program Analysis, 19.02. - 24.02.2006. Dagstuhl Seminar Proceedings 06081, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i4]Parosh Aziz Abdulla, Ahmed Bouajjani, Markus Müller-Olm:
06081 Executive Summary -- Software Verification: Infinite-State Model Checking and Static Program Analysis. Software Verification: Infinite-State Model Checking and Static Program Analysis 2006 - [i3]Parosh Aziz Abdulla, Ahmed Bouajjani, Markus Müller-Olm:
06081 Abstracts Collection -- Software Verification: Infinite-State Model Checking and Static Program Analysis. Software Verification: Infinite-State Model Checking and Static Program Analysis 2006 - [i2]Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr:
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness. CoRR abs/cs/0611048 (2006) - 2005
- [j10]Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson:
Simulating perfect channels with probabilistic lossy channels. Inf. Comput. 197(1-2): 22-40 (2005) - [j9]Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Philippe Schnoebelen:
Verification of probabilistic systems with faulty communication. Inf. Comput. 202(2): 141-165 (2005) - [c40]Parosh Aziz Abdulla:
Verification of Parameterized Timed Systems. FORMATS 2005: 95-97 - [c39]Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, James Worrell:
Decidability and Complexity Results for Timed Automata via Channel Machines. ICALP 2005: 1089-1101 - [c38]Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr:
Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property. LICS 2005: 127-136 - [c37]Parosh Aziz Abdulla, Axel Legay, Julien d'Orso, Ahmed Rezine:
Simulation-Based Iteration of Tree Transducers. TACAS 2005: 30-44 - [c36]Parosh Aziz Abdulla, Johann Deneux, Lisa Kaati, Marcus Nilsson:
Minimization of Non-deterministic Automata with Large Alphabets. CIAA 2005: 31-42 - 2004
- [j8]Parosh Aziz Abdulla, S. Purushothaman Iyer, Aletta Nylén:
SAT-Solving the Coverability Problem for Petri Nets. Formal Methods Syst. Des. 24(1): 25-43 (2004) - [j7]Parosh Aziz Abdulla, Aurore Collomb-Annichini, Ahmed Bouajjani, Bengt Jonsson:
Using Forward Reachability Analysis for Verification of Lossy Channel Systems. Formal Methods Syst. Des. 25(1): 39-65 (2004) - [c35]Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, Mayank Saksena:
Regular Model Checking for LTL(MSO). CAV 2004: 348-360 - [c34]Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Mayank Saksena:
A Survey of Regular Model Checking. CONCUR 2004: 35-48 - [c33]Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata, Aletta Nylén:
Forward Reachability Analysis of Timed Petri Nets. FORMATS/FTRTFT 2004: 343-362 - [c32]Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr:
Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets. FSTTCS 2004: 58-70 - [c31]Parosh Aziz Abdulla, Johann Deneux, Gunnar Stålmarck, Herman Ågren, Ove Åkerlund:
Designing Safe, Reliable Systems using Scade. ISoLA (Preliminary proceedings) 2004: 111-118 - [c30]Parosh Aziz Abdulla, Johann Deneux, Gunnar Stålmarck, Herman Ågren, Ove Åkerlund:
Designing Safe, Reliable Systems Using Scade. ISoLA 2004: 115-129 - [c29]Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata:
Multi-Clock Timed Networks. LICS 2004: 345-354 - [c28]Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata:
Closed, Open, and Robust Timed Networks. INFINITY 2004: 117-151 - [i1]Parosh Aziz Abdulla, Aletta Nylén:
Better Quasi-Ordered Transition Systems. CoRR cs.LO/0409052 (2004) - 2003
- [j6]Parosh Aziz Abdulla, Bengt Jonsson:
Model checking of systems with many identical timed processes. Theor. Comput. Sci. 290(1): 241-264 (2003) - [c27]Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso:
Algorithmic Improvements in Regular Model Checking. CAV 2003: 236-248 - [c26]Parosh Aziz Abdulla, Ahmed Bouajjani, Julien d'Orso:
Deciding Monotonic Games. CSL 2003: 1-14 - [c25]Parosh Aziz Abdulla, Alexander Moshe Rabinovich:
Verification of Probabilistic Systems with Faulty Communication. FoSSaCS 2003: 39-53 - 2002
- [c24]Parosh Aziz Abdulla, Bengt Jonsson, Pritha Mahata, Julien d'Orso:
Regular Tree Model Checking. CAV 2002: 555-568 - [c23]Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso:
Regular Model Checking Made Simple and Efficient. CONCUR 2002: 116-130 - 2001
- [j5]Parosh Aziz Abdulla, Bengt Jonsson:
Ensuring completeness of symbolic verification methods for infinite-state systems. Theor. Comput. Sci. 256(1-2): 145-167 (2001) - [c22]Parosh Aziz Abdulla, Aletta Nylén:
Timed Petri Nets and BQOs. ICATPN 2001: 53-70 - [c21]Parosh Aziz Abdulla, Bengt Jonsson:
Channel Representations in Protocol Verification. CONCUR 2001: 1-15 - [c20]Parosh Aziz Abdulla, Luc Boasson, Ahmed Bouajjani:
Effective Lossy Queue Languages. ICALP 2001: 639-651 - 2000
- [j4]Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, Yih-Kuen Tsay:
Algorithmic Analysis of Programs with Well Quasi-ordered Domains. Inf. Comput. 160(1-2): 109-127 (2000) - [c19]Parosh Aziz Abdulla, Bengt Jonsson:
Invited Tutorial: Verification of Infinite-State and Parameterized Systems. CAV 2000: 4 - [c18]Parosh Aziz Abdulla, S. Purushothaman Iyer, Aletta Nylén:
Unfoldings of Unbounded Petri Nets. CAV 2000: 495-507 - [c17]Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson:
Reasoning about Probabilistic Lossy Channel Systems. CONCUR 2000: 320-333 - [c16]Parosh Aziz Abdulla, Aletta Nylén:
Better is Better than Well: On Efficient Verification of Infinite-State Systems. LICS 2000: 132-140 - [c15]Parosh Aziz Abdulla, Per Bjesse, Niklas Eén:
Symbolic Reachability Analysis Based on SAT-Solvers. TACAS 2000: 411-425
1990 – 1999
- 1999
- [c14]Parosh Aziz Abdulla, Bengt Jonsson:
On the Existence of Network Invariants for Verifying Parameterized Systems. Correct System Design 1999: 180-197 - [c13]Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson:
Handling Global Conditions in Parameterized System Verification. CAV 1999: 134-145 - [c12]Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, Yassine Lakhnech:
Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis. CAV 1999: 146-159 - [c11]Parosh Aziz Abdulla, Aurore Annichini, Ahmed Bouajjani:
Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol. TACAS 1999: 208-222 - 1998
- [c10]Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson:
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels. CAV 1998: 305-318 - [c9]Parosh Aziz Abdulla, Bengt Jonsson, Mats Kindahl, Doron A. Peled:
A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract). CAV 1998: 379-390 - [c8]Parosh Aziz Abdulla, Karlis Cerans:
Simulation Is Decidable for One-Counter Nets (Extended Abstract). CONCUR 1998: 253-268 - [c7]Parosh Aziz Abdulla, Bengt Jonsson:
Verifying Networks of Timed Processes (Extended Abstract). TACAS 1998: 298-312 - 1997
- [c6]Parosh Aziz Abdulla, Mats Kindahl, Doron A. Peled:
An Improved Search Strategy for Lossy Channel Systems. FORTE 1997: 251-264 - 1996
- [j3]Parosh Aziz Abdulla, Bengt Jonsson:
Verifying Programs with Unreliable Channels. Inf. Comput. 127(2): 91-101 (1996) - [j2]Parosh Aziz Abdulla, Bengt Jonsson:
Undecidable Verification Problems for Programs with Unreliable Channels. Inf. Comput. 130(1): 71-90 (1996) - [c5]Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, Yih-Kuen Tsay:
General Decidability Theorems for Infinite-State Systems. LICS 1996: 313-321 - 1995
- [c4]Parosh Aziz Abdulla, Mats Kindahl:
Decidability of Simulation and Bisimulation between Lossy Channel Systems and Finite State Systems (Extended Abstract). CONCUR 1995: 333-347 - 1994
- [c3]Parosh Aziz Abdulla, Bengt Jonsson:
Undecidable Verification Problems for Programs with Unreliable Channels. ICALP 1994: 316-327 - 1993
- [c2]Parosh Aziz Abdulla, Bengt Jonsson:
Verifying Programs with Unreliable Channels. LICS 1993: 160-170 - 1992
- [j1]Parosh Aziz Abdulla:
Automatic Verification of a Class Systolic Circuits. Formal Aspects Comput. 4(2): 149-194 (1992) - 1990
- [b1]Parosh Aziz Abdulla:
Decision problems in systolic circuit verification. Uppsala University, Sweden, 1990
1980 – 1989
- 1988
- [c1]Parosh Aziz Abdulla, Stefan Arnborg:
An Equivalence Decision Problem in Systolic Array Verification. Specification and Verification of Concurrent Systems 1988: 236-245
Coauthor Index
[j51] [c155] [c154] [c152] [i33] [i32] [c150] [c149] [c148] [c147] [i31] [i29] [i28] [i27] [c146] [c145] [c144] [i25] [i24] [j49] [c143] [c141] [j47] [c140] [c139] [c138] [c137] [i23] [i22] [j45] [c136] [c135] [c134] [c133] [d1] [j44] [j43] [j42] [c132] [c131] [c129] [c128] [c127] [c126] [i21] [i20] [j41] [c124] [c123] [c122] [i19] [i18] [i17] [c121] [c120] [c119] [c118] [c116] [c115] [i16] [i15] [i14] [c113] [c112] [c111] [c110] [c109] [c108] [c106] [i13] [j32] [c104] [c103] [c102] [c101] [c100] [i10] [c96] [c93] [c92] [c89] [c87] [c86] [c85] [c84] [c83] [c82] [c81] [c80]
Ngo Tuan Phong
aka: Tuan Phong Ngo
aka: Tuan Phong Ngo
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
