Numerical recipes: the art of scientific computing
Numerical recipes: the art of scientific computing
History and basic features of the critical-pair/completion procedure
Journal of Symbolic Computation
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Journal of the ACM (JACM)
Semantics of programming languages: structures and techniques
Semantics of programming languages: structures and techniques
Fundamentals of Deductive Program Synthesis
IEEE Transactions on Software Engineering
Decision Support Systems - Special double issue: unified programming
Synthesis of Mathematical-Modeling Software
IEEE Software
KBSE '96 Proceedings of The 11th Knowledge-Based Software Engineering Conference
Generating Data Analysis Programs from Statistical Models
SAIG '00 Proceedings of the International Workshop on Semantics, Applications, and Implementation of Program Generation
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Automated Software Engineering
AutoBayes: a system for generating data analysis programs from statistical models
Journal of Functional Programming
Hi-index | 0.00 |
Scientists and engineers face recurring problems ofconstructing, testing and modifying numerical simulationprograms. The process of coding and revising such simulators isextremely time-consuming, because they are almost always writtenin conventional programming languages. Scientists and engineerscan therefore benefit from software that facilitatesconstruction of programs for simulating physical systems. Ourresearch adapts the methodology of deductive program synthesisto the problem of constructing numerical simulation codes. Wehave focused on simulators that can be represented as secondorder functional programs composed of numerical integration androot extraction routines. We have developed a system that usesfirst order Horn logic to synthesize numerical simulators builtfrom these components. Our approach is based on two ideas:first, we axiomatize only the relationship between integrationand differentiation. We neither attempt nor require a completeaxiomatization of mathematical analysis. Second, our systemuses a representation in which functions are reified as objects.Function objects are encoded as lambda expressions. Ourknowledge base includes an axiomatization of term equality inthe lambda calculus. It also includes axioms defining thesemantics of numerical integration and root extraction routines.We use depth bounded SLD resolution to construct proofs andsynthesize programs. Our system has successfully constructednumerical simulators for computational design of jet enginenozzles and sailing yachts, among others. Our resultsdemonstrate that deductive synthesis techniques can be used toconstruct numerical simulation programs for realisticapplications.