Results 221 to 230 of about 3,385,810 (267)
Some of the next articles are maybe not open access.
Perspectives on program analysis
ACM Computing Surveys, 1996To guide the research efforts in the area of program analysis it is necessary to provide a taxonomy of the various approaches (identifying strengths and weaknesses), and to explore the links to programming languages and theoretical computer science.
openaire +2 more sources
The analysis of Quicksort programs
Acta Informatica, 1977The Quicksort sorting algorithm and its best variants are presented and analyzed. Results are derived which make it possible to obtain exact formulas describing the total expected running time of particular implementations on real computers of Quicksort and an improvement called the median-of-three modification.
openaire +2 more sources
Program Analysis and Programming Languages for Security
2008The security of a software system is almost always retrofitted to an afterthought. When security problems arise, understanding and correcting them can be very challenging. On the one hand, the programanalysis and programming-languages research community has created numerous static and dynamic analysis tools for performance optimization and bug ...
openaire +2 more sources
Transformational program analysis
Software Testing, Verification and Reliability, 1994AbstractThis paper describes an approach to the semantic analysis of procedural code. The techniques differ from those adopted in current static analysis tools such as MALPAS (Bramson, 1984) and SPADE (Clutterbuck and Carré, 1988) in two key respects: (1) A database is used, together with language‐specific and language‐independent data models, as a ...
openaire +1 more source
Information and Software Technology, 2010
Program analysis techniques are used by software engineers to deduce and infer characteristics of software systems. Recent research has suggested that certain program analysis techniques can be formulated as formal experiments. This article reports the results of research exploring this suggestion.
Joseph R. Ruthruff +2 more
openaire +1 more source
Program analysis techniques are used by software engineers to deduce and infer characteristics of software systems. Recent research has suggested that certain program analysis techniques can be formulated as formal experiments. This article reports the results of research exploring this suggestion.
Joseph R. Ruthruff +2 more
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
2017
We show how recent results concerning quantitative forms of automata help providing refined understanding of the properties of a system (for instance, a program). In particular, combining the size-change abstraction together with results concerning the asymptotic behavior of tropical automata yields extremely fine complexity analysis of some pieces of ...
Thomas Colcombet +2 more
openaire +2 more sources
We show how recent results concerning quantitative forms of automata help providing refined understanding of the properties of a system (for instance, a program). In particular, combining the size-change abstraction together with results concerning the asymptotic behavior of tropical automata yields extremely fine complexity analysis of some pieces of ...
Thomas Colcombet +2 more
openaire +2 more sources
Proceedings Conference on Software Maintenance 1992, 2003
The authors first discuss three methods of identifying objects. The first two were suggested by S.S. Liu and N. Wilde; the third method is one that is proposed in the present work and is based on the determination of the receiver of a procedure. The authors believe that the latter method is more natural and precise than the former two.
Panos E. Livadas, Prabal K. Roy
openaire +2 more sources
The authors first discuss three methods of identifying objects. The first two were suggested by S.S. Liu and N. Wilde; the third method is one that is proposed in the present work and is based on the determination of the receiver of a procedure. The authors believe that the latter method is more natural and precise than the former two.
Panos E. Livadas, Prabal K. Roy
openaire +2 more sources
2002
This paper surveys type-based program analysis with an emphasis on the polyvariant program analyses that can be obtained using conjunctive (or intersection) types and parametric polymorphism. In particular, we show 1) how binding-time analysis and strictness analysis are variations of a common framework based on conjunctive types, 2) that the standard ...
openaire +1 more source
This paper surveys type-based program analysis with an emphasis on the polyvariant program analyses that can be obtained using conjunctive (or intersection) types and parametric polymorphism. In particular, we show 1) how binding-time analysis and strictness analysis are variations of a common framework based on conjunctive types, 2) that the standard ...
openaire +1 more source
Journal of the ACM, 1988
The first part of the paper shows that previous theoretical work on the semantics of probabilistic programs (Kozen) and on the correctness of performance annotated programs (Ramshaw) can be used to automate the average-case analysis of simple programs containing assignments, conditionals, and loops.
Timothy J. Hickey, Jacques Cohen
openaire +3 more sources
The first part of the paper shows that previous theoretical work on the semantics of probabilistic programs (Kozen) and on the correctness of performance annotated programs (Ramshaw) can be used to automate the average-case analysis of simple programs containing assignments, conditionals, and loops.
Timothy J. Hickey, Jacques Cohen
openaire +3 more sources