Results 361 to 370 of about 34,628,233 (409)
Some of the next articles are maybe not open access.
Functional programming analysis
Journal of Systems and Software, 1981An analysis of several routines from a large real time software system, using recently developed functional programming theory, has shown that the functional capabilities of the routines can be constructed from analysis of the code text. This analysis also showed that the number of distinct functions computed by a program is much smaller than generally
openaire +1 more source
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
ACM SIGSOFT Software Engineering Notes, 2002
The field of program analysis has made significant improvements recently, but still faces some major obstacles. In this talk I argue that considering analysis as applying longitudinally across the multitude of versions created during a program's lifetime -rather than to a given instance of a program - shows significant promise in overcoming some of ...
openaire +1 more source
The field of program analysis has made significant improvements recently, but still faces some major obstacles. In this talk I argue that considering analysis as applying longitudinally across the multitude of versions created during a program's lifetime -rather than to a given instance of a program - shows significant promise in overcoming some of ...
openaire +1 more source
LLVM: a compilation framework for lifelong program analysis & transformation
International Symposium on Code Generation and Optimization, 2004. CGO 2004., 2004C. Lattner, V. Adve
semanticscholar +1 more source
Pin: building customized program analysis tools with dynamic instrumentation
ACM-SIGPLAN Symposium on Programming Language Design and Implementation, 2005C. Luk +8 more
semanticscholar +1 more source
Parametrizing Program Analysis
2014 Theoretical Aspects of Software Engineering Conference, 2014A parametric analysis is an analysis whose input and output are parametrized with a number of parameters which can be instantiated to abstract properties after analysis is completed. We use Cousot and Cousot's Cardinal power domain to capture dependencies of analysis output on its input and present a method for obtaining parametric analyses from non ...
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
2013
Boolean programs are a popular abstract domain for static-analysis-based software model checking. Yet little is known about the complexity of model checking for this model of computation. This paper aims to fill this void by providing a comprehensive study of the worst-case complexity of several basic analyses of Boolean programs, including ...
Patrice Godefroid, Mihalis Yannakakis
openaire +1 more source
Boolean programs are a popular abstract domain for static-analysis-based software model checking. Yet little is known about the complexity of model checking for this model of computation. This paper aims to fill this void by providing a comprehensive study of the worst-case complexity of several basic analyses of Boolean programs, including ...
Patrice Godefroid, Mihalis Yannakakis
openaire +1 more source
A comprehensive electron wavefunction analysis toolbox for chemists, Multiwfn.
Journal of Chemical PhysicsAnalysis of electron wavefunction is a key component of quantum chemistry investigations and is indispensable for the practical research of many chemical problems.
T. Lu
semanticscholar +1 more source