Parosh Aziz Abdulla, Muhsin Atto, Jonathan Cederberg & Ran Ji (2009):
Automated Analysis of Data-Dependent Programs with Dynamic Memory.
In: Zhiming Liu & Anders P. Ravn: Automated Technology for Verification and Analysis, 7th International Symposium, ATVA 2009, Macao, China, October 14-16, 2009. Proceedings,
Lecture Notes in Computer Science 5799.
Springer,
pp. 197–212.
Available at https://doi.org/10.1007/978-3-642-04761-9_16.
Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson & Yih-Kuen Tsay (2000):
Algorithmic Analysis of Programs with Well Quasi-ordered Domains.
Inf. Comput. 160(1-2),
pp. 109–127,
doi:10.1006/inco.1999.2843.
Parosh Aziz Abdulla, Giorgio Delzanno, Noomene Ben Henda & Ahmed Rezine (2009):
Monotonic Abstraction: on Efficient Verification of Parameterized Systems.
Int. J. Found. Comput. Sci. 20(5),
pp. 779–801.
Available at https://doi.org/10.1142/S0129054109006887.
Sébastien Bardin, Alain Finkel, Étienne Lozes & Arnaud Sangnier (2006):
From Pointer Systems to Counter Systems Using Shape Analysis.
In: Ramesh Bharadwaj: Proceedings of the 5th International Workshop on Automated Verification of Infinite-State Systems (AVIS'06),
Vienna, Austria.
Available at http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BFLS-AVIS-06.pdf.
Michael Blondin, Alain Finkel & Jean Goubault-Larrecq (2017):
Forward Analysis for WSTS, Part III: Karp-Miller Trees.
In: Satya Lokam & R. Ramanujam: Proceedings of the 37th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'17),
Leibniz International Proceedings in Informatics 93.
Leibniz-Zentrum für Informatik,
Kanpur, India,
pp. 16:1–16:15,
doi:10.4230/LIPIcs.FSTTCS.2017.16.
Available at https://hal.archives-ouvertes.fr/hal-01736704/.
Daniel Brand & Pitro Zafiropulo (1983):
On Communicating Finite-State Machines.
J. ACM 30(2),
pp. 323–342.
Available at https://doi.org/10.1145/322374.322380.
Patrick Cousot & Radhia Cousot (1977):
Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints.
In: Robert M. Graham, Michael A. Harrison & Ravi Sethi: Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, USA, January 1977.
ACM,
pp. 238–252.
Available at https://doi.org/10.1145/512950.512973.
Giorgio Delzanno & Jan Stückrath (2014):
Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations.
In: Joël Ouaknine, Igor Potapov & James Worrell: Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings,
Lecture Notes in Computer Science 8762.
Springer,
pp. 72–84.
Available at https://doi.org/10.1007/978-3-319-11439-2_6.
Emanuele D'Osualdo & Felix Stutz (2019):
Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions.
CoRR abs/1911.05430.
Available at http://arxiv.org/abs/1911.05430.
Alain Finkel (1987):
A generalization of the procedure of Karp and Miller to well structured transition system.
In: Thomas Ottmann: Proceedings of the 14th International Colloquium on Automata, Languages and Programming (ICALP'87),
Lecture Notes in Computer Science 267.
Springer-Verlag,
Karlsruhe, Germany,
pp. 499–508,
doi:10.1007/3-540-18088-5_43.
Available at http://www.lsv.fr/Publis/PAPERS/PDF/F-icalp87.pdf.
Alain Finkel & Jean Goubault-Larrecq (2009):
Forward Analysis for WSTS, Part I: Completions.
In: Susanne Albers & Jean-Yves Marion: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings,
LIPIcs 3.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany,
pp. 433–444.
Available at https://doi.org/10.4230/LIPIcs.STACS.2009.1844.
Alain Finkel & Philippe Schnoebelen (1998):
Fundamental Structures in Well-Structured Infinite Transition Systems.
In: Claudio L. Lucchesi & Arnaldo V. Moura: Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (LATIN'98),
Lecture Notes in Computer Science 1380.
Springer,
Campinas, Brasil,
pp. 102–118,
doi:10.1007/BFb0054314.
Available at http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FinSch-latin98.ps.
Ekanshdeep Gupta & Alain Finkel (2019):
The well structured problem for Presburger counter machines.
In: Arkadev Chattopadhyay & Paul Gastin: Proceedings of the 39th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'19),
Leibniz International Proceedings in Informatics.
Leibniz-Zentrum für Informatik,
Bombay, India,
pp. 41:1–41:15,
doi:10.4230/LIPIcs.FSTTCS.2019.41.
Available at https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=11603.