Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Lampropoulos Leonidas"'
We introduce Object Graph Programming (OGO), which enables reading and modifying an object graph (i.e., the entire state of the object heap) via declarative queries. OGO models the objects and their relations in the heap as an object graph thereby tr
Externí odkaz:
http://arxiv.org/abs/2402.02642
We present COGNAC, a novel strategy for compiling quantum circuits based on numerical optimization algorithms from scientific computing. Using a simple noise model informed by the duration of entangling gates, our gradient-based method can quickly co
Externí odkaz:
http://arxiv.org/abs/2311.02769
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
Autor:
Anderson, Sean Noble, Blanco, Roberto, Lampropoulos, Leonidas, Pierce, Benjamin C., Tolmach, Andrew
Publikováno v:
Proceedings of the 2023 IEEE 36th Computer Security Foundations Symposium (CSF)
The term stack safety is used to describe a variety of compiler, run-time, and hardware mechanisms for protecting stack memory. Unlike "the heap," the ISA-level stack does not correspond to a single high-level language concept: different compilers us
Externí odkaz:
http://arxiv.org/abs/2105.00417
Autor:
Lampropoulos, Leonidas, Gallois-Wong, Diane, Hritcu, Catalin, Hughes, John, Pierce, Benjamin C., Xia, Li-yao
Property-based random testing a la QuickCheck requires building efficient generators for well-distributed random data satisfying complex logical predicates, but writing these generators can be difficult and error prone. We propose a domain-specific l
Externí odkaz:
http://arxiv.org/abs/1607.05443
Autor:
Bastani, Osbert, Ioannou, Yani, Lampropoulos, Leonidas, Vytiniotis, Dimitrios, Nori, Aditya, Criminisi, Antonio
Despite having high accuracy, neural nets have been shown to be susceptible to adversarial examples, where a small perturbation to an input can cause it to become mislabeled. We propose metrics for measuring the robustness of a neural net and devise
Externí odkaz:
http://arxiv.org/abs/1605.07262
Autor:
Hritcu, Catalin, Lampropoulos, Leonidas, Spector-Zabusky, Antal, de Amorim, Arthur Azevedo, Dénès, Maxime, Hughes, John, Pierce, Benjamin C., Vytiniotis, Dimitrios
Publikováno v:
J. Funct. Prog. 26 (2016) e4
Information-flow control mechanisms are difficult both to design and to prove correct. To reduce the time wasted on doomed proof attempts due to broken definitions, we advocate modern random testing techniques for finding counterexamples during the d
Externí odkaz:
http://arxiv.org/abs/1409.0393
Publikováno v:
EPTCS 98, 2012, pp. 3-16
With web services already being key ingredients of modern web systems, automatic and easy-to-use but at the same time powerful and expressive testing frameworks for web services are increasingly important. Our work aims at fully automatic testing of
Externí odkaz:
http://arxiv.org/abs/1210.6110
Publikováno v:
Journal of Computer Security; 2023, Vol. 31 Issue 5, p581-614, 34p
Publikováno v:
Programming Languages and Systems
Property-based testing uses randomly generated inputs to validate high-level program specifications. It can be shockingly effective at finding bugs, but it often requires generating a very large number of inputs to do so. In this paper, we apply idea