Filters








97,807 Hits in 1.6 sec

Tactics for Transformational Programming

Rosemary Monahan, Franz Geiselbrechtinger
1997 unpublished
It illustrates the use of the theorem proving environment as a basis for a program construction tool DEBATE 1 (Deduction Based Transformational Environment) which is under construction in University College  ...  The tool user should only be concerned with transformational programming steps and not with theorem proving activities. Therefore a layer of transformational tactics are discussed and presented.  ...  Finally, we illustrate how these problems may be overcome through the development of tactics for transformational programming.  ... 
doi:10.14236/ewic/fm1997.9 fatcat:j66tuffeh5aeriyzj5b7jwjohi

Automated Theorem Prover Assisted Program Calculations [chapter]

Dipak L. Chaudhari, Om Damani
2014 Lecture Notes in Computer Science  
We have implemented this approach in a Calculational Assistant for Programming from Specifications (CAPS).  ...  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  ...  The authors would like to thank the anonymous referees for their helpful comments. The work of the first author was supported by the Tata Consultancy Services (TCS) Research Fellowship.  ... 
doi:10.1007/978-3-319-10181-1_13 fatcat:ohiihva7bjhrdeys25v2lzogfa

Reusing software developments

Allen Goldberg
1990 Proceedings of the fourth ACM SIGSOFT symposium on Software development environments - SDE 4  
Given such a derivation history and a modified specifica.tion, the correspondence problem [21,20] a.ddresses how during replay a correspondence between program parts of the origina.l and modified program  ...  One key idea is that tactics are compositional: higher level tactics are constructed from more rudimentary using defined control primitives.  ...  I would like to thank Greg Fisher and Tom Pressburger for useful discussions and for, along with Limei Gilham, implementing the replay system. References  ... 
doi:10.1145/99277.99288 dblp:conf/sde/Goldberg90 fatcat:h5dyvs6gyrbannvvwdtwltk7d4

Combining Top-Down and Bottom-Up Techniques in Program Derivation [chapter]

Dipak L. Chaudhari, Om Damani
2015 Lecture Notes in Computer Science  
We have implemented these tactics in a program derivation system. With the help of simple examples, we show how this approach is useful for avoiding backtracking thereby simplifying the derivations.  ...  We present new tactics for back-propagating the assumptions made during the top-down phase. These tactics help in reducing the guesswork during the derivations.  ...  The CAPS system provides tactics for transforming partially derived programs as well as the proof obligation formulas.  ... 
doi:10.1007/978-3-319-27436-2_15 fatcat:znxtl2ll4ncjhnugnw3xt3wrjm

A System for Assisting Program Transformation

Martin S. Feather
1982 ACM Transactions on Programming Languages and Systems  
Program Program transformation has been advocated as a potentially appropriate methodology for program development.  ...  The approach, and the use of this system, are illustrated by presenting portions of the transformation of a compiler for a "toy" language.  ...  for providing the Original inspiration and continuing encouragement and assistance throughout.  ... 
doi:10.1145/357153.357154 fatcat:gcohzutxpje6nnp5pbcytp5edy

Program Calculation in Coq [chapter]

Julien Tesson, Hideki Hashimoto, Zhenjiang Hu, Frédéric Loulergue, Masato Takeichi
2011 Lecture Notes in Computer Science  
We design and implement a set of tactics for the Coq proof assistant to help the user to derive programs by program calculation and to write proofs in calculational form.  ...  The use of these tactics is demonstrated through program calculations in Coq based on the theory of lists.  ...  transformed into a foldr1 program.  ... 
doi:10.1007/978-3-642-17796-5_10 fatcat:qk7yojjbejd25lbhblyqcmrvze

Building an IDE for the Calculational Derivation of Imperative Programs

Dipak L. Chaudhari, Om Damani
2015 Electronic Proceedings in Theoretical Computer Science  
In this paper, we describe an IDE called CAPS (Calculational Assistant for Programming from Specifications) for the interactive, calculational derivation of imperative programs.  ...  Fig. 5 shows the tactic input panel for the Init4 tactic which is used for specifying the program.  ...  This panel is used for selecting a tactic to be applied next and for providing the corresponding tactic parameters.  ... 
doi:10.4204/eptcs.187.1 fatcat:l37w6qbm6bev5k3ymkasotcykq

Search Based Transformations [chapter]

Deji Fatiregun, Mark Harman, Robert Hierons
2003 Lecture Notes in Computer Science  
better program, than, for example, the identity transformation.  ...  The Transformation Problem An overall program transformation from one program p to an improved version p typically consists of many many smaller transformation tactics [1, 2] .  ... 
doi:10.1007/3-540-45110-2_154 fatcat:q6vgp22oazgb7n6osgvwf64n7a

Correct and user-friendly implementations of transformation systems [chapter]

Kolyang, T. Santen, B. Wolff
1996 Lecture Notes in Computer Science  
We present an approach to integrate several existing tools and methods to a technical framework for correctly developing and executing program transformations.  ...  We illustrate the approach by proving and implementing the transformation Global Search on the basis of the tactical theorem prover Isabelle.  ...  We would like to thank Maritta Heisel for many discussions on synthesis theorems, and two anonymous referees for very extensive and constructive comments.  ... 
doi:10.1007/3-540-60973-3_111 fatcat:tuiybptrvbatlnbhmjbvnagdee

Tool Support for Proof Engineering

Anne Mulhern, Charles Fischer, Ben Liblit
2007 Electronical Notes in Theoretical Computer Science  
Modern integrated development environments (IDEs) provide programmers with a variety of sophisticated tools for program visualization and manipulation.  ...  These tools assist the programmer in understanding legacy code and making coordinated changes across large parts of a program.  ...  Kenneth Kunen for his advice and encouragement.  ... 
doi:10.1016/j.entcs.2006.09.023 fatcat:rjzmzba7m5ecffplajvoyoypri

Introducing Formal Methods via Program Derivation

Dipak L. Chaudhari, Om Damani
2015 Proceedings of the 2015 ACM Conference on Innovation and Technology in Computer Science Education - ITiCSE '15  
When using the verification tools, there is no structured help available to the students in the actual task of implementing the program, except for the hints provided by the failed proof obligations.  ...  Existing attempts towards including formal methods in introductory programming courses focus on introducing program verification tools.  ...  Consider the "Empty Range" tactic for the summation that transforms the formula ( i : f alse : T.i) to 0.  ... 
doi:10.1145/2729094.2742628 dblp:conf/iticse/ChaudhariD15 fatcat:tjuacgzgq5abbbmtnxcudnjkzq

Exploring the relationship between learning and leadership

Lillas M. Brown, Barry Z. Posner
2001 Leadership & Organization Development Journal  
Transformational learning theory can be used to assess, strengthen, and create leadership development programs that develop transformational leaders.  ...  This same pattern was repeated for the other three learning tactics and Challenging.  ... 
doi:10.1108/01437730110403204 fatcat:54cbey4llzcbvdojycnidbtpcy

THE ROLE OF LEARNING TECHNIQUE ON STUDENT PERFORMANCE IN CS1 COURSES

2008 Issues in Information Systems  
Using the framework, a strategy was developed for determining which Learning Techniques students use and which are effective for learning computer programming.  ...  Three learning approaches were described and studied to determine how effective each were for acquiring OO programming competencies.  ...  Three expressive mode tactics were identified: Discussion (oral discourse), Reflection (transformation to written discourse), and Visualization (transformations to spatial depictions such as drawings or  ... 
doi:10.48009/1_iis_2008_60-67 fatcat:oi25efuzcfgmpoz6km5ldqsgye

Towards Formal Proof Script Refactoring [chapter]

Iain Whiteside, David Aspinall, Lucas Dixon, Gudmund Grov
2011 Lecture Notes in Computer Science  
We propose proof script refactorings as a robust tool for constructing, restructuring, and maintaining formal proof developments.  ...  All authors are grateful for the support of EPSRC Platform grant EPE/005713/1. The fourth author was also supported by EPSRC grant EP/H024204/1.  ...  Acknowledgements The authors would like to thank the anonymous reviewers for their helpful suggestions. The first author was supported by Microsoft Research through its PhD Scholarship Programme.  ... 
doi:10.1007/978-3-642-22673-1_18 fatcat:cjfuzeerffh6negrf7ky52oany

Supporting ArcAngel in ProofPower

Frank Zeyda, Marcel Oliveira, Ana Cavalcanti
2009 Electronical Notes in Theoretical Computer Science  
It is especially well-suited for the specification of high-level strategies to derive programs by construction, and equipped with a formal semantics that enables reasoning about tactics.  ...  ArcAngel is a specialised tactic language devised to facilitate and automate program developments using Morgan's refinement calculus.  ...  We also acknowledge EPSRC for funding this work under the 'Programming from Control Laws' research grant EP/E025366/1.  ... 
doi:10.1016/j.entcs.2009.12.027 fatcat:ezegpcrnubfhhln4r2hrgxcaca
« Previous Showing results 1 — 15 out of 97,807 results