Static Analysis

DOI10.1007/B99688zbMATH Open1104.68399OpenAlexW4291238798MaRDI QIDQ5466554FDOQ5466554

Authors: Cormac Flanagan, Stephen N. Freund 

Publication date: 24 August 2005

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

Full work available at URL: https://doi.org/10.1007/b99688

Recommendations

• Type inference against races
• Dynamic inference of polymorphic lock types
• scientific article; zbMATH DE number 1728236
• scientific article; zbMATH DE number 2104620
• Type and behaviour reconstruction for higher-order concurrent programs

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cited In (6)

• Dynamic inference of polymorphic lock types
• Type inference against races
• Type inference and strong static type checking for Promela
• Title not available (Why is that?)
• Deadlock checking by data race detection
• A computational complexity analysis of tunable type inference for Generic Universe Types

This page was built for publication: Static Analysis

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