K. E. Kennedy
ABSTRACT
Multi-core processors have introduced a greater need for concurrent specifications. Additionally, many specifications require proof of correctness. We present a new automatic programming system designed for the creation, execution, and formal verification of concurrent specifications that is based upon colored Petri nets.
- J. Allen. Natural Language Understanding. Addison-Wesley, Reading, Massachusetts, 1995. Google Scholar
Digital Library
- D. Barstow. A perspective on automatic programming. AI Magazine, 5(1):5--27, 1984.Google Scholar
- R. Bastide. Approaches in unifying Petri nets and the object-oriented approach. In Proceedings of the Application and Theory of Petri Nets 1995 - Workshop on Object-Oriented Programming and Models of Concurrency, 1995.Google Scholar
- B. Fischer and J. Schumann. Autobayes: A system for generating data analysis programs from statistical models. Journal of Functional Programming, 13(3):483--508, 2003. Google ScholarDigital Library
- C. C. Green. Application of theorem proving to problem solving. In Proceedings of the International Joint Conference of Artificial Intelligence, pages 219--239, Washington, DC, May 1969.Google ScholarCross Ref
- C. C. Green. Results in knowledge based program synthesis. In Proceedings of the 6th International Joint Conference of Artificial Intelligence, pages 342--344, 1979.Google Scholar
- C. C. Green and B. Raphael. The use of theorem-proving techniques in question-answering systems. In Proceedings of the 23rd ACM National Conference, pages 169--181, 1968. Google ScholarDigital Library
- M. Hack. Decidability Questions for Petri Nets. PhD thesis, Massachusetts Institute of Technology, 1975.Google Scholar
- K. Jensen. Coloured petri nets and the invariant method. Theoretical Computer Science, 14:317--336, 1981.Google ScholarCross Ref
- K. Jensen. Coloured Petri Nets: Basic Concepts, Analysis Methods, and Practical Use, volume 1. Springer-Verlag, New York, 1992. Google ScholarDigital Library
- E. Kant. On the efficient synthesis of efficient programs. Artificial Intelligence, 20(3):253--305, May 1983.Google ScholarCross Ref
- J. R. Koza. Genetic Programming: On the Programming of Computers by Natural Selection. The MIT Press, Cambridge, Massachusetts, 1992. Google ScholarDigital Library
- M. Lowry, A. Philpot, T. Pressburger, and I. Underwood. Amphion: Automatic programming for subroutine libraries. In Proceedings of the 9th Knowledge-Based Software Engineering Conference, page 2, Monterey, CA, 1994.Google ScholarDigital Library
- Z. Manna and R. Waldinger. Synthesis: Dreams ⇒ programs. IEEE Transactions on Software Engineering, 5(4):294--328, July 1979. Google ScholarDigital Library
- J. McDonald and J. Anton. Specware - producing software correct by construction. Technical Report KES. U.01.3, Kestrel Institute, Palo Alto, California, March 2001.Google Scholar
- K. L. McMillan. The SMV System. PhD thesis, Department of Computer Science, Carnegie-Mellon University, 1992.Google Scholar
- A. Newell and H. A. Simon. Gps: A program that simulates human thought. pages 109--124, 1961.Google Scholar
- A. Newman, S. M. Shatz, and X. Xie. An approach to object system modeling by state-based object petri nets. 8(1):1--21, 1998.Google Scholar
- C. A. Petri. Kommunikation mit Automaten. PhD thesis, Schriften des Institutes für Instrumentelle Mathematik, 1962.Google Scholar
- C. Rich and R. C. Waters. Automatic programming: Myths and prospects. IEEE Computer, 21(8):40--51, August 1988. Google ScholarDigital Library
- H. A. Simon. Experiments with a heuristic compiler. Journal of the ACM, 10(4):493--506, October 1963. Google ScholarDigital Library
- J. R. Slagle. Experiments with a deductive question-answering program. Communications of the ACM, 8(12):792--798, December 1965. Google ScholarDigital Library
- D. R. Smith. Constructing specification morphisms. Journal of Symbolic Computation, 15(5/6):571--606, 1993. Google ScholarDigital Library
- M. Stickel, R. Waldinger, M. Lowry, T. Pressburger, and I. Underwood. Deductive composition of astronomical software from subroutine libraries. In Proceedings of the Twelfth International Conference on Automated Deduction (CADE-12), pages 341--355, Nancy, France, June 1994. Google ScholarDigital Library
- A. M. Turing. Computing machinery and intelligence. Mind, 59(236):433--460, October 1950.Google ScholarCross Ref
Index Terms
- A concurrent automatic programming system
Recommendations
How to Reconcile Formal Specifications and Automatic Programming: The Descartes System
APSEC '98: Proceedings of the Fifth Asia Pacific Software Engineering ConferenceMuch research work in computer science has been carried out in order to facilitate the software development process. Among the numerous research topics, two of them, automatic programming and formal specifications, had rarely been subject to a joint ...
Automatic Derivation of Formal Software Specifications from Informal Descriptions
SPECIFIER, an interactive system which derives formal specifications of data types and programs from their informal descriptions, is described. The process of deriving formal specifications is viewed as a problem-solving process. The system uses common ...
Executing Formal Specifications with Concurrent Constraint Programming
We have implemented a technique for execution of formal, model-based specifications. The specifications we can execute are written at a level of abstraction that is close to that used in nonexecutable specifications. The specification abstractions ...
Comments