Graph models for reachability analysis of concurrent programs

Дата публикации: 25-02-2020 03:02:00

Reachability analysis is an attractive technique for analysis of concurrent programs because it is simple and relatively straightforward to automate, and can be used in conjunction with model-checking procedures to check for application-specific as well as general properties. Several techniques have been proposed differing mainly on the model used; some of these propose the use of flowgraph based models, some others of Petri nets.
This paper addresses the question: What essential difference does it make, if any, what sort of finite-state model we extract from program texts for purposes of reachability analysis? How do they differ in expressive power, decision power, or accuracy? Since each is intended to model synchronization structure while abstracting away other features, one would expect them to be roughly equivalent.
We confirm that there is no essential semantic difference between the most well known models proposed in the literature by providing algorithms...

Схожие новости

#	Наименование новости	Тональность	Информативность	Дата публикации
1	Гостиничная стойка, усталость, чемоданы под ногами и детское: «Ну когда ...	0	7.07	14-08-2026

Классификация: . Схожих патентов: 0. Схожая новость: 1. Тональность: 0. Информативность: 0. Источник: escholarship.org.