A Scalable Inclusion Constraint Solver Using Unification

DOI10.1007/978-3-540-78769-3_9zbMATH Open1179.68042OpenAlexW1479696786MaRDI QIDQ5504597FDOQ5504597

Authors: Ye Zhang, Flemming Nielson 

Publication date: 22 January 2009

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78769-3_9

Recommendations

• Analyses of unsatisfiability for equational logic programming
• scientific article; zbMATH DE number 1738291
• Projection merging
• Optimisation techniques for combing constraint solvers
• scientific article; zbMATH DE number 1538033

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• A theory of type polymorphism in programming
• The Klaim project: Theory and practice
• Title not available (Why is that?)
• Title not available (Why is that?)
• Introduction to set constraint-based program analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Set constraints with intersection
• Foundations of Security Analysis and Design II
• Programming Languages and Systems
• A faster solver for general systems of equations
• Title not available (Why is that?)

Cited In (1)

• Formalisation and implementation of an algorithm for bytecode verification of \(\@\)NonNull types

Uses Software

• ML
• Banshee

This page was built for publication: A Scalable Inclusion Constraint Solver Using Unification

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