Zobrazeno 1 - 10
of 265
pro vyhledávání: '"Van Horn, David"'
Synthesis tools have seen significant success in recent times. However, past approaches often require a complete and accurate embedding of the source language in the logic of the underlying solver, an approach difficult for industrial-grade languages
Externí odkaz:
http://arxiv.org/abs/2302.13145
Autor:
Li, Liyi, Liu, Yiyun, Postol, Deena L., Lampropoulos, Leonidas, Van Horn, David, Hicks, Michael
We present a formal model of Checked C, a dialect of C that aims to enforce spatial memory safety. Our model pays particular attention to the semantics of dynamically sized, potentially null-terminated arrays. We formalize this model in Coq, and prov
Externí odkaz:
http://arxiv.org/abs/2201.13394
In recent years, researchers have explored component-based synthesis, which aims to automatically construct programs that operate by composing calls to existing APIs. However, prior work has not considered efficient synthesis of methods with side eff
Externí odkaz:
http://arxiv.org/abs/2102.13183
Gradually-typed programming languages permit the incremental addition of static types to untyped programs. To remain sound, languages insert run-time checks at the boundaries between typed and untyped code. Unfortunately, performance studies have sho
Externí odkaz:
http://arxiv.org/abs/2007.12630
Many researchers have explored ways to bring static typing to dynamic languages. However, to date, such systems are not precise enough when types depend on values, which often arises when using certain Ruby libraries. For example, the type safety of
Externí odkaz:
http://arxiv.org/abs/1904.03521
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '19), June 22-26, 2019, Phoenix, AZ, USA
Termination is an important but undecidable program property, which has led to a large body of work on static methods for conservatively predicting or enforcing termination. One such method is the size-change termination approach of Lee, Jones, and B
Externí odkaz:
http://arxiv.org/abs/1808.02101
Autor:
Darais, David, Van Horn, David
Publikováno v:
J. Funct. Prog. 29 (2019) e11
Galois connections are a foundational tool for structuring abstraction in semantics and their use lies at the heart of the theory of abstract interpretation. Yet, mechanization of Galois connections using proof assistants remains limited to restricte
Externí odkaz:
http://arxiv.org/abs/1807.08711
Liquid typing provides a decidable refinement inference mechanism that is convenient but subject to two major issues: (1) inference is global and requires top-level annotations, making it unsuitable for inference of modular code components and prohib
Externí odkaz:
http://arxiv.org/abs/1807.02132