Zobrazeno 1 - 10
of 44
pro vyhledávání: '"CHIARI, MICHELE"'
Operator Precedence Languages (OPL) have been recently identified as a suitable formalism for model checking recursive procedural programs, thanks to their ability of modeling the program stack. OPL requirements can be expressed in the Precedence Ori
Externí odkaz:
http://arxiv.org/abs/2405.11327
We address the problem of model checking temporal logic specifications for discrete probabilistic programs with recursive procedures, nested queries, and hard conditioning expressed with observe statements. We give them an operational semantics in te
Externí odkaz:
http://arxiv.org/abs/2404.03515
Operator precedence languages (OPL) enjoy the local parsability property, which essentially means that a code fragment enclosed within a pair of markers -- playing the role of parentheses -- can be compiled with no knowledge of its external context.
Externí odkaz:
http://arxiv.org/abs/2309.04200
Publikováno v:
IEEE 19th International Conference on Software Architecture Companion (ICSA-C), 2022, pp. 218-225
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:
http://arxiv.org/abs/2206.10344
Autor:
Chiari, Michele, Xiang, Bin, Canzoneri, Sergio, Nedeltcheva, Galia Novakova, Di Nitto, Elisabetta, Blasi, Lorenzo, Benedetto, Debora, Niculut, Laurentiu, Škof, Igor
Publikováno v:
In Information Systems November 2024 125
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 3 (July 29, 2022) lmcs:8355
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:
http://arxiv.org/abs/2105.10740
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:
http://arxiv.org/abs/1910.09327
Publikováno v:
Constraints 27, 29-69, 2022
Verification of programs using floating-point arithmetic is challenging on several accounts. One of the difficulties of reasoning about such programs is due to the peculiarities of floating-point arithmetic: rounding errors, infinities, non-numeric o
Externí odkaz:
http://arxiv.org/abs/1903.06119
Publikováno v:
EPTCS 277, 2018, pp. 161-175
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:
http://arxiv.org/abs/1809.03100
Autor:
CHIARI, MICHELE1 michele.chiari@polimi.it, MANDRIOLI, DINO2 francesco.pontiggia@tuwien.ac.at, PONTIGGIA, FRANCESCO1 dino.mandrioli@polimi.it, PRADELLA, MATTEO3 matteo.pradella@polimi.it
Publikováno v:
ACM Transactions on Programming Languages & Systems. Sep2023, Vol. 45 Issue 3, p1-66. 66p.