Proof Abstraction for Imperative Languages
From MaRDI portal
Publication:5385589
DOI10.1007/11924661_6zbMATH Open1168.68361OpenAlexW1558176678MaRDI QIDQ5385589
Publication date: 6 May 2008
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11924661_6
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Categorical semantics of formal languages (18C50) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (4)
Abstractions of uniform proofs ⋮ A proof-theoretic study of abstract termination principles ⋮ Theories for mechanical proofs of imperative programs ⋮ Title not available (Why is that?)
This page was built for publication: Proof Abstraction for Imperative Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385589)
