Ordered sets in the calculus of data structures

DOI10.1007/978-3-642-15205-4_5MaRDI QIDQ3586032zbMATH OpenOpenAlexFDO

Authors Viktor Kuncak, Ružica Piskač, Philippe Suter

Publication date 3 September 2010

Published in Computer Science Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15205-4_5

Mathematics Subject Classification ID

Logic in computer science (03B70) Logical aspects of Boolean algebras (03G05) Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Building a calculus of data structures
• Deciding Boolean algebra with Presburger arithmetic
• Automated Deduction – CADE-20
• Sets with cardinality constraints in satisfiability modulo theories
• Combining theories with shared set operations

Cited in

(12)

• Data structures for order-sensitive predicates in parallel nondeterministic systems
• NP satisfiability for arrays as powers
• Sets and ordered structures
• Decision Procedures for Automating Termination Proofs
• Building a calculus of data structures
• scientific article; zbMATH DE number 3821436 (Why is no real title available?)
• scientific article; zbMATH DE number 512377 (Why is no real title available?)
• Automated Deduction – CADE-20
• Mathematical tools for data mining. Set theory, partial orders, combinatorics
• On algebraic array theories
• Succinct ordering and aggregation constraints in algebraic array theories
• Deciding Boolean algebra with Presburger arithmetic

Describes a project that uses

Uses Software

• Scala

This page was built for publication: Ordered sets in the calculus of data structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586032)