Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Parosh Aziz Abdulla
2010 – today
- 2013
[j33]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)- [j32]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. STTT 15(2): 85-88 (2013)
- [c94]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
- [c93]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jonathan Cederberg: Analysis of Message Passing Programs Using SMT-Solvers. ATVA 2013: 272-286
- [c92]Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston: Solving Parity Games on Integer Vectors. CONCUR 2013: 106-120
- [c91]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
- [c90]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Othmane Rezine: Verification of Directed Acyclic Ad Hoc Networks. FMOODS/FORTE 2013: 193-208
- [c89]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Giorgio Delzanno, Andreas Podelski: Push-Down Automata with Gap-Order Constraints. FSEN 2013: 199-216
- [c88]Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg: Stochastic Parity Games on Lossy Channel Systems. QEST 2013: 338-354
- [c87]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
- [c86]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
- [c85]
- [e3]Parosh Aziz Abdulla, Igor Potapov (Eds.): 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
- [i7]Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg: Stochastic Parity Games on Lossy Channel Systems. CoRR abs/1305.5228 (2013)
- [i6]Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston: Solving Parity Games on Integer Vectors. CoRR abs/1306.2806 (2013)
- [i5]
- 2012
- [j31]
- [j30]Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, Mayank Saksena: Regular model checking for LTL(MSO). STTT 14(2): 223-241 (2012)
- [c84]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Othmane Rezine, Jari Stenman: Multi-pushdown systems with budgets. FMCAD 2012: 24-33
- [c83]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jonathan Cederberg: Timed Lossy Channel Systems. FSTTCS 2012: 374-386
- [c82]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman: The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems. LATA 2012: 58-69
- [c81]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman: Dense-Timed Pushdown Automata. LICS 2012: 35-44
- [c80]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
- [c79]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Carl Leonardsson, Ahmed Rezine: Counter-Example Guided Fence Insertion under TSO. TACAS 2012: 204-219
- [c78]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman: Adding Time to Pushdown Automata. QFM 2012: 1-16
- [c77]
- 2011
- [j29]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)
- [j28]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)
- [c76]
- [c75]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
- [c74]Parosh Aziz Abdulla, Giorgio Delzanno, Othmane Rezine, Arnaud Sangnier, Riccardo Traverso: On the Verification of Timed Ad Hoc Networks. FORMATS 2011: 256-270
- [c73]Parosh Aziz Abdulla, Richard Mayr: Computing Optimal Coverability Costs in Priced Timed Petri Nets. LICS 2011: 399-408
- [c72]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 (Eds.): 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
- [i4]Parosh Aziz Abdulla, Richard Mayr: Computing Optimal Coverability Costs in Priced Timed Petri Nets. CoRR abs/1104.0617 (2011)
- 2010
- [j27]Parosh Aziz Abdulla: Well (and better) quasi-ordered transition systems. Bulletin of Symbolic Logic 16(4): 457-515 (2010)
- [j26]Parosh Aziz Abdulla, Pavel Krcál, Wang Yi: Sampled Semantics of Timed Automata. Logical Methods in Computer Science 6(3) (2010)
- [c71]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
- [c70]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
- [c69]Parosh Aziz Abdulla, Jonathan Cederberg, Lisa Kaati: Analyzing the Security in the GSM Radio Network Using Attack Jungles. ISoLA (1) 2010: 60-74
- [c68]Parosh Aziz Abdulla: Forcing Monotonicity in Parameterized Verification: From Multisets to Words. SOFSEM 2010: 1-15
- [c67]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
- [j25]Parosh Aziz Abdulla, Pavel Krcál, Wang Yi: Universality of R-automata with Value Copying. Electr. Notes Theor. Comput. Sci. 239: 131-141 (2009)
- [j24]Parosh Aziz Abdulla, Lukás Holík, Lisa Kaati, Tomás Vojnar: A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. Electr. Notes Theor. Comput. Sci. 251: 27-48 (2009)
- [j23]Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine: Approximated parameterized verification of infinite-state processes with global conditions. Formal Methods in System Design 34(2): 126-156 (2009)
- [j22]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)
- [j21]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)
- [c66]Parosh Aziz Abdulla, Muhsin Atto, Jonathan Cederberg, Ran Ji: Automated Analysis of Data-Dependent Programs with Dynamic Memory. ATVA 2009: 197-212
- [c65]Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine: Approximated Context-Sensitive Analysis for Parameterized Verification. FMOODS/FORTE 2009: 41-56
- [c64]Parosh Aziz Abdulla, Richard Mayr: Minimal Cost Reachability/Coverability in Priced Timed Petri Nets. FOSSACS 2009: 348-363
- [c63]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
- [c62]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
- [c61]Parosh Aziz Abdulla: Infinite-State Verification: From Transition Systems to Markov Chains. QEST 2009: 4
- [c60]Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine: Automatic Verification of Directory-Based Consistency Protocols. RP 2009: 36-50
- 2008
- [j20]Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine: Monotonic Abstraction in Parameterized Verification. Electr. Notes Theor. Comput. Sci. 223: 3-14 (2008)
- [j19]Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, Karin Quaas, James Worrell: Universality Analysis for One-Clock Timed Automata. Fundam. Inform. 89(4): 419-450 (2008)
- [j18]Parosh Aziz Abdulla, Ahmed Bouajjani, Julien d'Orso: Monotonic and Downward Closed Games. J. Log. Comput. 18(1): 153-169 (2008)
- [j17]Parosh Aziz Abdulla, Frédéric Haziza, Mats Kindahl: Model checking race-freeness. SIGARCH Computer Architecture News 36(5): 72-79 (2008)
- [c59]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
- [c58]
- [c57]Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio Delzanno, Frédéric Haziza, Ahmed Rezine: Parameterized Tree Systems. FORTE 2008: 69-83
- [c56]Parosh Aziz Abdulla, Noomene Ben Henda, Luca de Alfaro, Richard Mayr, Sven Sandberg: Stochastic Games with Lossy Channels. FoSSaCS 2008: 35-49
- [c55]Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine: Monotonic Abstraction in Action. ICTAC 2008: 50-65
- [c54]Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin: On the Qualitative Analysis of Conformon P Systems. Workshop on Membrane Computing 2008: 78-94
- [c53]Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar: Computing Simulations over Tree Automata. TACAS 2008: 93-108
- [c52]Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio Delzanno, Ahmed Rezine: Handling Parameterized Systems with Non-atomic Global Conditions. VMCAI 2008: 22-36
- [c51]Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar: Composed Bisimulation for Tree Automata. CIAA 2008: 212-222
- 2007
- [j16]Parosh Aziz Abdulla, Johanna Högberg, Lisa Kaati: Bisimulation Minimization of Tree Automata. Int. J. Found. Comput. Sci. 18(4): 699-713 (2007)
- [j15]Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr: Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness. Logical Methods in Computer Science 3(1) (2007)
- [j14]Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr: Decisive Markov Chains. Logical Methods in Computer Science 3(4) (2007)
- [j13]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)
- [c50]Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine: Parameterized Verification of Infinite-State Processes with Global Conditions. CAV 2007: 145-157
- [c49]Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin: Comparing the Expressive Power of Well-Structured Transition Systems. CSL 2007: 99-114
- [c48]Parosh Aziz Abdulla, Pavel Krcál, Wang Yi: Sampled Universality of Timed Automata. FoSSaCS 2007: 2-16
- [c47]Parosh Aziz Abdulla, Joël Ouaknine, Karin Quaas, James Worrell: Zone-Based Universality Analysis for Single-Clock Timed Automata. FSEN 2007: 98-112
- [c46]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
- [i3]Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr: Decisive Markov Chains. CoRR abs/0706.2585 (2007)
- 2006
- [j12]Parosh Aziz Abdulla, Axel Legay, Julien d'Orso, Ahmed Rezine: Tree regular model checking: A simulation-based approach. J. Log. Algebr. Program. 69(1-2): 93-121 (2006)
- [c45]Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, Sven Sandberg: Eager Markov Chains. ATVA 2006: 24-38
- [c44]Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena: Proving Liveness by Backwards Reachability. CONCUR 2006: 95-109
- [c43]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
- [c42]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
- [c41]Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, Sven Sandberg: Limiting Behavior of Markov Chains with Eager Attractors. QEST 2006: 253-264
- [c40]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 (Eds.): 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
- [i2]Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr: Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness. CoRR abs/cs/0611048 (2006)
- 2005
- [j11]Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata: Closed, Open, and Robust Timed Networks. Electr. Notes Theor. Comput. Sci. 138(3): 117-151 (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, Ph. Schnoebelen: Verification of probabilistic systems with faulty communication. Inf. Comput. 202(2): 141-165 (2005)
- [c39]
- [c38]Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, James Worrell: Decidability and Complexity Results for Timed Automata via Channel Machines. ICALP 2005: 1089-1101
- [c37]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
- [c36]Parosh Aziz Abdulla, Axel Legay, Julien d'Orso, Ahmed Rezine: Simulation-Based Iteration of Tree Transducers. TACAS 2005: 30-44
- [c35]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 in System Design 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 in System Design 25(1): 39-65 (2004)
- [c34]Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, Mayank Saksena: Regular Model Checking for LTL(MSO). CAV 2004: 348-360
- [c33]Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Mayank Saksena: A Survey of Regular Model Checking. CONCUR 2004: 35-48
- [c32]Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata, Aletta Nylén: Forward Reachability Analysis of Timed Petri Nets. FORMATS/FTRTFT 2004: 343-362
- [c31]Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr: Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets. FSTTCS 2004: 58-70
- [c30]Parosh Aziz Abdulla, Johan Deneaux, Gunnar Stålmarck, Herman Ågren, Ove Åkerlund: Designing Safe, Reliable Systems using Scade. ISoLA (Preliminary proceedings) 2004: 111-118
- [c29]Parosh Aziz Abdulla, Johann Deneux, Gunnar Stålmarck, Herman Ågren, Ove Åkerlund: Designing Safe, Reliable Systems Using Scade. ISoLA 2004: 115-129
- [c28]
- [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]
- [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]
- [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 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 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]
- 1992
- [j1]Parosh Aziz Abdulla: Automatic Verification of a Class Systolic Circuits. Formal Asp. Comput. 4(2): 149-194 (1992)
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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 10:57 CEST by the dblp team