Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Dynamic inference of polymorphic lock types

From MaRDI portal
Publication:2575137
Jump to:navigation, search

DOI10.1016/J.SCICO.2005.03.003zbMATH Open1105.68014OpenAlexW2137949167MaRDI QIDQ2575137FDOQ2575137

Yanyan Li

Publication date: 8 December 2005

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

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



zbMATH Keywords

JavaDynamic analysisType inferenceMultithreadingData races


Mathematics Subject Classification ID

Theory of programming languages (68N15)



Cited In (2)

  • Deadlock checking by data race detection
  • Effect-polymorphic behaviour inference for deadlock checking

Uses Software

  • Daikon
  • ESC/Java


   Recommendations
  • Static Analysis πŸ‘ πŸ‘Ž
  • Type inference against races πŸ‘ πŸ‘Ž
  • A Certified Data Race Analysis for a Java-like Language πŸ‘ πŸ‘Ž
  • Title not available (Why is that?) πŸ‘ πŸ‘Ž
  • Title not available (Why is that?) πŸ‘ πŸ‘Ž





This page was built for publication: Dynamic inference of polymorphic lock types

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2575137&oldid=15338787"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 07:29. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki