Prospects and Limitations of Automatic Assertion Generation for Loop Programs

From MaRDI portal

Revision as of 09:49, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4142653

Jump to:navigation, search

DOI10.1137/0206052zbMath0366.68003OpenAlexW2006906638MaRDI QIDQ4142653

Jayadev Misra

Publication date: 1977

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0206052

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (2)

A near-optimal method for reasoning about action ⋮ Current methods for proving program correctness

This page was built for publication: Prospects and Limitations of Automatic Assertion Generation for Loop Programs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4142653&oldid=17942702"