An efficient decision procedure for imperative tree data structures

Thomas Wies, Marco Muñiz, Viktor Kuncak

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invariants. We show that our logic is closed under weakest precondition computation, which enables its use for automated software verification. We further show that satisfiability of formulas in TREX is decidable in NP. The low complexity makes it an attractive alternative to more expensive logics such as monadic second-order logic (MSOL) over trees, which have been traditionally used for reasoning about tree data structures.

Original languageEnglish (US)
Title of host publicationAutomated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Proceedings
Pages476-491
Number of pages16
DOIs
StatePublished - 2011
Event23rd International Conference on Automated Deduction, CADE 23 - Wroclaw, Poland
Duration: Jul 31 2011Aug 5 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6803 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other23rd International Conference on Automated Deduction, CADE 23
CountryPoland
CityWroclaw
Period7/31/118/5/11

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An efficient decision procedure for imperative tree data structures'. Together they form a unique fingerprint.

Cite this