Introduction to set constraint-based program analysis

DOI10.1016/S0167-6423(99)00007-6zbMath0940.68031OpenAlexW2040152339MaRDI QIDQ1818069

Alexander Aiken

Publication date: 4 January 2000

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6423(99)00007-6

zbMATH Keywords

program analysis

Mathematics Subject Classification ID

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

Related Items (13)

Abstract interpretation as automated deduction ⋮ Abstract Interpretation as Automated Deduction ⋮ Set Constraints, Pattern Match Analysis, and SMT ⋮ Property-directed incremental invariant generation ⋮ Formalisation and implementation of an algorithm for bytecode verification of \(\@\)NonNull types ⋮ Tree automata with one memory set constraints and cryptographic protocols ⋮ Decision Procedures for Multisets with Cardinality Constraints ⋮ On memoryless provers and insincere verifiers ⋮ Cryptographic Analysis in Cubic Time ⋮ A Scalable Inclusion Constraint Solver Using Unification ⋮ Automated formal analysis and verification: an overview ⋮ Selectors make set-based analysis too hard ⋮ Combining sets with cardinals

This page was built for publication: Introduction to set constraint-based program analysis