Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
  Browse All Reviews > Computing Methodologies (I) > Artificial Intelligence (I.2) > Automatic Programming (I.2.2) > Program Verification (I.2.2...)  
  1-8 of 8 Reviews about "Program Verification (I.2.2...)": Date Reviewed
  Performance-aware server architecture recommendation and automatic performance verification technology on IaaS cloud
Yamato Y. Service Oriented Computing and Applications 11(2): 121-135, 2017.  Type: Article

Yamato proposes “a server architecture recommendation and automatic performance verification technology, which recommends and verifies appropriate server architecture on an infrastructure as a service (IaaS) cloud with bare m...

Dec 15 2017
  A devil’s advocate against termination of direct recursion
Frühwirth T.  PPDP 2015 (Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, Siena, Italy, Jul 14-16, 2015) 103-113, 2015.  Type: Proceedings

A totally correct system terminates. Instead of establishing termination directly, this paper describes a technique based on non-termination. This technique is statically derivable from the program text and produces non-termination res...

Aug 12 2015
  Matrix code
Van Emden M. Science of Computer Programming 843-21, 2014.  Type: Article

Imperative programming verification is a serious problem! Parallel development of proof and code for imperative programming is the proposed solution. A new language is presented to create a proof in parallel with the code called matrix...

Aug 27 2014
   Software Fault Interactions and Implications for Software Testing
 IEEE Transactions on Software Engineering 30(6): 418-421, 2004.  Type: Article

By analyzing the error reports and the code changes required to fix faults in a number of development-stage and released software systems, ranging in size from one thousand to one million lines of code, the authors have discovered that...

Sep 9 2005
  Modular Verification of Software Components in C
 IEEE Transactions on Software Engineering 30(6): 388-402, 2004.  Type: Article

Program verification methodologies have come a long way, from handling simple textbook examples, useful only in classrooms, to automatic verification of industrial-strength programs with 50,000 lines of C code. However, even today&...

Jan 6 2005
  Breeding software test cases with genetic algorithms
Berndt D., Fisher J., Johnson L., Pinglikar J., Watkins A.  Conference on System Sciences (Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS’03) - Track 9, Big Island, HI, Jan 6-9, 2003) 338.12003.  Type: Proceedings

This paper considers the use of generic algorithms (GAs) to generate test cases that are concentrated in error prone regions of code. The idea is to use a fitness function that combines the concepts of novelty, proximity, and severity;...

Jun 3 2004
  Extraction of redundancy-free programs from constructive natural deduction proofs
Takayama Y. Journal of Symbolic Computation 12(1): 29-69, 1991.  Type: Article

Making programs redundancy-free, an important problem of automatic program generation, is dealt with by proving the logical formula describing their I/O behavior with natural deduction. The discussion applies a simple, artificial progr...

Oct 1 1992
  PROUST: an automatic debugger for PASCAL programs
Johnson W., Soloway E. BYTE 10(4): 179-190, 1985.  Type: Article

PROUST is far more than what programmers usually mean by a “debugger.” It is not a tracing-dumping package, nor an interactive tool for use while a program is running. It analyzes a program statically, yet tries to ...

Aug 1 1985
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy