Abstract. Calculational Style of Programming, while very appealing, has several practical difficulties when done manually. Due to the large number of proofs involved, the derivations can be cumbersome and error-prone. To address these issues, we have developed automated theorem provers assisted program and formula transformation rules, which when coupled with the ability to extract context of a subformula, help in shortening and simplifying the derivations. We have implemented this approach in a Calculational Assistant for Programming from Specifi-cations (CAPS). With the help of simple examples, we show how the calculational assistant helps in taking the drudgery out of the derivation process while ensuring correctness
A technique for incorporating automatic transformations into processes such as the application of in...
Herewith, a fairly old concept is published for the first time and named "Lucas Interpretation". Thi...
AbstractIn this paper some enhancements for automated theorem-proving programs, techniques which can...
Program calculation, being a programming technique that derives programs from specification by means...
Analysis and transformation techniques developed for logic programming can be successfully applied t...
We present a framework for processing formulas in automatic theorem provers, with generation of deta...
We present a framework for processing formulas in automatic theorem provers, with generation of deta...
In the proofs-as-programs methodology, verified programs are developed through theorem-proving in a ...
The use of *proof plans* -- formal patterns of reasoning for theorem proving -- to control the (auto...
this paper, we propose a new mechanism called calculation carrying programs that can relax the tensi...
A description is given of a technique called middle-out reasoning for the control of search in autom...
Systems supporting the manipulation of non-trivial program code are complex and are at best semi-aut...
AbstractWe investigate an automated program synthesis system based on the paradigm of programming by...
Functional programs are particularly well suited to formal manipulation by equational reasoning. In ...
Existing attempts towards including formal methods in in-troductory programming courses focus on int...
A technique for incorporating automatic transformations into processes such as the application of in...
Herewith, a fairly old concept is published for the first time and named "Lucas Interpretation". Thi...
AbstractIn this paper some enhancements for automated theorem-proving programs, techniques which can...
Program calculation, being a programming technique that derives programs from specification by means...
Analysis and transformation techniques developed for logic programming can be successfully applied t...
We present a framework for processing formulas in automatic theorem provers, with generation of deta...
We present a framework for processing formulas in automatic theorem provers, with generation of deta...
In the proofs-as-programs methodology, verified programs are developed through theorem-proving in a ...
The use of *proof plans* -- formal patterns of reasoning for theorem proving -- to control the (auto...
this paper, we propose a new mechanism called calculation carrying programs that can relax the tensi...
A description is given of a technique called middle-out reasoning for the control of search in autom...
Systems supporting the manipulation of non-trivial program code are complex and are at best semi-aut...
AbstractWe investigate an automated program synthesis system based on the paradigm of programming by...
Functional programs are particularly well suited to formal manipulation by equational reasoning. In ...
Existing attempts towards including formal methods in in-troductory programming courses focus on int...
A technique for incorporating automatic transformations into processes such as the application of in...
Herewith, a fairly old concept is published for the first time and named "Lucas Interpretation". Thi...
AbstractIn this paper some enhancements for automated theorem-proving programs, techniques which can...