| I. Vernier. Specification and Verification of Parametrized Parallel Programs. In Proceedings of the 8th International Symposium on Computer and Information Sciences, Istanbul, Turkey, pages 622-625,1993. |
.... but not guaranteed complete (i.e. a path upstairs maps to a path downstairs , but paths downstairs do not necessarily lift) Other methods can be fully automated but do not appear to have a clearly defined class of protocols on which they are guaranteed to terminate successfully (cf. 5] [23], 21] For systems with CCS processes German and Sistla [11] combine automata theoretic method with process closures to permit efficient solution to PMCP for single index properties, modulo deadlock. But efficient solution is only yielded for processes in a single class. Even for systems of ....
I. Vernier. Specification and Verification of Parametrized Parallel Programs. In Proceedings of the 8th International Symposium on Computer and Information Sciences, Istanbul, Turkey, pages 622-625,1993.
....the number of processes or on relations between the number of processes and the number of resources. An advantage of our restriction is that the operations on the symbolic markings are easy and fully automated. Another extension of our work will be the consideration of more complex programs. In [16] we have presented a model that allows one to distinguish dynamically the behavior of one process. We describe in [17] the adaptation of the symbolic execution algorithm. It will be important to study the effects of the extensions of the exhaustive execution algorithms on the possibility to ....
Vernier I., "Specification And Verification of Parametrized Parallel Programs", Proceedings of the 8th International Symposium on Computer and Information Sciences, Istanbul, Turkey, pp 622-625, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC