The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Communications of the ACM
The synthesis of loop predicates
Communications of the ACM
Communications of the ACM
Program development by stepwise refinement
Communications of the ACM
A simplifier based on efficient decision algorithms
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Implementation of an array bound checker
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
PASCAL user manual and report
Automatic program verification V: verification-oriented proof rules for arrays, records and pointers
Automatic program verification V: verification-oriented proof rules for arrays, records and pointers
Inference rules for program annotation
Inference rules for program annotation
Automatic verification of programs with complex data structure.
Automatic verification of programs with complex data structure.
Toward special-purpose program verification
Conference proceedings on Formal methods in software development
Elimination of redundant array subscript range checks
PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
Subtypes for Specifications: Predicate Subtyping in PVS
IEEE Transactions on Software Engineering
From flop to megaflops: Java for technical computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Ada exception handling: an axiomatic approach
ACM Transactions on Programming Languages and Systems (TOPLAS)
From Flop to MegaFlops: Java for Technical Computing
LCPC '98 Proceedings of the 11th International Workshop on Languages and Compilers for Parallel Computing
Extended Static Checking: A Ten-Year Perspective
Informatics - 10 Years Back. 10 Years Ahead.
Inference rules for program annotation
ICSE '78 Proceedings of the 3rd international conference on Software engineering
High-level debugging assistance via optimizing compiler technology (Extended Abstract)
SIGSOFT '83 Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging
A brief account: Implementation and applications of a Pascal program verifier (Position Statement)
ACM '78 Proceedings of the 1978 annual conference - Volume 2
Optimizing array reference checking in Java programs
IBM Systems Journal
Context-Aware Code Certification
Proceedings of the 19th IEEE international conference on Automated software engineering
An Integrated Approach to High Integrity Software Verification
Journal of Automated Reasoning
The spec# programming system: an overview
CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
| Hi-index | 0.00 |
The Runcheck Verifier is a working system for proving the absence of common runtime errors. The language accepted is Pascal without variant records, side effects in functions, shared variable parameters to procedures, or functional arguments. The errors checked are: 1) accessing a variable that has not been assigned a value, 2) array subscripting out of range, 3) subrange type error, 4) dereferencing a NIL pointer, 5) arithmetic overflow, and 6) division by zero.