Zobrazeno 1 - 10
of 164
pro vyhledávání: '"Giannakopoulou, D"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Verified Software: Theories, Tools and Experiments ISBN: 9783319121536
VSTTE
Lecture Notes in Computer Science, 150-166. S.l. : Springer International Publishing
STARTPAGE=150;ENDPAGE=166;TITLE=Lecture Notes in Computer Science
Giannakopoulou, D.; Kroening, D. (ed.), Verified Software: Theories, Tools and Experiments, pp. 150-166
VSTTE
Lecture Notes in Computer Science, 150-166. S.l. : Springer International Publishing
STARTPAGE=150;ENDPAGE=166;TITLE=Lecture Notes in Computer Science
Giannakopoulou, D.; Kroening, D. (ed.), Verified Software: Theories, Tools and Experiments, pp. 150-166
Separation algebras are a well-known abstraction to capture common structure of both permissions and memories in programming languages, and form the basis of models of separation logic. As part of the development of a formal version of an operational
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::785988816f8a74e9e546ce48337f0d6b
https://doi.org/10.1007/978-3-319-12154-3_10
https://doi.org/10.1007/978-3-319-12154-3_10
Publikováno v:
FM 2012: Formal Methods ISBN: 9783642327582
FM
Giannakopoulou, D. (ed.), FM 2012 : Formal Methods :18th International Symposium, Paris, France, August 27-31, 2012. Proceedings, pp. 10-27
Lecture Notes in Computer Science ; 7436, 10-27. Berlin : Springer
STARTPAGE=10;ENDPAGE=27;TITLE=Lecture Notes in Computer Science ; 7436
FM
Giannakopoulou, D. (ed.), FM 2012 : Formal Methods :18th International Symposium, Paris, France, August 27-31, 2012. Proceedings, pp. 10-27
Lecture Notes in Computer Science ; 7436, 10-27. Berlin : Springer
STARTPAGE=10;ENDPAGE=27;TITLE=Lecture Notes in Computer Science ; 7436
ion is the key when learning behavioral models of realistic systems. Hence, in most practical applications where automata learning is used to construct models of software components, researchers manually define abstractions which, depending on the hi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8d017c5048b13e5c13754be14da9661
https://doi.org/10.1007/978-3-642-32759-9_4
https://doi.org/10.1007/978-3-642-32759-9_4
Publikováno v:
Software Engineering and Formal Methods (12th International Conference, SEFM 2014, Grenoble, France, September 1-5, 2014. Proceedings), 81-95
STARTPAGE=81;ENDPAGE=95;TITLE=Software Engineering and Formal Methods (12th International Conference, SEFM 2014, Grenoble, France, September 1-5, 2014. Proceedings)
Software Engineering and Formal Methods ISBN: 9783319104300
SEFM
STARTPAGE=81;ENDPAGE=95;TITLE=Software Engineering and Formal Methods (12th International Conference, SEFM 2014, Grenoble, France, September 1-5, 2014. Proceedings)
Software Engineering and Formal Methods ISBN: 9783319104300
SEFM
A Domain Specific Language (DSL) focuses on the essential concepts in a certain problem domain, thus abstracting from low-level implementation details. In combination with code generators, DSLs bring software development closer to domain requirements
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d823f4590b2bdf61c119d78b0c15b264
https://research.tue.nl/nl/publications/a8938e0d-1eb2-42af-a38a-0c93c8c2dd6a
https://research.tue.nl/nl/publications/a8938e0d-1eb2-42af-a38a-0c93c8c2dd6a
Autor:
Holzer, A, Januzaj, V, Kugele, S, Langer, B, Schallhart, C, Tautschnig, M, Veith, H, Giannakopoulou, D, Orejas, F
Publikováno v:
FASE. 6603
This paper describes an approach to model-based testing where a test suite is generated from a model and automatically concretized to drive an implementation. Motivated by an industrial project involving DO-178B compliant avionics software, where the
Autor:
Giannakopoulou, D
The Bounded Retransmission Protocol is an industrial protocol designed for the transfer of large data files over unreliable communication lines. The protocol relies on specific assumptions on the timed behaviour of its components. This paper describe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1087b34d8d99c0698829b274cfc9a28
http://hdl.handle.net/10044/1/95500
http://hdl.handle.net/10044/1/95500
The liveness characteristics of a system are intimately related to the notion of fairness. However, the task of modelling explicitly fairness constraints is complicated in practice. To address this issue, we propose to check LTS (Labelled Transition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b63680e3710c72aa24aca3ea54da5157
http://hdl.handle.net/10044/1/95450
http://hdl.handle.net/10044/1/95450
The liveness characteristics of a system are intimately related to the notion of fairness. However, the task of explicitly modelling fairness constraints is complicated in practice. To address this issue, we propose to check LTS (Labelled Transition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57292da0e7502b56bba9e032041b56bc
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.