The extraction of accurate finite-state models of higher-order or open programs is a difficult problem. We show how it can be addressed using newly developed game-semantic techniques and illustrate the solution with a model-checking tool based on such techniques. The approach has several important advantages over more traditional ones: precise account of inter-procedural behaviour, concise procedure summaries and economical extracted models. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Ghica, D. R., & Murawski, A. S. (2006). Compositional model extraction for higher-order concurrent programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3920 LNCS, pp. 303–317). https://doi.org/10.1007/11691372_20
Mendeley helps you to discover research relevant for your work.