Typestate-like Analysis of Multiple Interacting Objects Nomair A. Naeem Ondˇrej Lhot´ak D. R. Cheriton School of Computer Science

Source URL: plg.uwaterloo.ca

Effective Typestate Verification in the Presence of Aliasing STEPHEN J. FINK and ERAN YAHAV IBM T. J. Watson Research Center and NURIT DOR1

Source URL: www.cs.technion.ac.il

• Logic in computer science
• Formal methods
• Formal verification
• Pointer analysis
• Shape analysis
• Pointer
• The Verifier
• Abstract interpretation
• IP
• Theoretical computer science
• Applied mathematics
• Static program analysis

Efficient Hybrid Typestate Analysis by Determining Continuation-Equivalent States ∗ Eric Bodden

Source URL: www.bodden.de

• Software
• Formal methods
• Logic in computer science
• Runtime verification
• Static program analysis
• Pointer analysis
• NOP
• Type system
• Algorithm
• Program analysis
• Computing
• Programming language theory

Effective Typestate Verification in the Presence of Aliasing Stephen Fink∗ ∗ Eran Yahav∗ Nurit Dor†

Source URL: www.cs.technion.ac.il

• Mathematics
• Data management
• Complexity classes
• NP
• Pointer analysis
• Pointer
• Abstraction
• Formal verification
• Shape analysis
• Theoretical computer science
• Static program analysis
• Applied mathematics