Zobrazeno 1 - 10
of 77
pro vyhledávání: '"Matteo Pradella"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023)
A classic result in formal language theory is the equivalence among non-counting, or aperiodic, regular languages, and languages defined through star-free regular expressions, or first-order logic. Past attempts to extend this result beyond the realm
Externí odkaz:
https://doaj.org/article/5d1170c08f27440eab8ca7866d52c795
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 3 (2022)
The problem of model checking procedural programs has fostered much research towards the definition of temporal logics for reasoning on context-free structures. The most notable of such results are temporal logics on Nested Words, such as CaRet and N
Externí odkaz:
https://doaj.org/article/73adab1879684000bbab3d8f533fd2cc
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 277, Iss Proc. GandALF 2018, Pp 161-175 (2018)
In the last decades much research effort has been devoted to extending the success of model checking from the traditional field of finite state machines and various versions of temporal logics to suitable subclasses of context-free languages and appr
Externí odkaz:
https://doaj.org/article/5679436e4e8d4f659d073b7adb0c9530
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 252, Iss Proc. AFL 2017, Pp 86-100 (2017)
Floyd's Operator Precedence (OP) languages are a deterministic context-free family having many desirable properties. They are locally and parallely parsable, and languages having a compatible structure are closed under Boolean operations, concatenati
Externí odkaz:
https://doaj.org/article/d251d0cf07ef4364aa427be8074f8c2f
The open access book set LNCS 14933 + 14934 constitutes the refereed proceedings of the 26th International Symposium on Formal Methods, FM 2024, which took place in Milan, Italy, in September 2024. The 51 full and 4 short papers included in these pro
Autor:
Violetta Lonati, Matteo Pradella
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 12 no. 4 (2010)
special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Applications
Externí odkaz:
https://doaj.org/article/0bde70e561c5406c8873af6c29e13fe2
This deliverable describes the development of the model checking tool for IaC in the PIACERE project. The DOML Model Checker (KR5) performs consistency checks on DOML models provided by the user, highlight-ing common mistakes and issues that might pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5554238ec1f12830f658d13d3e7c67ef
This deliverable describes the development of the model checking tool for IaC in the PIACERE project. The DOML Model Checker (KR5) performs consistency checks on DOML models provided by the user, highlight-ing common mistakes and issues that might pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::778a3c7c9e006bfc100407b888fdce60
The increasing use of Infrastructure as Code (IaC) in DevOps leads to benefits in speed and reliability of deployment operation, but extends to infrastructure challenges typical of software systems. IaC scripts can contain defects that result in secu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58940a3bd5871bafe7b4b044bb909f4f
http://hdl.handle.net/11311/1218760
http://hdl.handle.net/11311/1218760
In the last years renewed investigation of operator precedence languages (OPL) led to discover important properties thereof: OPL are closed with respect to all major operations, are characterized, besides the original grammar family, in terms of an a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af2206595874c6f2e76c16406e779c1c
http://hdl.handle.net/11311/1199465
http://hdl.handle.net/11311/1199465