Results 1 to 10 of about 323,354 (100)
Programming with neural surrogates of programs [PDF]
Proceedings of the 2021 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software, 2021 Surrogates, models that mimic the behavior of programs, form the basis of a variety of development workflows. We study three surrogate-based design patterns, evaluating each in case studies on a large-scale CPU simulator. With surrogate compilation, programmers develop a surrogate that mimics the behavior of a program to deploy to end-users in place of
Alex Renda, Yi Ding 0006, Michael Carbin
openaire +4 more sources
Program Synthesis for Program Analysis [PDF]
ACM Transactions on Programming Languages and Systems, 2018 In this article, we propose a unified framework for designing static analysers based on program synthesis . For this purpose, we identify a fragment of second-order logic with restricted quantification that is expressive enough to model numerous static analysis problems (e.g., safety proving,
Cristina David +3 more
openaire +4 more sources
Description of a Program for Nonlinear Programming: the Centroid Program [PDF]
The Computer Journal, 1985 Considered is a problem of non-linear programming in the form \(g_ e(x)\leq 0\), \(e=1,2,...,M\), f(x)\(\to \min\), where g and f are non-linear functions of the independent variable \(x=\{x_ 1,x_ 2,...,x_ t,...,x_ n\}\). We then define the penalty function \(F=\sum_{e}g^+_ e\), where \(g_ e>0\to g^+_ e=g_ e\), \(g_ e\leq 0\to g^+_ e=0\), and by an ...
openaire +3 more sources
Program Transformation for Program Verification
EPiC Series in Computing, 2018 We present a transformational approach to program verification and software model checking that uses three main ingredients:(i) Constraint Logic Programming (CLP),(ii) metaprogramming and program specialization, and(iii) proof by transformation.
PETTOROSSI, ALBERTO, Proietti, M.
openaire +6 more sources
Program slicing of Java programs
Journal of Logical and Algebraic Methods in Programming, 2023 This work has been partially supported by grant PID2019-104735RB-C41 funded by Spanish MCI/AEI/10.13039/501100011033, by the Generalitat Valenciana under grant Prometeo/2019/098 (DeepTrust), and by TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA No 952215.
Carlos Galindo 0002 +2 more
openaire +3 more sources
Revue Ouverte d'Intelligence Artificielle, 2000 This article recounts the story of constraint programming, one of the most remarkable and enduring scientific contributions of Alain Colmerauer. It is a personal story, having lived through, and contributed to, the events that are reported here.
openaire +3 more sources
Communications of the ACM, 1987 A complete set of algebraic laws is given for Dijkstra's nondeterministic sequential programming language. Iteration and recursion are explained in terms of Scott's domain theory as fixed points of continuous functionals. A calculus analogous to weakest preconditions is suggested as an aid to deriving programs from their specifications.
C. A. R. Hoare +8 more
openaire +6 more sources
Programming Is Diagramming Is Programming
Journal of Software, 2019 Sabah Al-Fedaghi, Esraa Haidar
openaire +2 more sources