Using Triples to Reason About Concurrent Programs

Abstract

This paper presents adapatations of the Hoare triple for reasoning about concurrent programs. Tlie rules for the Hoare triple, familiar to programmers from their experience with sequential programming, can be applied to develop proofs of concurrent programs as well. The basis for the adaptations of the Hoare triple is temporal logic.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 20, 1993
Accession Number
ADA444448

Entities

People

  • K. M. Chandy

Organizations

  • California Institute of Technology

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Availability
  • Classification
  • Computer Programming
  • Contracts
  • Information Operations
  • Instructions
  • Monitoring
  • Reasoning
  • Scientific Research
  • Security
  • Standards

Fields of Study

  • Computer science

Readers

  • Artificial Intelligence