Principles of program analysis.

MaRDI QIDQ4671219zbMATH OpenFDO

Authors Flemming Nielson, Hanne Riis Nielson, Chris Hankin

Publication date 26 April 2005

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) General topics in the theory of software (68N01)

Review text

See the review of the first edition (1999) in Zbl 0932.68013.

Cited in

(23)

• From Jinja bytecode to term rewriting: a complexity reflecting transformation
• A monotone framework for CCS
• What is a free name in a process algebra?
• Full characterization of a class of graphs tailored for software watermarking
• Static checking of GDPR-related privacy compliance for object-oriented distributed systems
• Flow analytic type system for array bound checks
• Heuristics for safety and security constraints
• Automated formal analysis and verification: an overview
• Combining Model Checking and Deduction
• Transformations for compositional verification of assumption-commitment properties
• Principles of program analysis
• A sharing-based approach to supporting adaptation in service compositions
• Higher-ranked annotation polymorphic dependency analysis
• Evaluation of the implementation of an abstract interpretation algorithm using tabled CLP*
• Continuity analysis of programs
• May-happen-in-parallel analysis for actor-based concurrency
• A certified lightweight non-interference Java bytecode verifier
• Completeness and Herbrand theorems for nominal logic
• Verifying pointer safety for programs with unknown calls
• Deciding program properties via complete abstractions on bounded domains
• Cost analysis of object-oriented bytecode programs
• Backwards type analysis of asynchronous method calls
• From flow logic to static type systems for coordination languages

This page was built for publication: Principles of program analysis.

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