A heuristic for deriving loop functions
IEEE Transactions on Software Engineering
Relational heuristics for the design of deterministic programs
Acta Informatica
Properties of data flow frameworks: a unified model
Acta Informatica
The new math of computer programming
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Loop Transformations for Restructuring Compilers: The Foundations
Loop Transformations for Restructuring Compilers: The Foundations
The Science of Programming
A Discipline of Programming
Symbolic evaluation of programs: a look at loop analysis
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
HICSS '04 Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9
Non-linear loop invariant generation using Gröbner bases
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Loop Squashing Transformations for Amorphous Slicing
WCRE '04 Proceedings of the 11th Working Conference on Reverse Engineering
An Algorithm for Automated Generation of Invariants for Loops with Conditionals
SYNASC '05 Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Proceedings of the 5th international conference on Generative programming and component engineering
Next-Generation Software Engineering: Function Extraction for Computation of Software Behavior
HICSS '07 Proceedings of the 40th Annual Hawaii International Conference on System Sciences
The Daikon system for dynamic detection of likely invariants
Science of Computer Programming
Lifting abstract interpreters to quantified logical domains
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Mathematics for reasoning about loop functions
Science of Computer Programming
Advanced symbolic analysis for compilers: new techniques and algorithms for symbolic program analysis and optimization
Reflexive transitive invariant relations: A basis for computing loop functions
Journal of Symbolic Computation
Program verification using automatic generation of invariants
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Computing Properties of Numerical Imperative Programs by Symbolic Computation
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Verifying while loops with invariant relations
International Journal of Critical Computer-Based Systems
| Hi-index | 0.00 |
The increasing criticality of software applications, the increasing size and complexity of such applications, and the increasing reliance of software engineering paradigms on third party software assets combine to place a high premium on the ability to analyze software products to an arbitrary level of thoroughness and precision. Yet despite several decades of research, the goal of analyzing the functional properties of software products to an arbitrary level of thoroughness and precision remains unfulfilled. In this paper, we discuss the use of a relation-theoretic approach inspired from Mills' logic to analyze while loops, and we support our approach by an operational prototype tool. The proposed method and tool have applications in program comprehension, reverse engineering, program verification, software maintenance, and programmer education.