An Optimized Memory Monitoring for Runtime Assertion Checking of C Programs

2013 ◽  
pp. 167-182 ◽  
Author(s):  
Nikolai Kosmatov ◽  
Guillaume Petiot ◽  
Julien Signoles
Keyword(s):  
C Programs ◽  
Runtime Assertion Checking ◽  
Memory Monitoring

Memory Monitoring in Rhesus Monkeys (Macaca mulatta)

2010 ◽  
Author(s):  
Victoria L. Templer ◽  
Robert R. Hampton
Keyword(s):  
Macaca Mulatta ◽  
Rhesus Monkeys ◽  
Memory Monitoring

Refactoring C++ Programs Physically

2009 ◽  
Vol 20 (3) ◽  
pp. 597-607
Author(s):  
Tian-Lin ZHOU ◽  
Liang SHI ◽  
Bao-Wen XU ◽  
Yu-Ming ZHOU
Keyword(s):  
C Programs

Code integrity verification using cache memory monitoring

2021 ◽  
pp. 1-11
Author(s):  
Rajesh Kumar Shrivastava ◽  
Varun Natu ◽  
Chittaranjan Hota
Keyword(s):  
Cache Memory ◽  
Integrity Verification ◽  
Code Integrity ◽  
Memory Monitoring

Static deadlock detection for asynchronous C# programs

2017 ◽  
Vol 52 (6) ◽  
pp. 292-305 ◽  
Author(s):  
Anirudh Santhiar ◽  
Aditya Kanade
Keyword(s):  
Deadlock Detection ◽  
C Programs

Verification of C Buffer Overflows in C Programs

2018 ◽  
Author(s):  
Andreea Bican ◽  
Razvan Deaconescu ◽  
Wei Ngan Chin ◽  
Quang-Trung Ta
Keyword(s):  
C Programs ◽  
Buffer Overflows

scholarly journals Shape Neutral Analysis of Graph-based Data-structures

2018 ◽  
Vol 18 (3-4) ◽  
pp. 470-483 ◽  
Author(s):  
GREGORY J. DUCK ◽  
JOXAN JAFFAR ◽  
ROLAND H. C. YAP
Keyword(s):  
Data Structure ◽  
Data Structures ◽  
Program Analysis ◽  
Constraint Handling ◽  
C Programs ◽  
Wide Range ◽  
Target Program ◽  
Target Data ◽  
Structure Graph ◽  
Structure Properties

AbstractMalformed data-structures can lead to runtime errors such as arbitrary memory access or corruption. Despite this, reasoning over data-structure properties for low-level heap manipulating programs remains challenging. In this paper we present a constraint-based program analysis that checks data-structure integrity, w.r.t. given target data-structure properties, as the heap is manipulated by the program. Our approach is to automatically generate a solver for properties using the type definitions from the target program. The generated solver is implemented using a Constraint Handling Rules (CHR) extension of built-in heap, integer and equality solvers. A key property of our program analysis is that the target data-structure properties are shape neutral, i.e., the analysis does not check for properties relating to a given data-structure graph shape, such as doubly-linked-lists versus trees. Nevertheless, the analysis can detect errors in a wide range of data-structure manipulating programs, including those that use lists, trees, DAGs, graphs, etc. We present an implementation that uses the Satisfiability Modulo Constraint Handling Rules (SMCHR) system. Experimental results show that our approach works well for real-world C programs.

Developmental trends in children's memory monitoring

2000 ◽  
Vol 15 (2) ◽  
pp. 115-134 ◽  
Author(s):  
Wolfgang Schneider ◽  
Mechtild Visé ◽  
Kathrin Lockl ◽  
Thomas O Nelson
Keyword(s):  
Developmental Trends ◽  
Children's Memory ◽  
Memory Monitoring

Compiling Three-Address Code for C Programs

1981 ◽  
Vol 60 (2) ◽  
pp. 159-166
Author(s):  
J. F. Reiser
Keyword(s):  
C Programs
Sign in / Sign up

Export Citation Format

Share Document