Logical Approaches to Computational Barriers

DOI10.1007/11780342MaRDI QIDQ5898797zbMATH OpenOpenAlexDBLPFDO

Authors Erika Ábrahám, Andreas Grüner, Martin Steffen

Publication date 30 April 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11780342

zbMATH Keywords

class-based oo languagesformal semanticsheap abstractionobservable behavioropen systemsthread-based concurrency

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• Theoretical Aspects of Computing - ICTAC 2004
• scientific article; zbMATH DE number 1231693
• A fully abstract may testing semantics for concurrent objects
• Full abstraction at package boundaries of object-oriented languages
• scientific article; zbMATH DE number 1330431

Cited in

(4)

• A generic framework for heap and value analyses of object-oriented programming languages
• Monotonic Abstraction for Programs with Dynamic Memory Heaps
• Quantified Heap Invariants for Object-Oriented Programs
• Theoretical Aspects of Computing - ICTAC 2004

This page was built for publication: Logical Approaches to Computational Barriers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898797)