Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

GECCO
2008
Springer

favoriteEmaildiscussreport

116views Optimization» more GECCO 2008»

Finding deadlocks in large concurrent Java programs using genetic algorithms

13 years 5 months ago

Finding deadlocks in large concurrent Java programs using genetic algorithms

Download neo.lcc.uma.es

Enrique Alba, J. Francisco Chicano, Marco Ferreira

Real-time Traffic

GECCO 2008 | Optimization |

claim paper

Related Content

» Testing Concurrent Java Programs using Randomized Scheduling

» A randomized dynamic program analysis technique for detecting real deadlocks

» Effective static deadlock detection

» An effective dynamic analysis for detecting generalized deadlocks

» Compositional deadlock detection for rendezvous communication

» Using Runtime Analysis to Guide Model Checking of Java Programs

» Detecting Potential Deadlocks with Static Analysis and RunTime Monitoring

» AspectOriented Race Detection in Java

» ModelChecking Multithreaded Distributed Java Programs

Post Info
More Details (n/a)

Added	09 Nov 2010
Updated	09 Nov 2010
Type	Conference
Year	2008
Where	GECCO
Authors	Enrique Alba, J. Francisco Chicano, Marco Ferreira, Juan Antonio Gómez Pulido

Comments (0)