Solving Coverability Problem for Monotonic Counter Systems by Supercompilation-Reference-Cited by-同舟云学术

Solving Coverability Problem for Monotonic Counter Systems by Supercompilation

Published:2012 Issue: Volume: Page:193-209
ISSN:0302-9743
Container-title:Perspectives of Systems Informatics
language:
Short-container-title:

Author:

Klimov Andrei V.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-29709-0_18.pdf

Reference28 articles.

1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, July 27-30, pp. 313–321. IEEE Computer Society (1996)

2. Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: acceleration from theory to practice. International Journal on Software Tools for Technology Transfer 10(5), 401–424 (2008)

3. Lecture Notes in Computer Science;C. Dufourd,1998

4. Lecture Notes in Computer Science;A. Finkel,1993

5. Geeraerts, G.: Coverability and Expressiveness Properties of Well-Structured Transition Systems. PhD thesis, Université Libre de Bruxelles, Belgique (May 2007), http://www.ulb.ac.be/di/verif/ggeeraer/thesis.pdf

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Experiment in Ping-Pong Protocol Verification by Nondeterministic Pushdown Automata;Electronic Proceedings in Theoretical Computer Science;2018-03-23

2. Verification of Programs via Intermediate Interpretation;Electronic Proceedings in Theoretical Computer Science;2017-08-23

3. Ping-pong protocols as prefix grammars: Modelling and verification via program transformation;Journal of Logical and Algebraic Methods in Programming;2016-08

4. Finite Countermodel Based Verification for Program Transformation (A Case Study);Electronic Proceedings in Theoretical Computer Science;2015-12-07

5. Supercompilation for Datatypes;Lecture Notes in Computer Science;2015