Building a Calculus of Data Structures

DOI10.1007/978-3-642-11319-2_6zbMath1273.68100OpenAlexW1497884533MaRDI QIDQ3656874

Philippe Suter, Thomas Wies, Viktor Kuncak, Ruzica Piskac

Publication date: 14 January 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-11319-2_6

Mathematics Subject Classification ID

Logic in computer science (03B70) Data structures (68P05) Combined logics (03B62)

Related Items (2)

Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates ⋮ Sets with Cardinality Constraints in Satisfiability Modulo Theories

Uses Software

• UCLID
• cvc3

This page was built for publication: Building a Calculus of Data Structures