435,470 Hits in 7.8 sec

Formality, Agility, Security, and Evolution in Software Development

Jonathan P. Bowen, Mike Hinchey, Helge Janicke, Martin Ward, Hussein Zedan
2014 Computer  
Transformational programming method of algorithm derivation.  ...  Another paper uses this method to derive an implementation of program slicing from the formal definition of slicing, defined as a program transformation.  ... 
doi:10.1109/mc.2014.284 fatcat:wbdonzj2rzdydjhxbmitzymnmy

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  
By restricting our attention to program derivation, we have identifed a small core of the formal method concepts that can easily be taught in the first two years of a computing curricula.  ...  Existing attempts towards including formal methods in introductory programming courses focus on introducing program verification tools.  ...  The work of the first author was supported by the Tata Consultancy Services (TCS) Research Fellowship and a grant from the Ministry of Human Resource Development, Government of India.  ... 
doi:10.1145/2729094.2742628 dblp:conf/iticse/ChaudhariD15 fatcat:tjuacgzgq5abbbmtnxcudnjkzq

A Method to Deduce and Synthesize the Dafny Programs

Changjing WANG, Xilong DING, Jiangfei HE, Xi CHEN, Qing HUANG, Haimei LUO, Zhengkang ZUO
2021 Wuhan University Journal of Natural Sciences  
Then, the derivation process uses program specification transformation technology to perform equivalent transformation.  ...  We propose a systematic method to deduce and synthesize the Dafny programs. First, the specification of problem is described in strict mathematical language.  ...  In our method, we use strict formal derivation technology and specification transformation technology to make the final derivation procedure more rigorous and correct.  ... 
doi:10.1051/wujns/2021266481 fatcat:4d26gyluqrbgffj5erx6v6uvvq

Transformational Programming and the Derivation of Algorithms [chapter]

Martin Ward, Hussein Zedan
2010 Lecture Notes in Electrical Engineering  
The transformational programming, method of algorithm derivation starts with a formal specification of the result to be achieved (which provides no indication of how the result is to be achieved), plus  ...  The formal specification is then transformed into an implementation, by means of correctness-preserving refinement and transformation steps.  ...  In this paper we present a different method of programming, called transformational programming or algorithm derivation.  ... 
doi:10.1007/978-90-481-9794-1_4 fatcat:b4bo6zztefdnlgg252qh4afvri

How to Produce Correct Software - An Introduction to Formal Specification and Program Development by Transformations

E. A. Boiten, H. A. Partsch, D. Tuijnman, N. Volker
1992 Computer journal  
deriving efficient programs by correctness-preserving transformations.  ...  To master these problems, we advocate a software development method where the whole process is split into smaller steps by introducing formal specifications for (parts of) the problem and then step wisely  ...  Instead, the particular strength of the method lies in deriving programs which are either very sophisticated or have to be 100 percent correct.  ... 
doi:10.1093/comjnl/35.6.547 fatcat:5dzkroraiva63k2nie4wtzml5u


Moreno Falaschi, Augusto Sampaio
2017 Formal Aspects of Computing  
Formal methods based on logical theories are used widely and successfully in many areas of computer science, including software engineering.  ...  Program synthesis, program transformation, abstract interpretation, and other formal techniques improve both the process of software development and the quality and correctness of the programs.  ...  Programs are incrementally derived from their formal specifications, by repeatedly applying transformations to partially derived programs.  ... 
doi:10.1007/s00165-017-0427-1 fatcat:ej4i24vlenal5nqud65wus76ma

Formal synthesis in circuit design — A classification and survey [chapter]

Ramayya Kumar, Christian Blumenröhr, Dirk Eisenbiegler, Detlef Schmid
1996 Lecture Notes in Computer Science  
This article gives a survey on different methods of formal synthesis.  ...  We define what we mean by the term formal synthesis and delimit it from the other formal methods that can also be used to guarantee the correctness of an implementation.  ...  Acknowledgements The authors are grateful to the anonymous referees whose constructive comments have improved the quality of the paper.  ... 
doi:10.1007/bfb0031817 fatcat:bz6cob6jd5bo3izawypciavotq

Formal Derivation of the Combinatorics Problems with PAR Method

Lingyu SUN, Yatian SUN
2009 Journal of Software Engineering and Applications  
In this paper, we propose that PAR method is an effective formal method on solving combinatorics problems.  ...  Lastly, we obtain accurate C++ programs which are transformed by automatic transforming system of PAR platform.  ...  scheme, derived by PAR methods, is shown in Algorithm 1.  ... 
doi:10.4236/jsea.2009.23026 fatcat:ilcomf2frnfz5mknb56s2x6hie

SQAF-DS: A Software Quality Assessment Framework for Dependable Systems

Junbeom Yoo, Sanghyun Yoon
2013 2013 IEEE 37th Annual Computer Software and Applications Conference  
Test cases are developed in the process of software development and used to test target system, while dependability requirements are derived from dependability analysis, such as FTA (Fault Tree Analysis  ...  If the formal checking succeeds, then we can assure that the dependability requirements are well implemented in the software system.  ...  ACKNOWLEDGMENT This research was supported by the MKE, Korea, under the Development of Performance Improvement Technology for Engineering Tool of Safety PLC program supervised by the KETEP" (KETEP-2010  ... 
doi:10.1109/compsac.2013.118 dblp:conf/compsac/YooY13 fatcat:ntndpii4pjfldcb7cb4ngprkru

Validation And Verification Of Sysml Activity Diagrams Using Hoare Logic

Shaoying Liu and Yixiang Chen Yufei Yin
2018 Zenodo  
In this paper, we propose a novel technique that makes use of Hoare Logic and testing to verify whether the SysML diagrams meet the requirement, called TBFV-M.  ...  The existing TBFV method is designed for error detection with full automation efficiency, only for code. For verifying the correctness of SysML diagram, we applying TBFV method into SysML diagram.  ...  After acquiring all the test path of the program, Hoare Logic will help to give a formal proof for each path, which guarantees the comprehensiveness of functional scenario, derived from the formal post  ... 
doi:10.5281/zenodo.1344288 fatcat:3nac5d4b2veclc2j6hbfxebfra

Page 1960 of Mathematical Reviews Vol. , Issue 80E [page]

1980 Mathematical Reviews  
Author’s summary: “We describe a formalized method of top- down programming. The core of the method is a formal pseu- doprogramming language with a set of program refinement trans- formations.  ...  The inference rules used are similar to those of other formalisms for program derivation, for example, to Darlington’s transformation rules [R. M. Burstall and J. Darlington, J. Assoc. Comput.  ... 

Page 6825 of Mathematical Reviews Vol. , Issue 91M [page]

1991 Mathematical Reviews  
We consider classes of treelike programs introducing a concept of unary and binary edges in a tree to manage situations where a consequence A+ B of a Prolog program can be derived in several ways.  ...  The book can be recommended to students in computer science as well as to soft- ware engineers who are interested not only in knowing, but also in applying, formal methods.  ... 

Software Engineering in the Twenty-First Century

Michael R. Lowry
1992 The AI Magazine  
In research laboratories, many prototype KBSE systems have been developed that have advanced the science of formalizing and automating software design knowledge.  ...  The first and third sections of this book describe pilot systems for software maintenance and special-purpose program synthesis.  ...  The views expressed in this conclusion are the sole responsibility of the author.  ... 
doi:10.1609/aimag.v13i3.1012 dblp:journals/aim/Lowry92 fatcat:ovsullvmabaalhwclv4slacvjm

Strongest postcondition semantics as the formal basis for reverse engineering

Gerald C. Gannod, Betty H. C. Cheng
1996 Automated Software Engineering : An International Journal  
Changing architectures and improvements in programming methods, including formal methods in software development and object-oriented programming, have prompted a need to reverse engineer and re-engineer  ...  This paper describes the application of the strongest postcondition predicate transformer (sp) as the formal basis for the reverse engineering of imperative program code.  ...  Also, the authors wish to thank Linda Wills for her e orts in organizing this special issue.  ... 
doi:10.1007/bf00126962 fatcat:wy5xuremcrbkvniqxc2v72hyau

Page 4907 of Mathematical Reviews Vol. , Issue 95h [page]

1995 Mathematical Reviews  
This algebra is then used in the formal specification and derivation of some graph and sorting algorithms.  ...  From the text: “The calculus of predicate transformers has proved fruitful for the derivation of state-transformation programs in con- ventional languages with general recursion and demonic nonde-  ... 
« Previous Showing results 1 — 15 out of 435,470 results