Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Verification of infinite systems"'
Autor:
Frédéric Mallet, Robert de Simone
Publikováno v:
Science of Computer Programming
Science of Computer Programming, Elsevier, 2015, 106, pp.78-92. ⟨10.1016/j.scico.2015.03.001⟩
Science of Computer Programming, 2015, 106, pp.78-92. ⟨10.1016/j.scico.2015.03.001⟩
Science of Computer Programming, Elsevier, 2015, 106, pp.78-92. ⟨10.1016/j.scico.2015.03.001⟩
Science of Computer Programming, 2015, 106, pp.78-92. ⟨10.1016/j.scico.2015.03.001⟩
The UML Profile for Modeling and Analysis of Real-Time and Embedded systems promises a general modeling framework to design and analyze systems. Lots of works have been published on the modeling capabilities offered by MARTE, much less on available v
Autor:
Schmitz, Sylvain
Publikováno v:
Software Engineering [cs.SE]. Université Nice Sophia Antipolis, 2007. English
Programming language developers are blessed with the availability of efficient, powerful tools for parser generation. But even with automated help, the implementation of a parser remains often overly complex.Although programs should convey an unambig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::ed198214d06d6a67841cf6bc8084e2ad
https://tel.archives-ouvertes.fr/tel-00271168
https://tel.archives-ouvertes.fr/tel-00271168
Autor:
Schmitz, Sylvain
Publikováno v:
Software Engineering [cs.SE]. Université Nice Sophia Antipolis, 2007. English
Programming language developers are blessed with the availability of efficient, powerful tools for parser generation. But even with automated help, the implementation of a parser remains often overly complex.Although programs should convey an unambig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2592::ed198214d06d6a67841cf6bc8084e2ad
https://tel.archives-ouvertes.fr/tel-00271168
https://tel.archives-ouvertes.fr/tel-00271168
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
Autor:
Cachera, David, Morin-Allory, Katell
Publikováno v:
[Research Report] RR-4756, INRIA. 2003
We propose a combination of heuristic methods to prove properties of control signals for regular systems defined by means of affine recurrence equations (AREs). We benefit from the intrinsic regularity of the polyhedral model to handle parameterized
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e78a8492628caeaabde4d8c39eec778f
https://hal.inria.fr/inria-00071830/document
https://hal.inria.fr/inria-00071830/document