Who is pointing when to whom?

Authors:
Dino Distefano;Joost-Pieter Katoen;Arend Rensink
Affiliations:
Department of Computer Science, University of Twente, Enschede, The Netherlands;Department of Computer Science, University of Twente, Enschede, The Netherlands;Department of Computer Science, University of Twente, Enschede, The Netherlands
Venue:
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2004

Citing 16
Cited 11

Analysis of pointers and structures

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Interprocedural may-alias analysis for pointers: beyond k-limiting

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Automatic verification of pointer programs using monadic second-order logic

Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Solving shape-analysis problems in languages with destructive updating

ACM Transactions on Programming Languages and Systems (TOPLAS)
Checking that finite state concurrent programs satisfy their linear specification

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Anytime, anywhere: modal logics for mobile ambients

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resolution of dynamic memory allocation and pointers for the behavioral synthesis form C

DATE '00 Proceedings of the conference on Design, automation and test in Europe
BI as an assertion language for mutable data structures

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An assertion language for data structures

POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Verifying reachability invariants of linked structures

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Spatial Logic for Querying Graphs

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Model Checking Birth and Death

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Storeless semantics and alias logic

Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Separation and information hiding

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verifying temporal heap properties specified via evolution logic

ESOP'03 Proceedings of the 12th European conference on Programming

Reasoning About Sequences of Memory States

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Abstract Graph Transformation

Electronic Notes in Theoretical Computer Science (ENTCS)
The spotlight principle: on combining process-summarizing state abstractions

VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
A temporal graph logic for verification of graph transformation systems

WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
Counterpart semantics for a second-order µ-calculus

ICGT'10 Proceedings of the 5th international conference on Graph transformations
Safety and liveness in concurrent pointer programs

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Beyond reachability: shape abstraction in the presence of pointer arithmetic

SAS'06 Proceedings of the 13th international conference on Static Analysis
A parametric model for the analysis of mobile ambients

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Automatic termination proofs for programs with shape-shifting heaps

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Model checking quantified computation tree logic

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Counterpart Semantics for a Second-Order μ-Calculus

Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces an extension of linear temporal logic that allows to express properties about systems that are composed of entities (like objects) that can refer to each other via pointers. Our logic is focused on specifying properties about the dynamic evolution (such as creation, adaptation, and removal) of such pointer structures. The semantics is based on automata on infinite words, extended with appropriate means to model evolving pointer structures in an abstract manner. A tableau-based model-checking algorithm is proposed to automatically verify these automata against formulae in our logic.