Constraint abstractions

DOI10.1007/3-540-44978-7_5MaRDI QIDQ4529773zbMATH OpenFDO

Authors Jörgen Gustavsson, Josef Svenningsson

Publication date 6 May 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2053/20530063

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Type-base flow analysis
• A usage analysis with bounded usage polymorphism and subtyping
• Simplifying subtyping constraints: a theory
• scientific article; zbMATH DE number 1130261
• Type-based flow analysis and context-free language reachability

Cited in

(9)

• Constraints, consistency and closure
• Managing the granularity of constraint-based analyses by rule transformation.
• A usage analysis with bounded usage polymorphism and subtyping
• Entailment with conditional equality constraints
• Constraints in non-Boolean contexts
• Skalpel: a constraint-based type error slicer for standard ML
• On the complexity of set-based analysis
• A Scalable Inclusion Constraint Solver Using Unification
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: Constraint abstractions

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