Results 1 to 10 of about 5,977,532 (99)
Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties [PDF]
Proc. ACM Program. Lang., 2023 Hoare logics are proof systems that allowone to formally establish properties of computer programs. Traditional Hoare logics prove properties of individual program executions (such as functional correctness).
Thibault Dardinier, Peter Muller
semanticscholar +1 more source
Inductive Program Synthesis via Iterative Forward-Backward Abstract Interpretation [PDF]
Proc. ACM Program. Lang., 2023 A key challenge in example-based program synthesis is the gigantic search space of programs. To address this challenge, various work proposed to use abstract interpretation to prune the search space. However, most of existing approaches have focused only
Yongho Yoon, Woosuk Lee, K. Yi
semanticscholar +1 more source
Automated transpilation of imperative to functional code using neural-guided program synthesis [PDF]
Proc. ACM Program. Lang., 2022 While many mainstream languages such as Java, Python, and C# increasingly incorporate functional APIs to simplify programming and improve parallelization/performance, there are no effective techniques that can be used to automatically translate existing ...
Benjamin Mariano +4 more
semanticscholar +1 more source
Multi-modal program inference: a marriage of pre-trained language models and component-based synthesis [PDF]
Proc. ACM Program. Lang., 2021 Multi-modal program synthesis refers to the task of synthesizing programs (code) from their specification given in different forms, such as a combination of natural language and examples.
Kia Rahmani +7 more
semanticscholar +1 more source
Searching entangled program spaces [PDF]
Proc. ACM Program. Lang., 2022 Many problem domains, including program synthesis and rewrite-based optimization, require searching astronomically large spaces of programs. Existing approaches often rely on building specialized data structures—version-space algebras, finite tree ...
James Koppel +4 more
semanticscholar +1 more source
Pushing the Limit of 1-Minimality of Language-Agnostic Program Reduction
Proc. ACM Program. Lang., 2023 Program reduction has demonstrated its usefulness in facilitating debugging language implementations in practice, by minimizing bug-triggering programs. There are two categories of program reducers: language-agnostic program reducers (AGRs) and language ...
Zhenyang Xu +5 more
semanticscholar +1 more source
Program Reconditioning: Avoiding Undefined Behaviour When Finding and Reducing Compiler Bugs
Proc. ACM Program. Lang., 2023 We introduce program reconditioning, a method for allowing program generation and differential testing to be used to find miscompilation bugs, and test-case reduction to be used to simplify bug-triggering programs, even when (a) the programming language ...
B. Lecoeur +2 more
semanticscholar +1 more source
Explainable Program Synthesis by Localizing Specifications
Proc. ACM Program. Lang., 2023 The traditional formulation of the program synthesis problem is to find a program that meets a logical correctness specification. When synthesis is successful, there is a guarantee that the implementation satisfies the specification.
Amirmohammad Nazari +4 more
semanticscholar +1 more source
Simuliris: a separation logic framework for verifying concurrent program optimizations
Proc. ACM Program. Lang., 2022 Today’s compilers employ a variety of non-trivial optimizations to achieve good performance. One key trick compilers use to justify transformations of concurrent programs is to assume that the source program has no data races: if it does, they cause the ...
Lennard Gäher +7 more
semanticscholar +1 more source
Leveraging Rust Types for Program Synthesis
Proc. ACM Program. Lang., 2023 The Rust type system guarantees memory safety and data-race freedom. However, to satisfy Rust's type rules, many familiar implementation patterns must be adapted substantially.
Jonáš Fiala +4 more
semanticscholar +1 more source