Searching entangled program spaces [PDF]
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
Multi-modal program inference: a marriage of pre-trained language models and component-based synthesis [PDF]
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
Pushing the Limit of 1-Minimality of Language-Agnostic Program Reduction
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
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
Analysis of 2018 Geography Teacher Education Undergraduate Program in terms of Scientific Field Knowledge, General Culture and Pedagogy Courses [PDF]
Bu araştırmanın amacı, Türkiye’de 2018 yılında uygulamaya konulan Coğrafya Öğretmenliği Lisans Programını Öğretmenlik Meslek Bilgisi, Genel Kültür, Alan Bilgisi, Alan Eğitimi ve Öğretmenlik Uygulaması dersleri bağlamında önceki program ile ...
Sağdıç, Mustafa, Mustafa SAĞDIÇ
core +1 more source
Simuliris: a separation logic framework for verifying concurrent program optimizations
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
Verified tensor-program optimization via high-level scheduling rewrites
We present a lightweight Coq framework for optimizing tensor kernels written in a pure, functional array language. Optimizations rely on user scheduling using series of verified, semantics-preserving rewrites.
Amanda Liu +3 more
semanticscholar +1 more source
Partial (In)Completeness in abstract interpretation: limiting the imprecision in program analysis
Imprecision is inherent in any decidable (sound) approximation of undecidable program properties. In abstract interpretation this corresponds to the release of false alarms, e.g., when it is used for program analysis and program verification.
Marco Campion +2 more
semanticscholar +1 more source
Learning semantic program embeddings with graph interval neural network [PDF]
Learning distributed representations of source code has been a challenging task for machine learning models. Earlier works treated programs as text so that natural language methods can be readily applied.
Yu Wang +3 more
semanticscholar +1 more source
İLAHİYAT FAKÜLTESİ ÖĞRENCİLERİNİN İLAHİYAT PROGRAMI İLE İLGİLİ GÖRÜŞLERİ: SDÜ İLAHİYAT ÖRNEĞİ
Turkiye’de yuksekogretim alaninda egitim-ogretim faaliyetlerini surdurmekte olan Ilahiyat Fakulteleri, dini alanda halkin beklenti, ihtiyac ve taleplerini karsilayacak meslek elemanlari yetistirmektedir.
Saadettin Özdemir
semanticscholar +1 more source

