Skip to main navigation Skip to search Skip to main content

Type inference for parameterized race-free Java

  • Stony Brook University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

53 Scopus citations

Abstract

We study the type system introduced by Boyapati and Rinard in their paper “A Parameterized Type System for Race-Free Java Programs” and try to infer the type annotations (“lock types”) needed by their type checker to show that a program is free of race conditions. Boyapati and Rinard automatically generate some of these annotations using default types and static inference of lock types for local variables, but in practice, the programmer still needs to annotate on the order of 1 in every 25 lines of code. We use run-time techniques, based on the lockset algorithm, in conjunction with some static analysis to automatically infer most or all of the annotations.

Original languageEnglish
Title of host publicationVerification, Model Checking, and Abstract Interpretation - 5th International Conference, VMCAI 2004, Proceedings
EditorsBernhard Steffen, Giorgio Levi
PublisherSpringer Verlag
Pages149-160
Number of pages12
ISBN (Print)9783540208037
DOIs
StatePublished - 2004
Event5th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2004 - Venice, Italy
Duration: Jan 11 2004Jan 13 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2937
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2004
Country/TerritoryItaly
CityVenice
Period01/11/0401/13/04

Fingerprint

Dive into the research topics of 'Type inference for parameterized race-free Java'. Together they form a unique fingerprint.

Cite this