Stanford Pascal Verifier User Manual

Luckham, David C.; German, Steven M.; Henke, Friedrich W. von; Karp, Richard Alan; Milne, P. W.; Oppen, Derek C.; Polak, Wolfgang; Scherlis, William L.

doi:10.21236/ada071900

Cited by 46 publications

(11 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several mechanical program verification efforts arose based on the proof of simple assertions, called verification conditions, which are generated as a byproduct of applying Hoare-style proof rules [16,28,40,43,50,91].…”

Section: Logical Assertions As Characterizations Of Behaviormentioning

confidence: 99%

A historical perspective on runtime assertion checking in software development

Clarke

Rosenblum

2006

SIGSOFT Softw. Eng. Notes

112

View full text Add to dashboard Cite

This report presents initial results in the area of software testing and analysis produced as part of the Software Engineering Impact Project. The report describes the historical development of runtime assertion checking, including a description of the origins of and significant features associated with assertion checking mechanisms, and initial findings about current industrial use. A future report will provide a more comprehensive assessment of development practice, for which we invite readers of this report to contribute information. IntroductionThe Software Engineering Impact Project is documenting the impact that software engineering research has had on computer science research and on software development practice. The authors of this paper are responsible for documenting the impact of research in software testing and analysis for the Impact Project. One aspect of testing and analysis that has clearly had an impact is the widespread use of assertions, particularly for use in automated runtime detection of faults. This report documents the results of our initial assessment of assertions and narrates the history of software engineering research as it relates to the evolution and maturation of runtime assertion checking capabilities in programming languages and software development support tools.Despite decades of research into powerful software engineering technologies, and despite the continual discovery of tenets of good software engineering practice, software development remains an exceedingly complex endeavor. No matter how thoroughly a software system's requirements are documented, and no matter how carefully and elegantly the system's design has been constructed, inevitably latent faults, or incorrect program statements, are introduced in the system's implementation. These faults may be revealed during various levels of testing, or they may make a more inopportune appearance during field use by endusers. In such situations the faults are typically manifested externally as program failures, such as unexpected outputs, or other undesirable outcomes such as a program crash. Such failures provide developers with precious little information for initiating the task of correlating the simple external evidence of failure with the complexity of searching numerous possible locations for the faults that caused them.Assertions are one of the most useful automated techniques available for detecting faults and providing information about their locations, even for faults that are traversed during execution but do not lead to failures.As described in this report, assertions have a long and distinguished history in the annals of software engineering and programming language design. Initially developed as a means of stating expected or desired program properties as a necessary step in constructing formal, deductive proofs of program correctness, assertions have found many other applications in software engineering over the years, albeit primarily in the later stages of development (particularly in the developmen...

show abstract

Section: Logical Assertions As Characterizations Of Behaviormentioning

confidence: 99%

A historical perspective on runtime assertion checking in software development

Clarke

Rosenblum

2006

SIGSOFT Softw. Eng. Notes

112

View full text Add to dashboard Cite

show abstract

“…[23]. Only much more recently did it become feasible to do large-scale automatic reasoning as automatic theorem provers made great progress and are now optimized for proving software checking (e.g., [9]), verification-condition generation became optimized for those theorem provers (e.g., [12]), and programming methodology progressed (e.g., [2,19,5,15]).…”

Section: Related Workmentioning

confidence: 99%

Using History Invariants to Verify Observers

Leino

Schulte

2007

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. This paper contributes a technique that expands the set of object invariants that one can reason about in modular verification. The technique uses history invariants, two-state invariants that describe the evolution of data values. The technique enables a flexible new way to specify and verify variations of the observer pattern, including iterators. The paper details history invariants and the new kind of object invariants, and proves a soundness theorem.

show abstract

“…The Gypsy system was the first verification system to handle a form of concurrency [7]. The Stanford Pascal Verifier was the first verification system to handle a real programming language [9]. The most important contribution of the Stanford Pascal Verifier project was probably the Nelson-Oppen method of combining decision procedures (12].…”

Section: Related Workmentioning

confidence: 99%

Penelope: An Ada Verification Environment, Developing Formally Verified Ada Programs. Volume 1

Ramsey¹

1991

View full text Add to dashboard Cite

Stanford Pascal Verifier User Manual

Cited by 46 publications

References 0 publications

A historical perspective on runtime assertion checking in software development

A historical perspective on runtime assertion checking in software development

Using History Invariants to Verify Observers

Penelope: An Ada Verification Environment, Developing Formally Verified Ada Programs. Volume 1

Contact Info

Product

Resources

About