Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Le Gall, Tristan"'
Autor:
Le Gall, Tristan
L'analyse des systèmes communiquant par file a fait l'objet d'études scientifiques nombreuses mais qui n'ont pu offrir des solutions totalement satisfaisantes. Nous proposons d'aborder ce problème dans le cadre de l'interprétation abstraite, en d
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00424552
http://tel.archives-ouvertes.fr/docs/00/42/45/52/PDF/LeGall.pdf
http://tel.archives-ouvertes.fr/docs/00/42/45/52/PDF/LeGall.pdf
Publikováno v:
Accès en ligne.
Thèse doctorat : Informatique : Rennes 1 : 2008.
Titre provenant de la page du titre du document électronique. Bibliogr. p. 155-161.
Titre provenant de la page du titre du document électronique. Bibliogr. p. 155-161.
Publikováno v:
In Electronic Notes in Theoretical Computer Science 5 November 2012 287:65-76
Publikováno v:
Verification, Model Checking & Abstract Interpretation: 18th International Conference, VMCAI 2017, Paris, France, January 15-17, 2017, Proceedings; 2017, p73-90, 18p
Publikováno v:
[Research Report] RR-8260, INRIA. 2013
We consider the control of distributed systems composed of subsystems communicating asynchronously; the aim is to build local controllers that restrict the behavior of a distributed system in order to satisfy a global state avoidance property. We mod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::387f8f125a3a0d80b281292820106b54
https://hal.inria.fr/hal-00801840/file/RR-8620.pdf
https://hal.inria.fr/hal-00801840/file/RR-8620.pdf
Publikováno v:
FSTTCS 2012-IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
FSTTCS 2012-IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2012, Hyderabad, India. pp.224-235, ⟨10.4230/LIPIcs.FSTTCS.2012.224⟩
FSTTCS 2012-IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2012, Hyderabad, India. pp.224-235, ⟨10.4230/LIPIcs.FSTTCS.2012.224⟩
International audience; In order to verify protocols that tag messages with integer values, we investigate the decidability of the reachability problem for systems of communicating one-counter machines. These systems consist of local one-counter mach
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5bf3d804b17be723194af018dd2eed4
The technique of counterexample-guided abstraction refinement (Cegar) has been successfully applied in the areas of software and hardware verification. Automatic abstraction refinement is also desirable for the safety verification of complex in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______166::fc23b34b405f83df71443462ea29240d
https://hal.archives-ouvertes.fr/hal-00380517v2
https://hal.archives-ouvertes.fr/hal-00380517v2
Autor:
Le Gall, Tristan
Publikováno v:
Software Engineering [cs.SE]. Université Rennes 1, 2008. English. ⟨NNT : ⟩
Many scientific studies analysed the FIFO channel systems, but none offered a fully satisfying solution. We propose to tackle this problem within the abstract interpretation framework, by defining some abstract lattices adapted to this kind of system
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::8d934a2a4f1245671179c8506693730c
https://theses.hal.science/tel-00424552/document
https://theses.hal.science/tel-00424552/document
Autor:
Le Gall, Tristan, Jeannet, Bertrand
Publikováno v:
[Research Report] PI 1839, 2007, pp.36
Communication protocols can be formally described by the Communicating Finite-State Machines~(CFSM) model. This model is expressive, but not expressive enough to deal with complex protocols that involve structured messages encapsulating integers or l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::91c2fc8ac76ab0882554800557c8773f
https://hal.inria.fr/inria-00140831/document
https://hal.inria.fr/inria-00140831/document
Publikováno v:
[Rapport de recherche] RR-5474, INRIA. 2005, pp.30
Nous abordons le problème de la synthèse de contrôleurs à travers différents modèles allant des systèmes de transitions finis aux systèmes hybrides en nous intéressant à des propriétés de sûreté. Dans ce cadre, nous nous intéressons pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::6ba4897be75468e4c4376ccd7e901b15
https://inria.hal.science/inria-00070534/document
https://inria.hal.science/inria-00070534/document