Inferring program specifications in polynomial-time

DOI10.1007/3-540-61739-6_43MaRDI QIDQ5030195zbMATH OpenOpenAlexFDO

Authors Robert L. Givan

Publication date 16 February 2022

Published in Static Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61739-6_43

zbMATH Keywords

functional programminginductiontype inferenceverification

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1638659
• Type inference in polymorphic type discipline
• Static Analysis
• scientific article; zbMATH DE number 2043546
• From Monomorphic to Polymorphic Well-Typings and Beyond

Cites work

• A theory of type polymorphism in programming
• scientific article; zbMATH DE number 3485174 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• On equations for regular languages, finite automata, and sequential networks
• Optimal representations of polymorphic types with subtyping
• Taxonomic syntax for first order inference
• Walther recursion

Cited in

(7)

• Specification inference using context-free language reachability
• The semantic treatment of polymorphic specification languages
• Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
• Protocol Inference Using Static Path Profiles
• A model inference system for generic specification with application to code sharing
• Inferring static non-monotone size-aware types through testing
• On the inference of approximate programs

This page was built for publication: Inferring program specifications in polynomial-time

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