Internal Iteration Externalized
ECOOP '99 Proceedings of the 13th European Conference on Object-Oriented Programming
Strongest postcondition semantics as the formal basis for reverse engineering
WCRE '95 Proceedings of the Second Working Conference on Reverse Engineering
Qualifying reusable functions using symbolic execution
WCRE '95 Proceedings of the Second Working Conference on Reverse Engineering
Computer aided evolutionary design for software engineering
ACM SIGART Bulletin
A tool-based approach for software testing and validation
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
A knowledge based program editor
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Meno-II: an intelligent tutoring system for novice programmers
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
A formal representation for plans in the programmer's apprentice
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Program understanding with the lambda calculus
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
The automated analysis of rule-based systems, based on their procedural semantics
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
SAMtool, a tool for deducing and implementing loop patterns
Proceedings of the fifteenth annual conference on Innovation and technology in computer science education
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
Proceedings of the 2013 International Conference on Software Engineering
| Hi-index | 0.01 |
This paper presents a method for automatically analyzing loops, and discusses why it is a useful way to look at loops. The method is based on the idea that there are four basic ways in which the logical structure of a loop is built up. An experiment is presented which shows that this accounts for the structure of a large class of loops. The paper discusses how the method can be used to automatically analyze the structure of a loop, and how the resulting analysis can be used to guide a proof of correctness for the loop. An automatic system is described which performs this type of analysis. The paper discusses the relationship between the structure building methods presented and programming language constructs. A system is described which is designed to assist a person who is writing a program. The intent is that the system will cooperate with a programmer throughout aUl phases of work on a program and be able to communicate with the programmer about it.