Results 341 to 350 of about 34,628,233 (409)
Some of the next articles are maybe not open access.
Detecting Code Comment Inconsistencies using LLM and Program Analysis
SIGSOFT FSE CompanionCode comments are the most important medium for documenting program logic and design. Nevertheless, as modern software undergoes frequent updates and modifications, maintaining the accuracy and relevance of comments becomes a labor-intensive endeavor ...
Yichi Zhang
semanticscholar +1 more source
Learning Abstraction Selection for Bayesian Program Analysis
Proc. ACM Program. Lang.We propose a learning-based approach to select abstractions for Bayesian program analysis. Bayesian program analysis converts a program analysis into a Bayesian model by attaching probabilities to analysis rules.
Yifan Zhang, Yuanfeng Shi, Xin Zhang
semanticscholar +1 more source
A Machine-Learning Algorithm with Disjunctive Model for Data-Driven Program Analysis
ACM Transactions on Programming Languages and Systems, 2019We present a new machine-learning algorithm with disjunctive model for data-driven program analysis. One major challenge in static program analysis is a substantial amount of manual effort required for tuning the analysis performance.
Minseok Jeon +3 more
semanticscholar +1 more source
Artificial Intelligence, 1976
In order to examine the possibilities of using a computer as an aid to teaching programming, a prototype intelligent program analyzer has been constructed. Its design assumes that a system cannot analyze a program unless it can "understand" it; understanding being based on a knowledge of what must be accomplished and how code is used to express the ...
openaire +1 more source
In order to examine the possibilities of using a computer as an aid to teaching programming, a prototype intelligent program analyzer has been constructed. Its design assumes that a system cannot analyze a program unless it can "understand" it; understanding being based on a knowledge of what must be accomplished and how code is used to express the ...
openaire +1 more source
Subformula Caching for Model Counting and Quantitative Program Analysis
International Conference on Automated Software Engineering, 2019Quantitative program analysis is an emerging area with applications to software reliability, quantitative information flow, side-channel detection and attack synthesis.
William Eiers +3 more
semanticscholar +1 more source
The analysis of programming structure
ACM SIGACT News, 1997The standard course in theory of computation introduces students to Turing machines and computability theory. This model prescribes what can be computed, and what cannot be computed, but the negative results have far more consequences.
John C. Mitchell, Jon G. Riecke
openaire +1 more source
ACM SIGPLAN Notices, 1996
Program Analysis is largely based on generic theories that have the potential for toolmaking. Intensive research should go into the still open problems faced by the creators of program analysis generators. To date, the more generic method of abstract interpretation has advantages for toolmaking compared to type inference based and set based analysis ...
openaire +1 more source
Program Analysis is largely based on generic theories that have the potential for toolmaking. Intensive research should go into the still open problems faced by the creators of program analysis generators. To date, the more generic method of abstract interpretation has advantages for toolmaking compared to type inference based and set based analysis ...
openaire +1 more source
Probabilistic Program Analysis
2017This paper provides a survey of recent work on adapting techniques for program analysis to compute probabilistic characterizations of program behavior. We survey how the frameworks of data flow analysis and symbolic execution have incorporated information about input probability distributions to quantify the likelihood of properties of program states ...
Matthew B. Dwyer +5 more
openaire +1 more source
Program partition and logic program analysis
IEEE Transactions on Software Engineering, 1995A program partition scheme for stratified programs introduced by Apt et al. (1988) is used to study efficient computation of logic programs. We consider three types of program partitions and their corresponding graph representations: 1) the natural partition, 2) stratified partitions, and 3) the reduced partition.
openaire +1 more source
Communications of the ACM, 1976
Most present systems for verification of computer programs are incomplete in that intermediate inductive assertions must be provided manually by the user, termination is not proven, and incorrect programs are not treated. As a unified solution to these problems, this paper suggests conducting a logical analysis of programs by using invariants which ...
Shmuel Katz, Zohar Manna
openaire +2 more sources
Most present systems for verification of computer programs are incomplete in that intermediate inductive assertions must be provided manually by the user, termination is not proven, and incorrect programs are not treated. As a unified solution to these problems, this paper suggests conducting a logical analysis of programs by using invariants which ...
Shmuel Katz, Zohar Manna
openaire +2 more sources