Zobrazeno 1 - 10
of 84
pro vyhledávání: '"Formal software verification"'
Autor:
Gaboardi, Marco, van Raamsdonk, Femke
LIPIcs, Volume 260, FSCD 2023, Complete Volume
LIPIcs, Vol. 260, 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), pages 1-658
LIPIcs, Vol. 260, 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), pages 1-658
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::603f7fe1e8cc5998c955dbe46fbe587a
https://drops.dagstuhl.de/opus/volltexte/2023/17983/
https://drops.dagstuhl.de/opus/volltexte/2023/17983/
Local-first software manages and processes private data locally while still enabling collaboration between multiple parties connected via partially unreliable networks. Such software typically involves interactions with users and the execution enviro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e3932b100becdcd9b4646fd95f287ee
Autor:
Gaboardi, Marco, van Raamsdonk, Femke
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 260, 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), pages 0:i-0:xviii
LIPIcs, Vol. 260, 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), pages 0:i-0:xviii
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66e61de0bd7a314830af6d0477319d2a
Autor:
Matthieu Lemerre
Publikováno v:
Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, 2023, POPL 2023-the 50th ACM SIGPLAN Symposium on Principles of Programming Languages, 7, pp.65. ⟨10.1145/3571258⟩
Proceedings of the ACM on Programming Languages, 2023, POPL 2023-the 50th ACM SIGPLAN Symposium on Principles of Programming Languages, 7, pp.65. ⟨10.1145/3571258⟩
the 50th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2023), 15 to 21 January 2023, Boston (MA) USA; International audience; Static single assignment (SSA) form is a popular intermediate representation that helps implement usefu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d25252df24128dbf8538b88b3a8b2e7c
https://cea.hal.science/cea-03849637/document
https://cea.hal.science/cea-03849637/document
Local-first software manages and processes private data locally while still enabling collaboration between multiple parties connected via partially unreliable networks. Such software typically involves interactions with users and the execution enviro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ea042219855bf8302e71d7b4623ac68
Publikováno v:
Leibniz International Proceedings in Informatics (LIPIcs)
13th International Conference on Interactive Theorem Proving (ITP 2022)
13th International Conference on Interactive Theorem Proving (ITP 2022), Aug 2022, Haifa, Israel. pp.18:1--18:18, ⟨10.4230/LIPIcs.ITP.2022.18⟩
13th International Conference on Interactive Theorem Proving (ITP 2022)
13th International Conference on Interactive Theorem Proving (ITP 2022), Aug 2022, Haifa, Israel. pp.18:1--18:18, ⟨10.4230/LIPIcs.ITP.2022.18⟩
As the adoption of proof assistants increases, there is a need for efficiency in identifying, documenting, and fixing compatibility issues that arise from proof-assistant evolution. We present the Coq Bug Minimizer, a tool for reproducing buggy behav
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::533ecf2b9b3a10191f0df771843d2540
https://inria.hal.science/hal-03586813v2/file/coq-bug-minimizer.pdf
https://inria.hal.science/hal-03586813v2/file/coq-bug-minimizer.pdf
Bounded verification techniques such as bounded model checking (BMC) have successfully been used for many practical program analysis problems, but concurrency still poses a challenge. Here, we describe a new approach to BMC of sequentially consistent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35b56d128b9b87be3702a52c979ab977
http://hdl.handle.net/11695/100659
http://hdl.handle.net/11695/100659
Elementary function operations such as sin and exp cannot in general be computed exactly on today’s digital computers, and thus have to be approximated. The standard approximations in library functions typically provide only a limited set of precis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e8aa548bf5cdb9933315ae51b7ce022
http://arxiv.org/abs/2202.05472
http://arxiv.org/abs/2202.05472
Publikováno v:
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Jul 2021, Glasgow (virtual), United Kingdom. ⟨10.4230/LIPIcs.ICALP.2021.137⟩
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Jul 2021, Glasgow (virtual), United Kingdom. ⟨10.4230/LIPIcs.ICALP.2021.137⟩
Weighted timed games are two-player zero-sum games played in a timed automaton equipped with integer weights. We consider optimal reachability objectives, in which one of the players, that we call Min, wants to reach a target location while minimisin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::033a1f5a356b1f739489d772d4fa0cd8
https://hal.archives-ouvertes.fr/hal-03282049/file/LIPIcs-ICALP-2021-137.pdf
https://hal.archives-ouvertes.fr/hal-03282049/file/LIPIcs-ICALP-2021-137.pdf
Autor:
Holík, Lukáš, Peringer, Petr, Rogalewicz, Adam, Šoková, Veronika, Vojnar, Tomáš, Zuleger, Florian
The paper proposes a new static analysis designed to handle open programs, i.e., fragments of programs, with dynamic pointer-linked data structures - in particular, various kinds of lists - that employ advanced low-level pointer operations. The goal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e23cc08e25efd3ad14e881675fb0f41