Set Constraints, Pattern Match Analysis, and SMT

DOI10.1007/978-3-030-47147-7_6zbMath1503.68044arXiv1905.09423OpenAlexW3025668779MaRDI QIDQ5098738

Joseph Eremondi

Publication date: 30 August 2022

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

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

zbMATH Keywords

program analysispattern matchingset constraintsSMT

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computational aspects of satisfiability (68R07)

Uses Software

• z3
• CVC4
• Banshee
• Stardust
• GitHub
• Rust

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Introduction to set constraint-based program analysis
• Decidability of systems of set constraints with negative constraints
• Solvable cases of the decision problem
• Types for Flexible Objects
• Polymorphic Functions with Set-Theoretic Types
• THE ANALYSIS OF SINGLETONS IN GENERALIZED BIRTHDAY PROBLEMS
• Tridirectional typechecking
• Set constraints with projections

This page was built for publication: Set Constraints, Pattern Match Analysis, and SMT