Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Zvonimir Pavlinovic"'
Refinement types enable lightweight verification of functional programs. Algorithms for statically inferring refinement types typically work by reduction to solving systems of constrained Horn clauses extracted from typing derivations. An example is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c81003440fff6baad49c64692458e687
Autor:
Yan Shvartzshnaider, Thomas Wies, Prateek Mittal, Lakshminarayanan Subramanian, Ananth Balashankar, Zvonimir Pavlinovic, Helen Nissenbaum
Publikováno v:
WWW
Modern enterprises rely on Data Leakage Prevention (DLP) systems to enforce privacy policies that prevent unintentional flow of sensitive information to unauthorized entities. However, these systems operate based on rule sets that are limited to synt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::98fb5b0a6889b3cf205b37ba9be38768
https://doi.org/10.1145/3308558.3313655
https://doi.org/10.1145/3308558.3313655
Autor:
Kedar S. Namjoshi, Zvonimir Pavlinovic
Publikováno v:
Static Analysis ISBN: 9783319997247
SAS
SAS
Semantics-preserving program transformations, such as those carried out by an optimizing compiler, can affect the results of static program analyses. In the best cases, a transformation increases precision or allows a simpler analysis to replace a co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64ac17bc27048f5e85ccfd4b5cc49cd6
https://doi.org/10.1007/978-3-319-99725-4_19
https://doi.org/10.1007/978-3-319-99725-4_19
Autor:
Mike Barnett, Madanlal Musuvathi, Zvonimir Pavlinovic, Edgardo Zoppi, Diego Garbervetsky, Todd Mytkowicz
Publikováno v:
ESEC/SIGSOFT FSE
Query languages for big data analysis provide user extensibility through a mechanism of user-defined operators (UDOs). These operators allow programmers to write proprietary functionalities on top of a relational query skeleton. However, achieving ef
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2bc443d51e8a7a0352a627007436a00
https://doi.org/10.1145/3106237.3117774
https://doi.org/10.1145/3106237.3117774
Publikováno v:
ASE
This paper studies and optimizes automated program verification. Detailed reasoning about software behavior is often facilitated by program invariants that hold across all program executions. Finding program invariants is in fact an essential step in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ae9074f019d96e99411fbbc8d09851d
https://doi.org/10.1145/2970276.2970305
https://doi.org/10.1145/2970276.2970305
Publikováno v:
OOPSLA
Automatic type inference is a popular feature of functional programming languages. If a program cannot be typed, the compiler typically reports a single program location in its error message. This location is the point where the type inference failed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90fe74c34a0bfc3dffc396a5881f04e6
https://doi.org/10.1145/2660193.2660230
https://doi.org/10.1145/2660193.2660230