Programming with Proofs: Language-Based Approaches to Totally Correct Software

Authors:
Aaron Stump
Affiliations:
Computer Science and Engineering, Washington University in St. Louis, USA
Venue:
Verified Software: Theories, Tools, Experiments
Year:
2005

Citing 14
Cited 1

Dynamic Verification of C++ Generic Algorithms

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
A Mechanically Checked Proof of the AMD5K86TM Floating-Point Division Program

IEEE Transactions on Computers
Dynamic Logic

Dynamic Logic
Modular Verification of SRT Division

Formal Methods in System Design
Formal Verification of IA-64 Division Algorithms

TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors

Journal of Symbolic Computation
Verified bytecode verifiers

Theoretical Computer Science - Foundations of software science and computation structures
Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
The view from the left

Journal of Functional Programming
Scalable error detection using boolean satisfiability

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CMC: a pragmatic approach to model checking real code

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
A language-based approach to functionally correct imperative programming

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Data structure specifications via local equality axioms

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Safe programming with pointers through stateful views

PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages

Constructive Membership Predicates as Index Types

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tremendous progress has been made in automated and semi-automated verification since the seminal works on program verification. Automated deductive techniques like model checking have been highly successful for many verification tasks (e.g., [17, 18, 13]). Impressive advances continue to be made in static analysis, type systems, and static bug finding (e.g., [21, 12]). These approaches aim to verify code or find bugs in existing systems as automatically as possible, with as little developer help as possible. This has been the aim of the research community for many years, possibly due in part to the bad reputation that continues to plague full program verification. Theorem proving approaches to program verification have continued to make advances, but indeed, they still are generally applied only to the most critical applications (e.g., [7, 5, 16, 11]).