Parosh Aziz Abdulla

Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2013

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.

[BibT_eX]

[DOI]

K. Rustan M. Leino

Int. J. Softw. Tools Technol. Transf., 2013

Monotonic Abstraction for Programs with Multiply-Linked Structures.

[BibT_eX]

[DOI]

Tomás Vojnar

Int. J. Found. Comput. Sci., 2013

Priced Timed Petri Nets.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

Zenoness for Timed Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 15th International Workshop on Verification of Infinite-State Systems, 2013

All for the Price of Few.

[BibT_eX]

[DOI]

Frédéric Haziza

Lukás Holík

Proceedings of the Verification, 2013

Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Push-Down Automata with Gap-Order Constraints.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Software Engineering - 5th International Conference, 2013

Verification of Directed Acyclic Ad Hoc Networks.

[BibT_eX]

[DOI]

Othmane Rezine

Proceedings of the Formal Techniques for Distributed Systems, 2013

Verifying safety and liveness for the FlexTM hybrid transactional memory.

[BibT_eX]

[DOI]

Proceedings of the Design, Automation and Test in Europe, 2013

Solving Parity Games on Integer Vectors.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

Analysis of Message Passing Programs Using SMT-Solvers.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2013

2012

Regular model checking for LTL(MSO).

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2012

Regular model checking.

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2012

Petri Nets with Time and Cost

[BibT_eX]

[DOI]

Proceedings of the Proceedings 14th International Workshop on Verification of Infinite-State Systems, 2012

Adding Time to Pushdown Automata

[BibT_eX]

[DOI]

Proceedings of the Proceedings Quantities in Formal Methods, 2012

Counter-Example Guided Fence Insertion under TSO.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Automatic Fence Insertion in Integer Programs via Predicate Abstraction.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 19th International Symposium, 2012

Dense-Timed Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2012

Timed Lossy Channel Systems.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Multi-pushdown systems with budgets.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Computer-Aided Design, 2012

2011

Automatic Verification of Directory-Based Consistency Protocols with Graph Constraints.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

A classification of the expressive power of well-structured transition systems.

[BibT_eX]

[DOI]

Inf. Comput., 2011

Computing Optimal Coverability Costs in Priced Timed Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

On the Verification of Timed Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

Advanced Ramsey-Based Büchi Automata Inclusion Testing.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Carrying Probabilities to the Infinite World.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010

Sampled Semantics of Timed Automata

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2010

Well (and better) quasi-ordered transition systems.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2010

When Simulation Meets Antichains.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

Forcing Monotonicity in Parameterized Verification: From Multisets to Words.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Analyzing the Security in the GSM Radio Network Using Attack Jungles.

[BibT_eX]

[DOI]

Lisa Kaati

Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010

Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

2009

Monotonic Abstraction: on Efficient Verification of Parameterized Systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

Composed Bisimulation for Tree Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

Approximated parameterized verification of infinite-state processes with global conditions.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2009

Universality of R-automata with Value Copying.

[BibT_eX]

[DOI]

Proceedings of the Joint Proceedings of the 8th, 2009

Automatic Verification of Directory-Based Consistency Protocols.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems, 3rd International Workshop, 2009

Infinite-State Verification: From Transition Systems to Markov Chains.

[BibT_eX]

[DOI]

Proceedings of the QEST 2009, 2009

A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

Minimal Cost Reachability/Coverability in Priced Timed Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2009

Approximated Context-Sensitive Analysis for Parameterized Verification.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques for Distributed Systems, 2009

Automated Analysis of Data-Dependent Programs with Dynamic Memory.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2009

2008

Model checking race-freeness.

[BibT_eX]

[DOI]

Frédéric Haziza

Mats Kindahl

SIGARCH Comput. Archit. News, 2008

Monotonic and Downward Closed Games.

[BibT_eX]

[DOI]

Julien d'Orso

J. Log. Comput., 2008

Universality Analysis for One-Clock Timed Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, 2008

Monotonic Abstraction in Parameterized Verification.

[BibT_eX]

[DOI]

Proceedings of the Second Workshop on Reachability Problems in Computational Models, 2008

Handling Parameterized Systems with Non-atomic Global Conditions.

[BibT_eX]

[DOI]

Proceedings of the Verification, 2008

Computing Simulations over Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

On the Qualitative Analysis of Conformon P Systems.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing - 9th International Workshop, 2008

Monotonic Abstraction in Action.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing, 2008

Stochastic Games with Lossy Channels.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2008

Parameterized Tree Systems.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2008

Shape Analysis via Monotonic Abstraction.

[BibT_eX]

[DOI]

Proceedings of the Beyond the Finite: New Challenges in Verification and Semistructured Data, 20.04., 2008

R-Automata.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

Monotonic Abstraction for Programs with Dynamic Memory Heaps.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 20th International Conference, 2008

2007

Using Forward Reachability Analysis for Verification of Timed Petri Nets.

[BibT_eX]

Nord. J. Comput., 2007

Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2007

Decisive Markov Chains.

[BibT_eX]

[DOI]

Noomene Ben Henda

Log. Methods Comput. Sci., 2007

Bisimulation Minimization of Tree Automata.

[BibT_eX]

[DOI]

Johanna Högberg

Lisa Kaati

Int. J. Found. Comput. Sci., 2007

Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems).

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

Zone-Based Universality Analysis for Single-Clock Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Fundamentals of Software Engineering, 2007

Sampled Universality of Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2007

Comparing the Expressive Power of Well-Structured Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

Parameterized Verification of Infinite-State Processes with Global Conditions.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 19th International Conference, 2007

2006

Tree regular model checking: A simulation-based approach.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2006

Limiting Behavior of Markov Chains with Eager Attractors.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on the Quantitative Evaluation of Systems (QEST 2006), 2006

06081 Abstracts Collection -- Software Verification: Infinite-State Model Checking and Static Program Analysis.

[BibT_eX]

[DOI]

Markus Müller-Olm

Proceedings of the Software Verification: Infinite-State Model Checking and Static Program Analysis, 19.02., 2006

06081 Executive Summary -- Software Verification: Infinite-State Model Checking and Static Program Analysis.

[BibT_eX]

[DOI]

Markus Müller-Olm

Proceedings of the Software Verification: Infinite-State Model Checking and Static Program Analysis, 19.02., 2006

Proving Liveness by Backwards Reachability.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

Eager Markov Chains.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2006

2005

Verification of probabilistic systems with faulty communication.

[BibT_eX]

[DOI]

Alexander Moshe Rabinovich

Nathalie Bertrand

Philippe Schnoebelen

Inf. Comput., 2005

Simulating perfect channels with probabilistic lossy channels.

[BibT_eX]

[DOI]

Christel Baier

Inf. Comput., 2005

Minimization of Non-deterministic Automata with Large Alphabets.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2005

Simulation-Based Iteration of Tree Transducers.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005

Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property.

[BibT_eX]

[DOI]

Noomene Ben Henda

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Decidability and Complexity Results for Timed Automata via Channel Machines.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Verification of Parameterized Timed Systems.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

2004

SAT-Solving the Coverability Problem for Petri Nets.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2004

Using Forward Reachability Analysis for Verification of Lossy Channel Systems.

[BibT_eX]

[DOI]

Aurore Collomb-Annichini

Formal Methods Syst. Des., 2004

Closed, Open, and Robust Timed Networks.

[BibT_eX]

[DOI]

Johann Deneux

Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, 2004

Better Quasi-Ordered Transition Systems

[BibT_eX]

[DOI]

CoRR, 2004

Multi-Clock Timed Networks.

[BibT_eX]

[DOI]

Johann Deneux

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Designing Safe, Reliable Systems Using Scade.

[BibT_eX]

[DOI]

Proceedings of the Leveraging Applications of Formal Methods, 2004

Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

Forward Reachability Analysis of Timed Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques, 2004

A Survey of Regular Model Checking.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003

Model checking of systems with many identical timed processes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Verification of Probabilistic Systems with Faulty Communication.

[BibT_eX]

[DOI]

Alexander Moshe Rabinovich

Proceedings of the Foundations of Software Science and Computational Structures, 2003

Deciding Monotonic Games.

[BibT_eX]

[DOI]

Julien d'Orso

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

Algorithmic Improvements in Regular Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2002

Regular Model Checking Made Simple and Efficient.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2002, 2002

Regular Tree Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 14th International Conference, 2002

2001

Ensuring completeness of symbolic verification methods for infinite-state systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Effective Lossy Queue Languages.

[BibT_eX]

[DOI]

Luc Boasson

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Channel Representations in Protocol Verification.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2001, 2001

Timed Petri Nets and BQOs.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets 2001, 2001

2000

Algorithmic Analysis of Programs with Well Quasi-ordered Domains.

[BibT_eX]

[DOI]

Inf. Comput., 2000

Symbolic Reachability Analysis Based on SAT-Solvers.

[BibT_eX]

[DOI]

Per Bjesse

Niklas Eén

Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 2000

Better is Better than Well: On Efficient Verification of Infinite-State Systems.

[BibT_eX]

[DOI]

Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

Reasoning about Probabilistic Lossy Channel Systems.

[BibT_eX]

[DOI]

Christel Baier

Proceedings of the CONCUR 2000, 2000

Invited Tutorial: Verification of Infinite-State and Parameterized Systems.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 12th International Conference, 2000

Unfoldings of Unbounded Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999

Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol.

[BibT_eX]

[DOI]

Aurore Annichini

Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1999

Handling Global Conditions in Parameterized System Verification.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 11th International Conference, 1999

Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 11th International Conference, 1999

On the Existence of Network Invariants for Verifying Parameterized Systems.

[BibT_eX]

[DOI]

Proceedings of the Correct System Design, 1999

1998

Verifying Networks of Timed Processes (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1998

Simulation Is Decidable for One-Counter Nets (Extended Abstract).

[BibT_eX]

[DOI]

Karlis Cerans

Proceedings of the CONCUR '98: Concurrency Theory, 1998

A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 10th International Conference, 1998

On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 10th International Conference, 1998

1997

An Improved Search Strategy for Lossy Channel Systems.

[BibT_eX]

Mats Kindahl

Doron A. Peled

Proceedings of the Formal Description Techniques and Protocol Specification, 1997

1996

Undecidable Verification Problems for Programs with Unreliable Channels.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Verifying Programs with Unreliable Channels.

[BibT_eX]

[DOI]

Inf. Comput., 1996

General Decidability Theorems for Infinite-State Systems.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 1996

1995

Decidability of Simulation and Bisimulation between Lossy Channel Systems and Finite State Systems (Extended Abstract).

[BibT_eX]

[DOI]

Mats Kindahl

Proceedings of the CONCUR '95: Concurrency Theory, 1995

1992

Automatic Verification of a Class Systolic Circuits.

[BibT_eX]

[DOI]

Formal Aspects Comput., 1992

1990

Decision problems in systolic circuit verification.

[BibT_eX]

[DOI]

PhD thesis, 1990

1988

An Equivalence Decision Problem in Systolic Array Verification.

[BibT_eX]