Alias calculus for a simple imperative language with decidable pointer arithmetic

MaRDI QIDQ2979874zbMATH OpenFDO

Authors Nikolay V. Shilov, Aizhan Satekbayeva, A. P. Vorontsov

Publication date 26 April 2017

Full work available at URL http://bulletin.iis.nsk.su/files/article/shilov_satekbayeva_vorontsov.pdf

zbMATH Keywords

alias calculusaliasing problemlogic of partial correctness

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Static Analysis
• Expression-Based Aliasing for OO–languages
• An imperative pure calculus
• A calculus for language transformations
• Automatic analysis of pointer aliasing for untyped programs

Cited in

(3)

• A logical analysis of aliasing in imperative higher-order functions
• Aliasing Control in an Imperative Pure Calculus
• A logical analysis of aliasing in imperative higher-order functions

This page was built for publication: Alias calculus for a simple imperative language with decidable pointer arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2979874)