Parosh Aziz Abdulla

Publications

LATA'14
  • Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jari Stenman.
  • Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata.
  • Proc. LATA'14, the 8th International Conference on Language and Automata Theory and Applications.
  • Madrid, Spain.
  • 2014.
  • pdf.
POPL'14
  • Parosh Abdulla, Stavros Aronis, Bengt Jonsson, and Konstantinos Sagonas.
  • Optimal Dynamic Partial Order Reduction.
  • Proc. POPL'14, the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages.
  • San Diego, USA.
  • 2014.
  • pdf.
IJFCS'13
  • 24 (2): 187-210.
  • 2013.
  • pdf.
LMCS'13
  • 9 (4): 1-51.
  • 2013.
  • pdf.
STTT'13
  • Parosh Aziz Abdulla and 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.
  • International Journal on Software Tools for Technology Transfer .
  • 15 (2): 85-88.
  • 2013.
  • pdf.
ATVA'13
  • Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, and Tomás Vojnar.
  • Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata.
  • Proc. ATVA'13, the 11th International Symposium on Automated Technology for Verification and Analysis.
  • Hanoi, Vietnam.
  • 2013.
  • pdf.
ATVA'13
  • Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jonathan Cederberg.
  • Analysis of Message Passing Programs Using SMT-Solvers.
  • Proc. ATVA'13, the 11th International Symposium on Automated Technology for Verification and Analysis.
  • Hanoi, Vietnam.
  • 2013.
  • pdf.
CONCUR'13
  • Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, and Jeremy Sproston.
  • Solving Parity Games on Integer Vectors.
  • Proc. CONCUR'13, the 24th International Conference on Concurrency Theory.
  • Buenos Aires, Argentina.
  • 2013.
  • pdf.
DATE'13
  • Parosh Aziz Abdulla, Sandhya Dwarkadas, Ahmed Rezine, Arrvindh Shriraman, and Yunyun Zhu.
  • Verifying Safety and Liveness for the FlexTM Hybrid Transactional Memory.
  • Proc. DATE'13, Design, Automation and Test in Europe.
  • Grenoble, France.
  • 2013.
  • pdf.
FMOODS/FORTE'13
  • Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Othmane Rezine.
  • Verification of Directed Acyclic Ad Hoc Networks.
  • Proc. FMOODS/FORTE'13, Formal Techniques for Distributed Systems - Joint IFIP WG 6.1 International Conference, FMOODS/FORTE 2013, Held as Part of the 8th International Federated Conference on Distributed Computing Techniques, DisCoTec.
  • Florence, Italy.
  • 2013.
  • pdf.
FSEN'13
  • Parosh Aziz Abdulla, Mohamed Faouzi Atig, Giorgio Delzanno, and Andreas Podelski.
  • Push-Down Automata with Gap-Order Constraints.
  • Proc. FSEN'13, the 5th IPM International Conference on Fundamentals of Software Engineering.
  • Tehran, Iran.
  • 2013.
  • pdf.
QEST'13
  • Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, and Sven Sandberg.
  • Stochastic Parity Games on Lossy Channel Systems.
  • Proc. QEST'13, the 10th International Conference on Quantitative Evaluation of SysTems.
  • Buenos Aires, Argentina.
  • 2013.
  • pdf.
TACAS'13
  • Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, and Ahmed Rezine.
  • An Integrated Specification and Verification Technique for Highly Concurrent Data Structures.
  • Proc. TACAS'13, the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems.
  • Rome, Italy.
  • 2013.
  • pdf.
TACAS'13
  • 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..
  • Proc. TACAS'13, the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems.
  • Rome, Italy.
  • 2013.
  • pdf.
VMCAI'13
  • Parosh Aziz Abdulla, Frédéric Haziza, and Lukás Holík.
  • All for the Price of Few (Parameterized Verification through View Abstraction).
  • Proc. VMCAI'13, the 14th International Conference on Verification, Model Checking, and Abstract Interpretation.
  • Rome, Italy.
  • 2013.
  • pdf.
RP'13
  • Parosh Aziz Abdulla and Igor Potapov.
  • Monotonic Abstraction for Programs with Multiply-Linked Structures.
  • Proc. RP'13, the 5th Workshop on Reachability Problems.
  • Genoa, Italy.
  • 2011.
  • pdf.
STTT'12
  • 14 (2): 223-241.
  • 2012.
  • pdf.
STTT'12
  • 14 (2): 223-241.
  • 2012.
  • pdf.
FMCAD'12
  • Parosh Aziz Abdulla, Mohamed Faouzi Atig, Othmane Rezine, and Jari Stenman.
  • Multi-Pushdown Systems with Budgets.
  • Proc. FMCAD'12, Formal Methods in Computer-Aided Design.
  • Cambridge, UK.
  • 2012.
  • pdf.
FSTTCS'12
  • Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jonathan Cederberg.
  • Timed Lossy Channel Systems.
  • Proc. FSTTCS'12, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science.
  • Hyderabad, India.
  • 2012.
  • pdf.
LATA'12
  • Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jari Stenman.
  • The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems.
  • Proc. LATA'12, the 6th International Conference on Language and Automata Theory and Applications.
  • Coruña, Spain.
  • 2012.
  • pdf.
LICS'12
  • Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jari Stenman.
  • Dense-Timed Pushdown Automata.
  • Proc. LICS'12, the 27th Annual IEEE Symposium on Logic in Computer Science.
  • Dubrovnik, Croatia.
  • 2012.
  • pdf.
SAS'12
  • Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Carl Leonardsson, and Ahmed Rezine.
  • Automatic Fence Insertion in Integer Programs via Predicate Abstraction.
  • Proc. SAS'12, the 19th International Symposium on Static Analysis.
  • Deauville, France.
  • 2012.
  • pdf.
TACAS'12
  • Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Carl Leonardsson, and Ahmed Rezine.
  • Counter-Example Guided Fence Insertion under TSO.
  • Proc. TACAS'12, the 18th International Conference Tools and Algorithms for the Construction and Analysis of Systems.
  • Tallin, Estonia.
  • 2012.
  • pdf.
QFM'12
  • Parosh Aziz Abdulla.
  • Adding Time to Pushdown Automata.
  • Proc. QFM'12, Quantities in Formal Methods.
  • Paris, France.
  • 2012.
  • pdf.
Infinity'12
  • Parosh Aziz Abdulla.
  • Petri Nets with Time and Cost.
  • Proc. Infinity'12, the 14th International Workshop on Verification of Infinite-State Systems.
  • Paris, France.
  • 2012.
  • pdf.
IC11
  • Parosh Aziz Abdulla, Giorgio Delzanno, and Laurent Van Begin.
  • A classification of the expressive power of well-structured transition systems.
  • The Journal of Information and Computation.
  • 209 (3): 248-279.
  • 2011.
  • pdf.
IJFCS'11
  • 22 (4): 761-782.
  • 2011.
  • pdf.
RP'11
  • Parosh Aziz Abdulla, Jonathan Cederberg, and Tomás Vojnar.
  • Monotonic Abstraction for Programs with Multiply-Linked Structures.
  • Proc. RP'11, the 5th Workshop on Reachability Problems.
  • Genoa, Italy.
  • 2011.
  • pdf.
LICS'11
  • Parosh Aziz Abdulla and Richard Mayr.
  • Computing Optimal Coverability Costs in Priced Timed Petri Nets.
  • Proc. LICS'11, the 26th Annual IEEE Symposium on Logic in Computer Science.
  • Toronto, Ontario, Canada.
  • 2011.
  • pdf.
FORMATS'11
  • Parosh Aziz Abdulla, Giorgio Delzanno, Othmane Rezine, Arnaud Sangnier, and Riccardo Traverso.
  • On the Verification of Timed Ad Hoc Networks.
  • Proc. FORMATS'11, the 9th International Conference on Formal Modeling and Analysis of Timed Systems.
  • Aalborg, Denmark.
  • 2011.
  • pdf.
CONCUR'11
  • Parosh Aziz Abdulla,, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, and Tomás Vojnar.
  • Advanced Ramsey-Based Büchi Automata Inclusion Testing.
  • Proc. CONCUR'11, the 22th International Conference on Concurrency Theory .
  • Aachen, Germany.
  • 2011.
  • pdf.
CONCUR'11/QEST'11
  • Parosh Aziz Abdulla.
  • Carrying Probabilities to the Infinite World.
  • Proc. CONCUR'11/QEST'11, the 22th International Conference on Concurrency Theory .
  • Aachen, Germany.
  • 2011.
  • pdf.
CONCUR'10
  • Parosh Aziz Abdulla, Yu-Fang Chen, Giorgio Delzanno, Frederic Haziza, Chih-Duo Hong, and Ahmed Rezine.
  • Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification.
  • Proc. CONCUR'10, the 21th International Conference on Concurrency Theory .
  • Paris, France.
  • 2010.
  • pdf.
CAV'10
  • Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukas Holik, Chih-Duo Hong, Richard Mayr, Tomas Vojnar.
  • Simulation Subsumption in Ramsey-Based Buchi Automata Universality and Inclusion Testing..
  • Proc. CAV'10, the 20th International Conference on Computer Aided Verification .
  • Edinburgh, Scotland.
  • 2010.
  • pdf.
TACAS'10
  • Parosh Aziz Abdulla, Yu-Fang Chen, Lukas Holik, Richard Mayr, Tomas Vojnar.
  • When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata).
  • Proc. TACAS'10, the 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems .
SOFSEM'10
  • Parosh Aziz Abdulla.
  • Monotonic Abstraction in Parameterized Verification.
  • Proc. SOFSEM'10, the 36th International Conference on Current Trends in Theory and Practice of Computer Science.
  • Spindleruv Mlyn, Czech Republic.
  • 2010.
  • Invited Contribution.
  • pdf.
ISoLA'10
  • Parosh Aziz Abdulla, Jonathan Cederberg, and Lisa Kaati.
  • Analyzing the Security in the GSM Radio Network using Attack Jungles.
  • Proc. ISoLA'10, the 4th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation .
  • Heraklion, Greece.
  • 2010.
  • pdf.
BSL'10
  • 16 (4): 457-515.
  • 2010.
  • pdf.
LMCS'10
  • 6 (3): 1-37.
  • 2010.
  • pdf.
FSTTCS'09
  • Parosh Aziz Abdulla, Yu-Fang Chen, Lukas Holik, and Tomas Vojnar.
  • Mediating for Reduction (on Minimizing Alternating Buchi Automata).
  • Proc. FSTTCS'09, the 29th Annual Conference on the Foundations of Software Technology and Theoretical Computer Science.
  • Kanupur, India.
  • 2009.
  • pdf.
FoSSaCS'09
  • Parosh Aziz Abdulla and Richard Mayr.
  • Minimal Cost Reachability/Coverability in Priced Timed Petri Nets.
  • Proc. FoSSaCS'09, the 12th International Conference on Foundations of Software Science and Computation Structures.
  • York, UK.
  • 2009.
  • pdf.
ATVA'09
  • Parosh Aziz Abdulla, Muhsin Atto, Jonathan Cederberg, and Ran Ji.
  • Automated Analysis of Data-Dependent Programs with Dynamic Memory.
  • Proc. ATVA'09, the 7th International Symposium on Automated Technology for Verification and Analysis.
  • Macao SAR, China.
  • 2009.
  • pdf.
LATA'09
  • Parosh Aziz Abdulla, Giorgio Delzanno, and Laurent Van Begin.
  • A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations.
  • Proc. LATA'09, the thirrd International Conference on Language and Automata Theory and Applications.
  • Tarragona, Spain.
  • 2009.
  • pdf.
FORTE'09
  • Parosh Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine.
  • Approximated Context-sensitive Analysis for Parameterized Verification.
  • Proc. FORTE'09, the 29th IFIP international conference on Formal Techniques for Networked and Distributed Systems.
  • Paris, Portugal.
  • 2009.
  • pdf.
RP'09
  • Parosh Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine.
  • Automatic Verification of Directory-based Consistency Protocols.
  • Proc. RP'09, the 2nd Colloquium on Reachability Problems.
  • Paris, France.
  • 2009.
  • pdf.
FMSD'09
  • Parosh Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine.
  • Approximated parameterized verification of infinite-state processes with global conditions.
  • The Journal of Formal Methods in System Design.
  • 34 (2): 126-156.
  • 2009.
  • pdf.
IJFCS'09a
  • Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio Delzanno, and Ahmed Rezine.
  • Monotonic Abstraction (On Efficient Verification of Parameterized Systems).
  • The International Journal of Foundations of Computer Science.
  • 20 (5): 779-801.
  • 2009.
  • pdf.
IJFCS'09b
  • Parosh Aziz Abdulla, Ahmed Bouajjani, Lukas Holik, Lisa Kaati, and Tomas Vojnar.
  • Composed Bisimulation for Tree Automata.
  • The International Journal of Foundations of Computer Science.
  • 20 (4): 685-700.
  • 2009.
  • pdf.
CAV'08
  • Parosh Aziz Abdulla, Ahmed Bouajjani, Jonathan Cederberg, Frederic Haziza, and Ahmed Rezine.
  • Monotonic Abstraction for Programs with Dynamic Memory Heaps.
  • Proc. CAV'08, the 20th International Conference on Computer Aided Verification.
  • Princeton, USA.
  • 2008.
  • pdf.
TACAS'08
  • Parosh Aziz Abdulla, Ahmed Bouajjani, Lukas Holik, Lisa kaati, and Tomas Vojnar.
  • Computing Simulations over Tree Automata: Efficient Techniques for Reducing Tree Automata.
  • Proc. TACAS'08, the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems.
  • Budapest, Hungary.
  • 2008.
  • pdf.
FoSSaCS'08
  • Parosh Aziz Abdulla, Noomene Ben Henda, Luca de Alfaro, Richard Mayr, and Sven Sandberg.
  • Stochastic Games with Lossy Channels.
  • Proc. FoSSaCS'08, the 11th International Conference on the Foundations of Software Science and Computation Structures.
  • Budapest, Hungary.
  • 2008.
  • pdf.
CONCUR'08
  • Parosh Aziz Abdulla, Pavel Krcal, and Wang Yi.
  • R-Automata.
  • Proc. CONCUR'08, the 19th International Conference on Concurrency Theory.
  • Toronto, Canada.
  • 2008.
  • pdf.
VMCAI'08
  • Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio Delzanno, and Ahmed Rezine.
  • Handling Parameterized Systems with Non-Atomic Global Conditions.
  • Proc. VMCAI'08, the 9th International Conference on Verification, Model Checking and Abstract Interpretation.
  • San Francisco, USA.
  • 2008.
  • pdf.
CIAA'08
  • Parosh Aziz Abdulla, Ahmed Bouajjani, Lukas Holik, Lisa kaati, and Tomas Vojnar.
  • Composed Bisimulation for Tree Automata.
  • Proc. CIAA'08, the 13th International Conference on Implementation and Application of Automata.
FORTE'08
  • Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio Delzanno, Frederic Haziza, and Ahmed Rezine.
  • Tree Parameterized Systems.
  • Proc. FORTE'08, the 28th IFIP WG6.1 International Conference on Formal Techniques for Networked and Distributed Systems.
  • Tokyo, Japan.
  • 2008.
  • pdf.
RP'08
  • Parosh Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine.
  • Monotonic Abstraction in Parameterized Verification.
  • Proc. RP'08, the 2nd Workshop on Reachability Problems.
  • Liverpool, UK.
  • 2008.
  • Invited Contribution.
  • pdf.
ICTAC'08
  • Parosh Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine.
  • Monotonic Abstraction in Action: Automatic Verification of Distributed Mutex Algorithms.
  • Proc. ICTAC'08, the 5th International Colloquium on Theoretical Aspects of Computing.
  • Istanbul, Turkey.
  • 2008.
  • pdf.
WMC'08
  • Parosh Aziz Abdulla, Giorgio Delzanno, and Laurent Van Begin.
  • On the qualitative analysis of conformon P systems.
  • Proc. WMC'08, the 9th Workshop on Membrane Computing.
INFINITY'08
  • Parosh Aziz Abdulla, Pavel Krcal, and Wang Yi.
  • Universality of R-automata with Value Copying.
  • Proc. INFINITY'08, the 10th International Workshop on Verification of Infinite-State Systems.
  • Toronto, Canada.
  • 2008.
  • pdf.
FI08
  • Parosh Aziz Abdulla, Johann Deneux, Joel Ouaknine, Karin Quaas, and James Worrell.
  • Universality Analysis for One-Clock Timed Automata.
  • The Journal of Fundamenta Informaticae.
  • 89 (4): 419-450.
  • 2008.
  • pdf.
JLC'08
  • Parosh Aziz Abdulla, Ahmed Bouajjani, and Julien d'Orso.
  • Composed Bisimulation for Tree Automata.
  • The Journal of Logic and Computation.
  • 20 (4): 685-700.
  • 2009.
  • pdf.
CAV'07
  • Parosh Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine.
  • Parameterized Verification of Infinite-state Processes with Global Conditions.
  • Proc. CAV'07, the 19th International Conference on Computer Aided Verification.
  • Berlin, Germany.
  • 2007.
  • pdf.
TACAS'07
  • Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio Delzanno, and Ahmed Rezine.
  • Regular Model Checking without Transducers.
  • Proc. TACAS'07, the 13th International Conference on Tools and Algorithms for Construction and Analysis of Systems.
FoSSaCS'07
  • Parosh Aziz Abdulla, Pavel Krcal, and Wang Yi.
  • Sampled Universality of Timed Automata.
  • Proc. FoSSaCS'07, the 10th International Conference on the Foundations of Software Science and Computation Structures.
  • Braga, Portugal.
  • 2007.
  • pdf.
CSL'07
  • Parosh Aziz Abdulla, Giorgio Delzanno, and Laurent Van Begin.
  • Comparing the Expressive Power of Well-structured Transition Systems.
  • Proc. CSL'07, 16th EACSL Annual Conference on Computer Science and Logic.
  • Lausanne, Switzerland.
  • 2007.
  • pdf.
FSEN'07
  • Parosh Aziz Abdulla, Joel Ouaknine, Karin Quaas, and James Worrell.
  • Zone-Based Universality Analysis for Single-Clock Timed Automata.
  • Proc. FSEN'07, the IPM International Symposium on Fundamentals of Software Engineering.
  • Tehran, Iran.
  • 2007.
  • pdf.
LMCS07a
  • Parosh Aziz Abdulla, Pritha Mahata, and Richard Mayr.
  • Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness.
  • The Journal of Logical Methods in Computer Science.
  • 3 (1): 1-61.
  • 2007.
  • pdf.
LMCS07b
  • 3 (4): 1-32.
  • 2007.
  • pdf.
IJFCS'07
  • Parosh Aziz Abdulla, Johanna Högberg, and Lisa Kaati.
  • Bisimulation Minimization of Tree Automata.
  • The International Journal of Foundations of Computer Science.
  • 18 (4): 699-713.
  • 2007.
  • pdf.
NJC'07
  • Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata, and Aletta Nylen.
  • Using Forward Reachability Analysis for Verification of Timed Petri Nets.
  • The Nordic Journal of Computing.
  • 14 (1): 1-42.
  • 2007.
  • pdf.
CIAA'06
  • Parosh Aziz Abdulla, Johanna Högberg, and Lisa Kaati.
  • Minimization of tree automata.
  • Proc. CIAA'06, the 11th International Conference on Implementation and Application of Automata.
CONCUR'06
  • Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, and Mayank Saksena.
  • Proving Liveness by Backwards Reachability.
  • Proc. CONCUR'06, the 17th International Conference on Concurrency Theory.
  • Bonn, Germany.
  • 2006.
  • pdf.
QEST'06
  • Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, and Sven Sandberg.
  • Limiting Behavior of Markov Chains with Eager Attractors.
  • Proc. QEST'06, the 3rd International Conference on Quantitative Evaluation of SysTems.
  • Riverside, California, USA.
  • 2006.
  • pdf.
ATVA'06
  • Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, and Sven Sandberg.
  • Eager Markov Chains.
  • Proc. ATVA'06, the fourth symposium on Automated Technology for Verification and Analysis.
  • Beijing, China.
  • 2006.
  • pdf.
AVIS'06
  • Parosh Aziz Abdulla and Giorgio Delzanno.
  • Constrained Multiset Rewriting.
  • Proc. AVIS'06, the 5th International Workshop on Automated Verification of Infinite-State Systems.
  • Vienna, Austria.
  • 2006.
  • pdf.
JLAP'06
  • Parosh Aziz Abdulla, Axel Legay, Julien d'Orso, and Ahmed Rezine.
  • Tree Regular Model Checking: A Simulation-Based Approach.
  • The Journal of Logic and Algebraic Programming.
  • 69 (1-2): 93-121.
  • 2006.
  • pdf.
LICS'05
  • Parosh Aziz Abdulla, Noomene Ben Henda, and Richard Mayr.
  • Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property.
  • Proc. LICS'05, the 19th IEEE Int. Symp. on Logic in Computer Science.
  • Chicago, USA.
  • 2005.
  • pdf.
ICALP'05
  • Parosh Aziz Abdulla, Johann Deneux, Joel Ouaknine, and James Worrell.
  • Decidability and Complexity Results for Timed Automata via Channel Machines.
  • Proc. ICALP'05, the 32nd Int. Colloquium on Automata, Languages and Programming.
  • Lisbon, Portugal.
  • 2005.
  • pdf.
TACAS'05
  • Parosh Aziz Abdulla, Axel Legay, Julien d'Orso, Ahmed Rezine.
  • Simulation-Based Iteration of Tree Transducers.
  • Proc. TACAS'05, the 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems.
  • Edinburgh, Scotland.
  • 2005.
  • pdf.
FORMATS'05
  • Parosh Aziz Abdulla.
  • Verification of Parameterized Timed Systems.
  • Proc. FORMATS'05, the 3rd International Conference on Formal Modelling and Analysis of Timed Systems.
  • Uppsala, Sweden.
  • 2005.
  • Invited Contribution.
  • pdf.
CIAA'05
  • Parosh Aziz Abdulla, Johann Deneux, Lisa Kaati, and Marcus Nilsson.
  • Minimization of Non-Deterministic Automata with Large Alphabets.
  • Proc. CIAA'05, the 10th International Conference on Implementation and Application of Automata.
  • Sophia Antipolis, France.
  • 2005.
  • pdf.
IC05a
  • Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Rabinovich, and Philippe Schnoebelen.
  • Verification of Probabilistic Systems with Faulty Communication.
  • The Journal of Information and Computation.
  • 202 (2): 105-228.
  • 2005.
  • pdf.
IC05b
  • Parosh Aziz Abdulla, Christel Baier, Purushothaman Iyer, and Bengt Jonsson.
  • Simulating Perfect Channels with Probabilistic Lossy Channels.
  • The Journal of Information and Computation.
  • 197 (1-2): 22-40.
  • 2005.
  • pdf.
LICS'04
  • Parosh Aziz Abdulla, Johann Deneux, and Pritha Mahata.
  • Multi-Clock Timed Networks.
  • Proc. LICS'04, the 18th IEEE Int. Symp. on Logic in Computer Science.
  • Helsinki, Finland.
  • 2004.
  • pdf.
FSTTCS'04
  • Parosh Aziz Abdulla, Pritha Mahata, and Richard Mayr.
  • Decidability of Zenoness, Token Liveness, and Boundedness for Dense-Timed Petri Nets.
  • Proc. FSTTCS'04, the 24th Conference on Foundations of Software Technology and Theoretical Computer Science.
  • Chennai, India.
  • 2004.
  • pdf.
CAV'04
  • Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, and Mayank Saksena.
  • Regular Model Checking for S1S + LTL.
  • Proc. CAV'04, the 16th Int. Conf. Computer Aided Verification.
  • Boston, USA.
  • 2004.
  • pdf.
CONCUR'04
  • Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Mayank Saksena.
  • A Survey of Regular Model Checking.
  • Proc. CONCUR'04, the 15th International Conference on Concurrency Theory.
  • London, UK.
  • 2004.
  • Invited Contribution.
  • pdf.
ISoLA'04
  • Parosh Aziz Abdulla, Johann Deneux, and Ove Akerlund.
  • Designing Safe, Reliable Systems using Scade.
  • Proc. ISoLA'04, the 1st International Symposium on Leveraging and Applications of Formal Methods.
  • Paphos, Cyprus.
  • 2004.
  • pdf.
ISoLA'04
  • Parosh Aziz Abdulla, Noomene Ben Henda, Johann Deneux, Bengt Jonsson, and Tomas Reidmar.
  • Report on Dataflow Dependencies in Billing Processing Systems.
  • Proc. ISoLA'04, the 1st International Symposium on Leveraging and Applications of Formal Methods.
  • Paphos, Cyprus.
  • 2004.
  • pdf.
FORMATS'04
  • Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata and Aletta Nylen.
  • Forward Reachability Analysis of Timed Petri Nets.
  • Proc. FORMATS'04, the 3rd International Conference on Formal Modelling and Analysis of Timed Systems.
  • Grenoble, France.
  • 2004.
  • pdf.
INFINITY'04
  • Parosh Aziz Abdulla, Johann Deneux, and Pritha Mahata.
  • Open, Closed and Robust Timed Networks.
  • Proc. INFINITY'04, the 6th International Workshop on Verification of Infinite-State Systems.
  • London, UK.
  • 2004.
  • pdf.
FMSD04a
  • Parosh Aziz Abdulla, Purushothaman Iyer, and Aletta Nylen.
  • SAT-solving the Coverability Problem for Unbounded Petri Nets.
  • The Journal of Formal Methods in System Design.
  • 24 (1): 25-43.
  • 2004.
  • pdf.
FMSD04b
  • Parosh Aziz Abdulla, Aurore Annichini, Ahmed Bouajjani, and Bengt Jonsson.
  • Using Forward Reachability Analysis for Verification of Lossy Channel Systems.
  • The Journal of Formal Methods in System Design.
  • 25 (1): 39-65.
  • .
  • pdf.
CAV'03
  • Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Julien d'Orso.
  • Algorithmic Improvements in Regular Model Checking.
  • Proc. CAV'03, the 15th Int. Conf. Computer Aided Verification.
  • Boulder, Colorado, USA.
  • 2003.
  • pdf.
FoSSaCS'03
  • Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Julien d'Orso.
  • Algorithmic Improvements in Regular Model Checking.
  • Proc. FoSSaCS'03, the rth International Conference on the Foundations of Software Science and Computation Structures.
  • Warsaw, Poland.
  • 2003.
  • pdf.
TCS'03
  • 290 (1): 241-264.
  • 2003.
  • pdf.
CAV'02
  • Parosh Aziz Abdulla, Bengt Jonsson, Pritha Mahata, and Julien d'Orso.
  • Regular Tree Model Checking.
  • Proc. CAV'02, the 14th Int. Conf. on Computer Aided Verification.
  • Copenhagen, Denmark.
  • 2002.
  • pdf.
CONCUR'02
  • Parosh Aziz Abdulla and Bengt Jonsson, Marcus Nilsson, and Julien d'Orso.
  • Regular Model Checking made Simple and Efficient.
  • Proc. CONCUR'02, the 13th Int. Conf. on Concurrency Theory.
  • Brno, Czech Republic.
  • 2002.
  • pdf.
INFINITY'02
  • Parosh Aziz Abdulla and Aletta Nylen.
  • Undecidability of LTL for Timed Petri Nets.
  • Proc. INFINITY'02, the 4th International Workshop on Verification of Infinite-State Systems.
  • Brno, Czech Republic.
  • 2002.
  • pdf.
ICALP'01
  • Parosh Aziz Abdulla, Luc Boasson, and Ahmed Bouajjani.
  • Effective Lossy Queue Languages.
  • Proc. ICALP'01, the 28th Int. Colloquium on Automata, Languages and Programmming.
CONCUR'01
  • Parosh Aziz Abdulla and Bengt Jonsson.
  • Channel Abstractions in Protocol Verification.
  • Proc. CONCUR'01, the 12th Int. Conf. on Concurrency Theory.
  • Aalborg, Denmark.
  • 2001.
  • Invited Contribution.
  • pdf.
ICATPN'01
  • Parosh Aziz Abdulla and Aletta Nylen.
  • Timed Petri Nets and BQOs.
  • Proc. ICATPN'01, the 22nd Int. Conf. on application and theory of Petri nets.
  • Newcastle, UK.
  • 2001.
  • pdf.
TCS'01
  • Parosh Aziz Abdulla and Bengt Jonsson..
  • Ensuring Completeness of Symbolic Verification Methods for Infinite-State Systems.
  • The Journal of Theoretical Computer Science.
  • 290 (1): 241-264.
  • 2001.
  • pdf.
VEPAS'01
  • Parosh Aziz Abdulla.
  • Using (Timed) Petri Nets for Verification of Parametrized (Timed) Systems.
  • Proc. VEPAS'01, Verification of Parameterized Systems, ICALP'2001 satellite workshop.
  • Crete, Greece.
  • 2001.
  • Invited Contribution.
  • pdf.
LICS'00
  • Parosh Aziz Abdulla and Aletta Nylen.
  • Better is Better than Well: On Efficient Verification of Infinite-State Systems.
  • Proc. LICS'00, the 14th IEEE Int. Symp. on Logic in Computer Science.
  • Santa Barbara, California, USA.
  • 2000.
  • pdf.
CAV'00a
  • Parosh Aziz Abdulla, Purushothaman Iyer, and Aletta Nylen.
  • Unfoldings of Unbounded Petri Nets.
  • Proc. CAV'00a, the 12th Int. Conf. on Computer Aided Verification.
  • Chicago, USA.
  • 2000.
  • pdf.
CAV'00b
  • Parosh Aziz Abdulla and Bengt Jonsson.
  • Model Checking of Infinite-State Systems.
  • Proc. CAV'00b, the 12th Int. Conf. on Computer Aided Verification.
  • Chicago, USA.
  • 2000.
  • Invited Contribution.
  • pdf.
TACAS'00
  • Parosh Aziz Abdulla, Per Bjesse, and Niklas Een.
  • Symbolic Reachability Analysis Based on SAT-Solvers.
  • Proc. TACAS'00, the 6th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems.
CONCUR'00
  • Parosh Aziz Abdulla, Christel Baier, Purushothaman Iyer, and Bengt Jonsson.
  • Reasoning about Probabilistic Lossy Channel Systems.
  • Proc. CONCUR'00, the 11th Int. Conf. on Concurrency Theory.
  • Pennsylvania, USA.
  • 2000.
  • pdf.
IC'00
  • Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, and Tsay Yih-Kuen.
  • Algorithmic Analysis of Programs with Well Quasi-Ordered Domains.
  • The Journal of Information and Computation.
  • 160 (1-2): 109-127.
  • 2000.
  • pdf.
CSD'99
  • Parosh Aziz Abdulla and Bengt Jonsson.
  • On the Existence of Network Invariants for Verifying Parameterized Systems.
  • In Olderog and Steffen, editor, Correct System Design -- Recent Insights and Advances.
  • LNCS 1710, 180-197.
  • 1999.
  • pdf.
CAV'99a
  • Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, and Marcus Nilsson.
  • Handling Global Conditions in Parameterized System Verification.
  • Proc. CAV'99a, the11th Int. Conf. on Computer Aided Verification.
  • Trento, Italy.
  • 1999.
  • pdf.
CAV'99b
  • Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, and Yassine Lakhnech.
  • Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis.
  • Proc. CAV'99b, the11th Int. Conf. on Computer Aided Verification.
  • Trento, Italy.
  • 1999.
  • pdf.
TACAS'99
  • Parosh Aziz Abdulla, Aurore Annichini, and Ahmed Bouajjani.
  • Algorithmic Verification of Lossy Channel Systems: An Application to the Bounded Retransmission Protocol.
  • Proc. TACAS'99, the 5th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems.
  • Amsterdam, Holland.
  • 1999.
  • pdf.
CAV'98a
  • Parosh Aziz Abdulla, Ahmed Bouajjani and Bengt Jonsson.
  • On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels.
  • Proc. CAV'98a, the 10th Int. Conf. on Computer Aided Verification.
  • Vancouver, BC,, Canada.
  • .
  • pdf.
CAV'98b
  • Parosh Aziz Abdulla, Bengt Jonsson, Mats Kindahl, and Doron Peled.
  • A General Approach to Partial Order Reductions in Symbolic Verification.
  • Proc. CAV'98b, the 10th Int. Conf. on Computer Aided Verification.
  • Vancouver, BC,, Canada.
  • .
  • pdf.
TACAS'98
  • Parosh Aziz Abdulla and Bengt Jonsson.
  • Verifying Networks of Timed Processes.
  • Proc. TACAS'98, the th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems.
  • Lisbon, Portugal.
  • 1998.
  • pdf.
CONCUR'98
  • Parosh Aziz Abdulla and Karlis Cerans.
  • Simulation is Decidable for One-counter Nets.
  • Proc. CONCUR'98, the 9th Int. Conf. on Concurrency Theory.
  • Nice, France.
  • 1998.
  • pdf.
FORTE/PSTV`97
  • Parosh Aziz Abdulla, Mats Kindahl, and Doron Peled.
  • An Improved Search Strategy for Lossy Channel Systems.
  • Proc. FORTE/PSTV`97, the Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specification, Testing, and Verification. .
  • Osaka, Japan .
  • 1997.
  • pdf.
LICS'96
  • Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, and Tsay Yih-Kuen.
  • General Decidability Theorems for Infinite-State Systems.
  • Proc. LICS'96, the 11th IEEE Int. Symp. on Logic in Computer Science.
  • New Brunswick, New Jersey, USA.
  • 1996.
  • pdf.
IC'96a
  • 130 (1): 91-101.
  • 1996.
  • pdf.
IC'96b
  • Parosh Aziz Abdulla and Bengt Jonsson.
  • Undecidable Verification Problems for Programs with Unreliable Channels.
  • The Journal of Information and Computation.
  • 130 (1): 71-90.
  • 1996.
  • pdf.
CONCUR'95
  • Parosh Aziz Abdulla and Mats Kindahl.
  • Decidability of Simulation and Bisimulation between Lossy Channel Systems and Finite State Systems.
  • Proc. CONCUR'95, the 6th Int Conf. on Concurrency Theory.
  • Philadelphia, Pennsylvania, USA.
  • 1995.
  • pdf.
ICALP'94
  • Parosh Aziz Abdulla and Bengt Jonsson.
  • Undecidable Verification Problems for Programs with Unreliable Channels.
  • Proc. ICALP'94, the 21st Int. Colloquium on Automata, Languages and Programmming.
  • Jerusalem, Israel.
  • 1994.
  • pdf.
LICS'93
  • Parosh Aziz Abdulla and Bengt Jonsson.
  • Verifying Programs with Unreliable Channels.
  • Proc. LICS'93, the 8th IEEE Int. Symp. on Logic in Computer Science.
  • Montreal, Canada.
  • 1993.
  • pdf.
FAC'92
  • 4 (2): 149-194.
  • 1992.
  • pdf.
ACM'91
  • Parosh Aziz Abdulla.
  • Decidable and Undecidable Problems in Systolic Circuit Verification.
  • Proc. the ACM International Workshop on Formal Methods in VLSI Design.
IFIP'90
  • Parosh Aziz Abdulla.
  • Automatic Verification of a Class of Systolic Circuits.
  • Proc. MEC-IFIP International Workshop on Applied Formal Methods for Correct VLSI Design.
  • Formal VLSI Specification and Synthesis, North-Holland, 371-390.
  • 1990.
  • pdf.
SVC'88
  • Parosh Aziz Abdulla and Stefan Arnborg.
  • A Decision Problem in Systolic Circuit Verification.
  • Proc. Specification and Verification of Concurrent Systems.
  • Workshops in Computing , 236-245.
  • 1988.
  • pdf.