Log in

Relevant bibliographies by topics / Heap-manipulating programs / Journal articles

To see the other types of publications on this topic, follow the link: Heap-manipulating programs.

Journal articles on the topic 'Heap-manipulating programs'

Author: Grafiati

Published: 28 June 2021

Last updated: 29 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 22 journal articles for your research on the topic 'Heap-manipulating programs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Kostyukov, Yu O., K. A. Batoev, D. A. Mordvinov, M. P. Kostitsyn, and A. V. Misonizhnik. "Automatic verification of heap-manipulating programs." Proceedings of the Institute for System Programming of the RAS 31, no. 5 (2019): 37–62. http://dx.doi.org/10.15514/ispras-2019-31(5)-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

ALBERT, ELVIRA, MARÍA GARCÍA DE LA BANDA, MIGUEL GÓMEZ-ZAMALLOA, JOSÉ MIGUEL ROJAS, and PETER STUCKEY. "A CLP heap solver for test case generation." Theory and Practice of Logic Programming 13, no. 4-5 (2013): 721–35. http://dx.doi.org/10.1017/s1471068413000458.

Full text

Abstract:

AbstractOne of the main challenges to software testing today is to efficiently handle heap-manipulating programs. These programs often build complex, dynamically allocated data structures during execution and, to ensure reliability, the testing process needs to consider all possible shapes these data structures can take. This creates scalability issues since high (often exponential) numbers of shapes may be built due to the aliasing of references. This paper presents a novel CLP heap solver for the test case generation of heap-manipulating programs that is more scalable than previous proposals

APA, Harvard, Vancouver, ISO, and other styles

3

Watanabe, Yasunari, Kiran Gopinathan, George Pîrlea, Nadia Polikarpova, and Ilya Sergey. "Certifying the synthesis of heap-manipulating programs." Proceedings of the ACM on Programming Languages 5, ICFP (2021): 1–29. http://dx.doi.org/10.1145/3473589.

Full text

Abstract:

Automated deductive program synthesis promises to generate executable programs from concise specifications, along with proofs of correctness that can be independently verified using third-party tools. However, an attempt to exercise this promise using existing proof-certification frameworks reveals significant discrepancies in how proof derivations are structured for two different purposes: program synthesis and program verification. These discrepancies make it difficult to use certified verifiers to validate synthesis results, forcing one to write an ad-hoc translation procedure from synthesi

APA, Harvard, Vancouver, ISO, and other styles

4

Magill, Stephen, Ming-Hsien Tsai, Peter Lee, and Yih-Kuen Tsay. "Automatic numeric abstractions for heap-manipulating programs." ACM SIGPLAN Notices 45, no. 1 (2010): 211–22. http://dx.doi.org/10.1145/1707801.1706326.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Nanevski, Aleksandar, Viktor Vafeiadis, and Josh Berdine. "Structuring the verification of heap-manipulating programs." ACM SIGPLAN Notices 45, no. 1 (2010): 261–74. http://dx.doi.org/10.1145/1707801.1706331.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Polikarpova, Nadia, and Ilya Sergey. "Structuring the synthesis of heap-manipulating programs." Proceedings of the ACM on Programming Languages 3, POPL (2019): 1–30. http://dx.doi.org/10.1145/3290385.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Winterstein, Felix, Kermin E. Fleming, Hsin-Jung Yang, and George A. Constantinides. "Custom Multicache Architectures for Heap Manipulating Programs." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 36, no. 5 (2017): 761–74. http://dx.doi.org/10.1109/tcad.2016.2608861.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Qin, Shengchao, Guanhua He, Chenguang Luo, Wei-Ngan Chin, and Hongli Yang. "Automatically refining partial specifications for heap-manipulating programs." Science of Computer Programming 82 (March 2014): 56–76. http://dx.doi.org/10.1016/j.scico.2013.03.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Yahav, Eran, and Mooly Sagiv. "Verifying safety properties of concurrent heap-manipulating programs." ACM Transactions on Programming Languages and Systems 32, no. 5 (2010): 1–50. http://dx.doi.org/10.1145/1745312.1745315.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Yorsh, Greta, Alexey Skidanov, Thomas Reps, and Mooly Sagiv. "Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs." Electronic Notes in Theoretical Computer Science 131 (May 2005): 125–38. http://dx.doi.org/10.1016/j.entcs.2005.01.028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Mathur, Umang, Adithya Murali, Paul Krogmeier, P. Madhusudan, and Mahesh Viswanathan. "Deciding memory safety for single-pass heap-manipulating programs." Proceedings of the ACM on Programming Languages 4, POPL (2020): 1–29. http://dx.doi.org/10.1145/3371103.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Dillig, Isil, Thomas Dillig, Alex Aiken, and Mooly Sagiv. "Precise and compact modular procedure summaries for heap manipulating programs." ACM SIGPLAN Notices 47, no. 6 (2012): 567. http://dx.doi.org/10.1145/2345156.1993565.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Dillig, Isil, Thomas Dillig, Alex Aiken, and Mooly Sagiv. "Precise and compact modular procedure summaries for heap manipulating programs." ACM SIGPLAN Notices 46, no. 6 (2011): 567–77. http://dx.doi.org/10.1145/1993316.1993565.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

DUCK, GREGORY J., JOXAN JAFFAR, and ROLAND H. C. YAP. "Shape Neutral Analysis of Graph-based Data-structures." Theory and Practice of Logic Programming 18, no. 3-4 (2018): 470–83. http://dx.doi.org/10.1017/s147106841800025x.

Full text

Abstract:

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 Rule

APA, Harvard, Vancouver, ISO, and other styles

15

Abdulla, Parosh Aziz, Lukáš Holík, Bengt Jonsson, Ondřej Lengál, Cong Quy Trinh, and Tomáš Vojnar. "Verification of heap manipulating programs with ordered data by extended forest automata." Acta Informatica 53, no. 4 (2015): 357–85. http://dx.doi.org/10.1007/s00236-015-0235-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Li, Renjian, Ji Wang, Liqian Chen, Wanwei Liu, and Dengping Wei. "Quantitative analysis for symbolic heap bounds of CPS software." Computer Science and Information Systems 8, no. 4 (2011): 1251–76. http://dx.doi.org/10.2298/csis110302054l.

Full text

Abstract:

One important quantitative property of CPS (Cyber-Physical Systems) software is its heap bound for which a precise analysis result needs to combine shape analysis and numeric reasoning. In this paper, we present a framework for statically finding symbolic heap bounds of CPS software. The basic idea is to separate numeric reasoning from shape analysis by first constructing an ASTG (Abstract State Transition Graph) and then extracting a pure numeric representation which can be analyzed for the heap bounds. A quantitative shape analysis method based on symbolic execution is defined in the framewo

APA, Harvard, Vancouver, ISO, and other styles

17

Atto, Muhsin H. "Graph Inclusion and Matching Algorithms for Programs Manipulating Singly linked Heaps." Science Journal of University of Zakho 9, no. 1 (2021): 30–37. http://dx.doi.org/10.25271/sjuoz.2021.9.1.778.

Full text

Abstract:

Programs that manipulate heaps such as singlylinked lists, doublylinked lists, skiplists, and treesare ubiquitous, and hence ensuring their correctness is of utmost importance. Analysing correctness properties for such programs is not trivial since they induce dynamic data structures, leading to unbounded state spaces with intricate patterns. One approach that has been adopted to tackle this problem is the use of symbolic searching techniques. The state space is encoded using graphs where the nodes represent memory cells, and the edges represent pointers between the cells. It is necessary to p

APA, Harvard, Vancouver, ISO, and other styles

18

Elad, Neta, and Sharon Shoham. "Axe ’Em: Eliminating Spurious States with Induction Axioms." Proceedings of the ACM on Programming Languages 9, POPL (2025): 479–508. https://doi.org/10.1145/3704853.

Full text

Abstract:

First-order logic has proved to be a versatile and expressive tool as the basis of abstract modeling languages. Used to verify complex systems with unbounded domains, such as heap-manipulating programs and distributed protocols, first-order logic, and specifically uninterpreted functions and quantifiers, strike a balance between expressiveness and amenity to automation. However, first-order logic semantics may differ in important ways from the intended semantics of the modeled system, due to the inability to distinguish between finite and infinite first-order structures, for example, or the un

APA, Harvard, Vancouver, ISO, and other styles

19

Raad, Azalea, Julien Vanegue, and Peter O’Hearn. "Non-termination Proving at Scale." Proceedings of the ACM on Programming Languages 8, OOPSLA2 (2024): 246–74. http://dx.doi.org/10.1145/3689720.

Full text

Abstract:

Program termination is a classic non-safety property whose falsification cannot in general be witnessed by a finite trace. This makes testing for non-termination challenging, and also a natural target for symbolic proof. Several works in the literature apply non-termination proving to small, self-contained benchmarks, but it has not been developed for large, real-world projects; as such, despite its allure, non-termination proving has had limited practical impact. We develop a compositional theory for non-termination proving, paving the way for its scalable application to large codebases. Disc

APA, Harvard, Vancouver, ISO, and other styles

20

Elad, Neta, Oded Padon, and Sharon Shoham. "An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification." Proceedings of the ACM on Programming Languages 8, POPL (2024): 970–1000. http://dx.doi.org/10.1145/3632875.

Full text

Abstract:

First-order logic, and quantifiers in particular, are widely used in deductive verification of programs and systems. Quantifiers are essential for describing systems with unbounded domains, but prove difficult for automated solvers. Significant effort has been dedicated to finding quantifier instantiations that establish unsatisfiability of quantified formulas, thus ensuring validity of a system’s verification conditions. However, in many cases the formulas are satisfiable—this is often the case in intermediate steps of the verification process, e.g., when an invariant is not yet inductive. Fo

APA, Harvard, Vancouver, ISO, and other styles

21

HOFFMANN, JAN, and ZHONG SHAO. "Type-based amortized resource analysis with integers and arrays." Journal of Functional Programming 25 (2015). http://dx.doi.org/10.1017/s0956796815000192.

Full text

Abstract:

AbstractProving bounds on the resource consumption of a program by statically analyzing its source code is an important and well-studied problem. Automatic approaches for numeric programs with side effects usually apply abstract interpretation-based invariant generation to derive bounds on loops and recursion depths of function calls. This article presents an alternative approach to resource-bound analysis for numeric and heap-manipulating programs that uses type-based amortized resource analysis. As a first step towards the analysis of imperative code, the technique is developed for a first-o

APA, Harvard, Vancouver, ISO, and other styles

22

Zhang, Yuntong, Andreea Costea, Ridwan Shariffdeen, Davin McCall, and Abhik Roychoudhury. "EffFix: Efficient and Effective Repair of Pointer Manipulating Programs." ACM Transactions on Software Engineering and Methodology, November 21, 2024. http://dx.doi.org/10.1145/3705310.

Full text

Abstract:

This work introduces EffFix, a tool that applies a novel static analysis-driven Automated Program Repair (APR) technique for fixing memory errors. APR tools typically rely on a given test-suite to guide the repair process. Apart from the need to provide test oracles, this reliance is also one of the main contributors to the over-fitting problem. Static analysis based APR techniques bypass these issues only to introduce new ones, such as soundness, scalability, and generalizability. This work demonstrates how we can overcome these challenges and achieve sound memory bug repair at scale by lever

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!