Finkel, Alain; Goubault-Larrecq, Jean Forward analysis for WSTS. I: Completions. (English) Zbl 1491.68122 Math. Struct. Comput. Sci. 30, No. 7, 752-832 (2020). MSC: 68Q85 54H30 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI
Czerwiński, Wojciech; Lasota, Slawomir; Meyer, Roland; Muskalla, Sebastian; Narayan, Kumar K.; Saivasan, Prakash Regular separability of well-structured transition systems. (English) Zbl 1520.68092 Schewe, Sven (ed.) et al., 29th international conference on concurrency theory. CONCUR 2018, Beijing, China, September 4–7, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 118, Article 35, 18 p. (2018). MSC: 68Q85 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Blondin, Michael; Finkel, Alain; McKenzie, Pierre Handling infinitely branching well-structured transition systems. (English) Zbl 1383.68054 Inf. Comput. 258, 28-49 (2018). MSC: 68Q85 × Cite Format Result Cite Review PDF Full Text: DOI
Abdulla, Parosh A.; Haziza, Fréderic; Holík, Luká View abstraction – a tutorial (invited paper). (English) Zbl 1429.68137 André, Étienne (ed.) et al., 2nd international workshop on synthesis of complex parameters, SynCoP’15, April 11, 2015, London, UK. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 44, 1-15 (2015). MSC: 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI
Rosa-Velardo, Fernando Petri nets with name creation for transient secure association. (English) Zbl 1360.68635 Acta Inf. 50, No. 7-8, 403-436 (2013). MSC: 68Q85 × Cite Format Result Cite Review PDF Full Text: DOI
Rosa-Velardo, Fernando; Martos-Salgado, María Multiset rewriting for the verification of depth-bounded processes with name binding. (English) Zbl 1277.68204 Inf. Comput. 215, 68-87 (2012). MSC: 68Q85 68Q42 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI
Zufferey, Damien; Wies, Thomas; Henzinger, Thomas A. Ideal abstractions for well-structured transition systems. (English) Zbl 1326.68205 Kuncak, Viktor (ed.) et al., Verification, model checking, and abstract interpretation. 13th international conference, VMCAI 2012, Philadelphia, PA, USA, January 22–24, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-27939-3/pbk). Lecture Notes in Computer Science 7148, 445-460 (2012). MSC: 68Q85 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI
Atig, Mohamed Faouzi; Bouajjani, Ahmed; Burckhardt, Sebastian; Musuvathi, Madanlal On the verification problem for weak memory models. (English) Zbl 1312.68050 Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’10, Madrid, Spain, January 17–23, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-479-9). 7-18 (2010). MSC: 68N30 68M07 68N19 × Cite Format Result Cite Review PDF Full Text: DOI
Atig, Mohamed Faouzi; Bouajjani, Ahmed; Qadeer, Shaz Context-bounded analysis for concurrent programs with dynamic creation of threads. (English) Zbl 1234.68068 Kowalewski, Stefan (ed.) et al., Tools and algorithms for the construction and analysis of systems. 15th international conference, TACAS 2009, held as part of the joint European conferences on theory and practice of software, ETAPS 2009, York, UK, March 22–29, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00767-5/pbk). Lecture Notes in Computer Science 5505, 107-123 (2009). MSC: 68N30 68Q60 68Q85 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Ranzato, Francesco; Doria, Olivia Rossi; Tapparo, Francesco A forward-backward abstraction refinement algorithm. (English) Zbl 1138.68458 Logozzo, Francesco (ed.) et al., Verification, model checking, and abstract interpretation. 9th international conference, VMCAI 2008, San Francisco, USA, January 7–9, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78162-2/pbk). Lecture Notes in Computer Science 4905, 248-262 (2008). MSC: 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI