Zobrazeno 1 - 10
of 65
pro vyhledávání: '"George C. Necula"'
Publikováno v:
ICSE
In recent years, several automated GUI testing techniques for Android apps have been proposed. These tools have been shown to be effective in achieving good test coverage and in finding bugs without human intervention. Being automated, these tools ty
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed5ab88f99e23cd579b92f6c3a86f341
https://doi.org/10.1145/3180155.3180173
https://doi.org/10.1145/3180155.3180173
Publikováno v:
OOPSLA
Event-driven user interface applications typically have a single thread of execution that processes event handlers in response to input events triggered by the user, the network, or other applications. Programmers must ensure that event handlers term
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94c2ef122a8c9aaf9ceb3679e2018bc6
https://doi.org/10.1145/2714064.2660233
https://doi.org/10.1145/2714064.2660233
Publikováno v:
PLDI
We present CONCURRIT, a domain-specific language (DSL) for reproducing concurrency bugs. Given some partial information about the nature of a bug in an application, a programmer can write a CONCURRIT script to formally and concisely specify a set of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c72278a907784fb0cb4458356096559
https://doi.org/10.1145/2499370.2462162
https://doi.org/10.1145/2499370.2462162
Autor:
George C. Necula, Westley Weimer
Publikováno v:
ACM Transactions on Programming Languages and Systems. 30:1-51
It is difficult to write programs that behave correctly in the presence of run-time errors. Proper behavior in the face of exceptional situations is important to the reliability of long-running programs. Existing programming language features often p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bbb0ecbdd189ae51ac5d10512da4e63f
https://doi.org/10.1145/1330017.1330019
https://doi.org/10.1145/1330017.1330019
Autor:
George C. Necula, Sumit Gulwani
Publikováno v:
Science of Computer Programming. 64:97-114
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non-deterministic and all program operators as uninterpreted. We show tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::37a8305fba88a40b5fe5039b514d8924
https://doi.org/10.1016/j.scico.2006.03.005
https://doi.org/10.1016/j.scico.2006.03.005
Publikováno v:
ESEC/SIGSOFT FSE
Dynamic symbolic execution (DSE) has been proposed to effectively generate test inputs for real-world programs. Unfortunately, DSE techniques do not scale well for large realistic programs, because often the number of feasible execution paths of a pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61b3c04d0b7c0fc9758a978a435d9ae2
https://doi.org/10.1145/2786805.2786830
https://doi.org/10.1145/2786805.2786830
Publikováno v:
Static Analysis ISBN: 9783662482872
SAS
SAS
We propose a static type system for a significant subset of JavaScript, dubbed SJS, with the goal of ensuring that objects have a statically known layout at the allocation time, which in turn can enable an ahead-of-time (AOT) compiler to generate eff
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b01895b62727e3e22195cc13ab867b6d
https://doi.org/10.1007/978-3-662-48288-9_11
https://doi.org/10.1007/978-3-662-48288-9_11
Publikováno v:
ACM Transactions on Programming Languages and Systems. 27:477-526
This article describes CCured, a program transformation system that adds type safety guarantees to existing C programs. CCured attempts to verify statically that memory errors cannot occur, and it inserts run-time checks where static verification is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab7975200077e0a7e7ff50b3664f367d
https://doi.org/10.1145/1065887.1065892
https://doi.org/10.1145/1065887.1065892
Autor:
George C. Necula, Sumit Gulwani
Publikováno v:
CADE
We present a new randomized algorithm for checking the satisfiability of a conjunction of literals in the combined theory of linear equalities and uninterpreted functions. The key idea of the algorithm is to process the literals incrementally and to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cdf95def78d7951d22531b947ff6fd60
Autor:
Peter Lee, George C. Necula
Publikováno v:
PLDI
This paper presents the design and implementation of a compiler that translates programs written in a type-safe subset of the C programming language into highly optimized DEC Alpha assembly language programs, and a certifier that automatically checks
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1f6b9e2ac7cf24633cea6287ea420084
https://doi.org/10.1145/989393.989454
https://doi.org/10.1145/989393.989454