Zobrazeno 1 - 10
of 86
pro vyhledávání: '"Valentin Wüstholz"'
Autor:
K. Rustan M. Leino, Valentin Wüstholz
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 149, Iss Proc. F-IDE 2014, Pp 3-15 (2014)
In recent years, program verifiers and interactive theorem provers have become more powerful and more suitable for verifying large programs or proofs. This has demonstrated the need for improving the user experience of these tools to increase product
Externí odkaz:
https://doaj.org/article/4fca39998e7643eeba9a798024237842
Autor:
Scott Wesley, Maria Christakis, Jorge A. Navas, Richard Trefler, Valentin Wüstholz, Arie Gurfinkel
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030945824
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4572a81747029148f4b51f975e49cc4a
https://doi.org/10.1007/978-3-030-94583-1_21
https://doi.org/10.1007/978-3-030-94583-1_21
Publikováno v:
ESEC/SIGSOFT FSE
ESEC/FSE '21
ESEC/FSE '21
Datalog is a popular query language with applications in several domains. Like any complex piece of software, Datalog engines may contain bugs. The most critical ones manifest as incorrect results when evaluating queries—we refer to these as query
Autor:
Valentin Wüstholz, Maria Christakis, Hasan Ferit Eniser, Yugesh Kothari, Jianlin Li, Jörg Hoffmann, Jorge A. Navas, Holger Hermanns
Publikováno v:
Computer Aided Verification ISBN: 9783030816841
CAV (1)
Computer Aided Verification
Lecture Notes in Computer Science
CAV (1)
Computer Aided Verification
Lecture Notes in Computer Science
State-of-the-art program-analysis techniques are not yet able to effectively verify safety properties of heterogeneous systems, that is, systems with components implemented using diverse technologies. This shortcoming is pinpointed by programs invoki
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::27732a1463b10d3b8a95b1a6943a8c27
https://doi.org/10.1007/978-3-030-81685-8_9
https://doi.org/10.1007/978-3-030-81685-8_9
Autor:
Jorge A. Navas, Richard J. Trefler, Valentin Wüstholz, Arie Gurfinkel, Scott Wesley, Maria Christakis
Publikováno v:
Static Analysis ISBN: 9783030888053
SAS
SAS
Solidity smart contracts are programs that manage up to \(2^{160}\) users on a blockchain. Verifying a smart contract relative to all users is intractable due to state explosion. Existing solutions either restrict the number of users to under-approxi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad3af132361ff363a695fcbfeb3d86de
https://doi.org/10.1007/978-3-030-88806-0_21
https://doi.org/10.1007/978-3-030-88806-0_21
Autor:
Valentin Wüstholz, Jorge A. Navas, Maria Christakis, Benjamin Mariano, Muhammad Numair Mansur
Publikováno v:
Computer Aided Verification
Lecture Notes in Computer Science
Computer Aided Verification ISBN: 9783030816872
CAV (2)
Lecture Notes in Computer Science
Computer Aided Verification ISBN: 9783030816872
CAV (2)
In recent years, there has been significant progress in the development and industrial adoption of static analyzers, specifically of abstract interpreters. Such analyzers typically provide a large, if not huge, number of configurable options controll
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99c37473b12bedd4444826443f01102b
https://hdl.handle.net/21.11116/0000-0009-578C-821.11116/0000-0009-578E-6
https://hdl.handle.net/21.11116/0000-0009-578C-821.11116/0000-0009-578E-6
Autor:
Valentin Wüstholz, Maria Christakis
Publikováno v:
ICSE
Automatic test generation typically aims to generate inputs that explore new paths in the program under test in order to find bugs. Existing work has, therefore, focused on guiding the exploration toward program parts that are more likely to contain
Publikováno v:
ESEC/FSE '20
ESEC/SIGSOFT FSE
ESEC/SIGSOFT FSE
Formal methods use SMT solvers extensively for deciding formula satisfiability, for instance, in software verification, systematic test generation, and program synthesis. However, due to their complex implementations, solvers may contain critical bug
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7ec17c64c9ee0e5669a01d3326c357fa
https://hdl.handle.net/21.11116/0000-0008-7707-B21.11116/0000-0009-6F5D-4
https://hdl.handle.net/21.11116/0000-0008-7707-B21.11116/0000-0009-6F5D-4
Publikováno v:
Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, 2020, 4 (OOPSLA), pp.1-30. ⟨10.1145/3428253⟩
Proceedings of the ACM on Programming Languages, ACM, 2020, 4 (OOPSLA), pp.1-30. ⟨10.1145/3428253⟩
Proceedings of the ACM on Programming Languages, 2020, 4 (OOPSLA), pp.1-30. ⟨10.1145/3428253⟩
Proceedings of the ACM on Programming Languages, ACM, 2020, 4 (OOPSLA), pp.1-30. ⟨10.1145/3428253⟩
International audience; Recently, there is growing concern that machine-learned software, which currently assists or even automates decision making, reproduces, and in the worst case reinforces, bias present in the training data. The development of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68136c549bcb93ba72c857f9e62c38cd
https://inria.hal.science/hal-02404036/file/fairness.pdf
https://inria.hal.science/hal-02404036/file/fairness.pdf