Amanote Research

Amanote Research

    RegisterSign In

Model and Proof Generation for Heap-Manipulating Programs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-54833-8_23
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2014

Authors
Martin BrainCristina DavidDaniel KroeningPeter Schrammel
Publisher

Springer Berlin Heidelberg


Related search

Automatic Numeric Abstractions for Heap-Manipulating Programs

2010English

Multiple Pre/Post Specifications for Heap-Manipulating Methods

2007English

A CLP Heap Solver for Test Case Generation

Theory and Practice of Logic Programming
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceArtificial IntelligenceSoftware
2013English

Weakly Sensitive Analysis for JavaScript Object-Manipulating Programs

Software - Practice and Experience
Software
2019English

Memory System Performance of Programs With Intensive Heap Allocation

ACM Transactions on Computer Systems
Computer Science
1995English

An Integrated Proof Language for Imperative Programs

ACM SIGPLAN Notices
Computer Science
2009English

Analyzing Array Manipulating Programs by Program Transformation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Directed Proof Generation for Machine Code

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Knowledge Representation in a Proof Checker for Logic Programs

2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy