Amanote Research

Amanote Research

    RegisterSign In

Existential Heap Abstraction Entailment Is Undecidable

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-44898-5_24
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2003

Authors
Viktor KuncakMartin Rinard
Publisher

Springer Berlin Heidelberg


Related search

TSO-to-TSO Linearizability Is Undecidable

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2017English

Embeddability of Simplicial Complexes Is Undecidable

2020English

What Is Existential Anthropology?

2015English

Discovering Entailment Relations Using "Textual Entailment Patterns"

2005English

Detailed Heap Profiling

ACM SIGPLAN Notices
Computer Science
2018English

An Undecidable Arithmetical Statement

Fundamenta Mathematicae
Number TheoryAlgebra
1949English

Author Correction: Learnability Can Be Undecidable

Nature Machine Intelligence
2019English

Our Lady, Queen of Undecidable Propositions

Journal of Humanistic Mathematics
2016English

Low Dimensional Hybrid Systems – Decidable, Undecidable, Donʼt Know

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy