Calculating Statically Maximum Log Memory Used by Multi-threaded Transactional Programs

DOI10.1007/978-3-319-46750-4_6zbMath1482.68097OpenAlexW2521201818WikidataQ58226995 ScholiaQ58226995MaRDI QIDQ3179394

Duc-Hanh Dang, Ngoc-Khai Nguyen, Dang Van Hung, Anh-Hoang Truong

Publication date: 21 December 2016

Published in: Theoretical Aspects of Computing – ICTAC 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-46750-4_6

zbMATH Keywords

static analysistransactional memorymemory bound

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• A type system for counting instances of software components
• A transactional object calculus
• Automatic Static Cost Analysis for Parallel Programs
• Recursion and dynamic data-structures in bounded space
• Static prediction of heap space usage for first-order functional programs
• Mechanical program analysis
• Static Analysis

This page was built for publication: Calculating Statically Maximum Log Memory Used by Multi-threaded Transactional Programs