Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Marianne Simonot"'
Publikováno v:
L'objet. 14:73-102
Les applications auto-adaptables modi?ent leur comportement de facon dynamique et autonome par le biais doperations dintrospection, de recomposition, dajout et suppression de composants, dans le but de sadapter aux changements pouvant surveni
Publikováno v:
Electronic Notes in Theoretical Computer Science. 66(2):84-103
This paper presents two examples taken from industrial case-studies that have been specified using an event system approach. Component specifications, taking the form of pre-post formula, have been derived. Constraints which ensure the correctness of
Autor:
Marianne Simonot, François Monin
Publikováno v:
Theoretical Computer Science. 254(1-2):63-94
This paper describes a method for proving termination of recursively defined functions based on ordinal measure. It generalizes a termination procedure developed by Manoury and Simonot initially for an automated program synthesis system called ProPre
Autor:
Virginia Aponte, Marianne Simonot
Publikováno v:
Proceedings of the 1st international workshop on Open component ecosystems.
Self-adapting software adapts its behavior in an autonomic way, by dynamically adding, suppressing and recomposing components, and by the use of computational reflection. One way to enforce software robustness while adding adaptative behavior is disp
Publikováno v:
ZB 2000: Formal Specification and Development in Z and B ISBN: 9783540679448
ZB
ZB
We present a method to derive sequential program specifications from system models. We use an event based approach to model systems, as it allows us to specify parallel, concurrent and distributed systems. We refine the specification of a system unti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2d80ecc5b84293f40ca14310906c0e7
https://doi.org/10.1007/3-540-44525-0_13
https://doi.org/10.1007/3-540-44525-0_13
Autor:
Marianne Simonot, Pascal Manoury
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 1994, pp 319-343
Theoretical Computer Science, Elsevier, 1994, pp 319-343
This paper describes a fully automated strategy for proving termination of functions defined by recursive equations. This strategy has been implemented in the ProPre program synthesis system as one of the mechanism that leads from specifications of f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c788e3460dec8fd531a6be71ed5a4d0c
https://hal.archives-ouvertes.fr/hal-00528475
https://hal.archives-ouvertes.fr/hal-00528475