Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Radu Mereuta"'
Autor:
Andrei Stefanescu, Stefan Ciobaca, Radu Mereuta, Brandon Moore, Traian Florin Serbanuta, Grigore Rosu
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 2 (2019)
This paper presents a language-independent proof system for reachability properties of programs written in non-deterministic (e.g., concurrent) languages, referred to as all-path reachability logic. It derives partial-correctness properties with all-
Externí odkaz:
https://doaj.org/article/96a8baa5bbcb494daa698a3cb86a7923
Autor:
Radu Mereuta, Traian Florin Serbanuta, Grigore Rosu, Andrei Stefanescu, Ştefan Ciobâcă, Brandon Moore
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319089171
RTA-TLCA
RTA-TLCA
This paper presents a language-independent proof system for reachability properties of programs written in non-deterministic (e.g., concurrent) languages, referred to as all-path reachability logic. It derives partial-correctness properties with all-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6be5853b558dca10c78f85003f248b62
https://doi.org/10.1007/978-3-319-08918-8_29
https://doi.org/10.1007/978-3-319-08918-8_29
Autor:
Andrei Arusoaie, Chucky Ellison, David Lazar, Grigore Rosu, Traian Florin Şerbǎnuţǎ, Dorel Lucanu, Radu Mereuta
Publikováno v:
FM 2012: Formal Methods ISBN: 9783642327582
This paper describes the \(\mathbb K\) Tool, a system for formally defining programming languages. Formal definitions created using the \(\mathbb K\) Tool automatically yield an interpreter for the language, as well as program analysis tools such as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33c394059c38d7a133d6d985f50a8722
https://doi.org/10.1007/978-3-642-32759-9_23
https://doi.org/10.1007/978-3-642-32759-9_23