Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Reports, Documentation, and Standards
  4. On an Efficient Decision Procedure for Imperative Tree Data Structures
 
Loading...
Thumbnail Image
report

On an Efficient Decision Procedure for Imperative Tree Data Structures

Wies, Thomas
•
Muniz, Marko
•
Kuncak, Viktor  
2011

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.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

wies-trex.pdf

Access type

openaccess

Size

333.01 KB

Format

Adobe PDF

Checksum (MD5)

d277281f109520f822a8192c0d81b1ca

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés