Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “program verification”

Program Verification

Timothy R. Colburn, James H. Fetzer, Terry L. Rankin · Studies in cognitive systems · 1993

Cited by 7

Program verification

Christopher John Hogger · 1990

Abstract We have seen that deduction can be applied to logic programs in order either to compute answers to queries (by total evaluation) or to derive new programs (by partial evaluation). In this Theme we look at the use of deduction for showing that programs are correct relative to logic specifications. In this context correctness is taken to be the property whereby, in relation to any query, the answers logically determined by the progam are exactly those logically determined by the specification. A logic specification is a set S of logic sentences, asserted independently of the program, which defines all the relations named in that program. In general it is both natural and sufficient for each sentence in S defining a relation R to take the propositional form

Cited by 0

Program Verification

Yoonsik Cheon, Cesar Yeep, Melisa Vela et al. · 2010

Abstract—Unlike a Hoare-style program verification, a functional program verification supports forward reasoning by viewing a program as a mathematical function from one program state to another and proving its correctness by essentially comparing two mathematical functions, the function computed by the program and its specification. Since it requires a minimal mathematical background and reflects the way programmers reason about the correctness of a program informally, it can be taught and practiced effectively. However, there is no formal notation supporting the functional program verification. In this paper, we propose a formal notation for writing functional program specifications for Java programs. The notation, called CleanJava, is based on the Java expression syntax and is extended with a mathematical toolkit consisting of sets and sequences. The vocabulary of CleanJava can also be enriched by introducing user-specified definitions such as user-defined mathematical functions and specification-only methods. We believe that CleanJava is a good notation for writing functional specifications and expect it to promote the use of functional program verifications by being able to specify a wide range of Java programs.

Cited by 0

Program Transformation for Program Verification

Alberto Pettorossi, Maurizio Proietti · EPiC series in computing · 2018

We present a transformational approach to program verification and software model checking that uses three main ingredients: (i) Constraint Logic Programming (CLP), (ii) metaprogramming and program specialization, and (iii) proof by transformation.

Cited by 0Open access

Deductive Program Verification

Jean-Christophe Filliâtre · HAL (Le Centre pour la Communication Scientifique Directe) · 2013

International audience

Cited by 0

Charpy verification program :

C N McCowan · 2003

This report documents the procedures used by NIST in the Charpy V-notch reference material program. It was

Cited by 12Open access

TFE verification program

General Atomics, San Diego, CA (United States) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1991

The program objective is to demonstrate the technology readiness of a thermionic fuel element (TFE) suitable for use as the basic element in a thermionic reactor with electric power output in the 0.5 to 5.0 MW(e) range, and a full-power life of 7 years. This report states progress made in the following tasks: concept design, converter performance, insulator seal, sheath insulator, fueled emitter, cesium reservoir and interconnective TFE components, and thermionic fuel element testing. 20 refs., 39 refs., 32 figs. (GHH)

Cited by 0Open access

Practical program verification

John Nagle, Scott C. Johnson · 1983

Despite the attractiveness of the concept, attempts to date to use proof of correctness techniques on production software have been generally unsuccessful. The obstacles encountered are not fundamental. We have implemented a proof of correctness system to be used for improving the realiability of certain small, real-time programs. It appears that many of the problems of past systems can be avoided.This work is supported by the Long Range Research Program of the Ford Motor Company, Dearborn, Michigan.

Cited by 6

TFE Verification Program

General Atomics, San Diego, CA (USA) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1990

The objective of the semiannual progress report is to summarize the technical results obtained during the latest reporting period. The information presented herein will include evaluated test data, design evaluations, the results of analyses and the significance of results. The program objective is to demonstrate the technology readiness of a TFE suitable for use as the basic element in a thermionic reactor with electric power output in the 0.5 to 5.0 MW(e) range, and a full-power life of 7 years. The TF Verification Program builds directly on the technology and data base developed in the 1960s and 1970s in an AEC/NASA program, and in the SP-100 program conducted in 1983, 1984 and 1985. In the SP-100 program, the attractive but concern was expressed over the lack of fast reactor irradiation data. The TFE Verification Program addresses this concern. The general logic and strategy of the program to achieve its objectives is shown on Fig. 1-1. Five prior programs form the basis for the TFE Verification Program: (1) AEC/NASA program of the 1960s and early 1970; (2) SP-100 concept development program;(3) SP-100 thermionic technology program; (4) Thermionic irradiations program in TRIGA in FY-86; (5) and Thermionic Technology Program in 1986 and 1987. 18 refs., 64 figs., 43 tabs.

Cited by 0Open access

Software/Program Verification

2008

Using the Process Algebra µCRL Recent work has looked at how Erlang programs could be modelchecked via translation into the process algebra µCRL. Rules for translating Erlang programs and OTP components into µCRL have been defined and investigated. However, in the existing work, no rule is defined for the translation of timeout events into µCRL. This could degrade the usability of the existing work as in some real applications, timeout events play a significant role in the system development. In this paper, by extending the existing work, we investigate the verification of timed Erlang/OTP components in µCRL. By using an explicit tick action in the µCRL specification, a discrete-time timing model is defined to support the translation of timed Erlang functions into µCRL. Two small examples are presented, which demonstrates the applications of the proposed approach.

Cited by 0

TFE Verification Program

General Atomics, San Diego, CA (United States) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1993

The objective of the semiannual progress report is to summarize the technical results obtained during the latest reporting period. The information presented herein will include evaluated test data, design evaluations, the results of analyses and the significance of results. The program objective is to demonstrate the technology readiness of a TFE (thermionic fuel element) suitable for use as the basic element in a thermionic reactor with electric power output in the 0.5 to 5.0 MW(e) range, and a full-power life of 7 years. The TFE Verification Program builds directly on the technology and data base developed in the 1960s and early 1970s in an AEC/NASA program, and in the SP-100 program conducted in 1983, 1984 and 1985. In the SP-100 program, the attractive features of thermionic power conversion technology were recognized but concern was expressed over the lack of fast reactor irradiation data. The TFE Verification Program addresses this concern.

Cited by 0Open access