Shape Neutral Analysis of Graph-based Data-structures

DOI10.1017/S147106841800025XzbMath1451.68174arXiv1804.09352OpenAlexW2964307043MaRDI QIDQ4559807

Joxan Jaffar, Gregory J. Duck, Roland H. C. Yap

Publication date: 4 December 2018

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.09352

zbMATH Keywords

data structuresprogram analysissatisfiability modulo theoriesconstraint handling rulesmemory errorssatisfiability modulo constraint handling rules

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05) Logic programming (68N17)

Uses Software

• Predator
• VeriFast
• SMCHR
• LLBMC
• SLAyer
• CBMC
• Smallfoot

Cites Work

• Finger trees: a simple general-purpose data structure
• Constraint Handling Rules
• Theory and practice of constraint handling rules
• SMCHR: Satisfiability modulo constraint handling rules

This page was built for publication: Shape Neutral Analysis of Graph-based Data-structures