Formalisation and implementation of an algorithm for bytecode verification of \(\@\)NonNull types

DOI10.1016/j.scico.2010.10.004zbMath1215.68069OpenAlexW2035638985MaRDI QIDQ532427

Alex Potanin, Chris Male, Constantine Dymnikov, David J. Pearce

Publication date: 4 May 2011

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

Full work available at URL: https://doi.org/10.1016/j.scico.2010.10.004

zbMATH Keywords

Javastatic analysisbytecode verificationNonNull types

Mathematics Subject Classification ID

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

Related Items (1)

Formalisation and implementation of an algorithm for bytecode verification of \(\@\)NonNull types

Uses Software

• ESC/Java
• Dava

Cites Work

• Formalisation and implementation of an algorithm for bytecode verification of \(\@\)NonNull types
• An efficient general iterative algorithm for dataflow analysis
• Java bytecode verification: Algorithms and formalizations
• Introduction to set constraint-based program analysis
• A Scalable Inclusion Constraint Solver Using Unification
• Verification, Model Checking, and Abstract Interpretation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Formalisation and implementation of an algorithm for bytecode verification of \(\@\)NonNull types