Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Roberto Bagnara"'
Verification of C/C++ programs has seen considerable progress in several areas, but not for programs that use these languages’ mathematical libraries. The reason is that all libraries in widespread use come with no guarantees about the computed res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c06c78e1587231fd9758049ea275d7ff
http://hdl.handle.net/11311/1167172
http://hdl.handle.net/11311/1167172
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d69dcc6e779bdbc68d98a07c7da4c96c
Publikováno v:
Static Analysis ISBN: 9783319997247
SAS
SAS
The MISRA project started in 1990 with the mission of providing world-leading best practice guidelines for the safe and secure application of both embedded control systems and standalone software. MISRA C is a coding standard defining a subset of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7061fc371bb3345b1481d7acf18567b5
https://doi.org/10.1007/978-3-319-99725-4_2
https://doi.org/10.1007/978-3-319-99725-4_2
Floating-point computations are quickly finding their way in the design of safety- and mission-critical systems, despite the fact that designing floating-point algorithms is significantly more difficult than designing integer algorithms. For this rea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3d3b3981c48abdb01519befb38e7b05e
http://hdl.handle.net/11568/784269
http://hdl.handle.net/11568/784269
Publikováno v:
Theoretical Computer Science. 410:4672-4691
Convex polyhedra are the basis for several abstractions used in static analysis and computer-aided verification of complex and sometimes mission critical systems. For such applications, the identification of an appropriate complexity-precision trade-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::97287767ab593e1c0c09334b3309069f
https://doi.org/10.1016/j.tcs.2009.07.033
https://doi.org/10.1016/j.tcs.2009.07.033
Publikováno v:
Formal Methods in System Design. 35:279-323
Weakly-relational numeric constraints provide a compromise between complexity and expressivity that is adequate for several applications in the field of formal analysis and verification of software and hardware systems. We address the problems to be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de7f47d911b9ec3cb99ed9b0f94bc290
https://doi.org/10.1007/s10703-009-0073-1
https://doi.org/10.1007/s10703-009-0073-1
Publikováno v:
Science of Computer Programming. 72(1-2):3-21
Since its inception as a student project in 2001, initially just for the handling (as the name implies) of convex polyhedra, the Parma Polyhedra Library has been continuously improved and extended by joining scrupulous research on the theoretical fou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::512fc537ada1e3f7e5f8b445982f4c5e
Publikováno v:
International Journal on Software Tools for Technology Transfer. 8:449-466
The finite powerset construction upgrades an abstract domain by allowing for the representation of finite disjunctions of its elements. While most of the operations on the finite powerset abstract domain are easily obtained by “lifting” the corre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d9cdf63b6c8211d9f00ec9bc7d8c7b7c
https://doi.org/10.1007/s10009-005-0215-8
https://doi.org/10.1007/s10009-005-0215-8
Publikováno v:
Formal Aspects of Computing. 17:222-257
Since the seminal work of Cousot and Halbwachs, the domain of convex polyhedra has been employed in several systems for the analysis and verification of hardware and software components. Although most implementations of the polyhedral operations assu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30a7916fac6dcf6b06fcbd18bec68f4b
https://doi.org/10.1007/s00165-005-0061-1
https://doi.org/10.1007/s00165-005-0061-1
Autor:
Roberto Bagnara, Fred Mesnard
Publikováno v:
Theory and Practice of Logic Programming. 5:243-257
We present cTI, the first system for universal left-termination inference of logic programs. Termination inference generalizes termination analysis and checking. Traditionally, a termination analyzer tries to prove that a given class of queries termi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dcf7e42a07b39a5a21620b135999c4cb
https://doi.org/10.1017/s1471068404002017
https://doi.org/10.1017/s1471068404002017