6 papers:
ISSTA-2014-LinK #automation #concurrent #multi #satisfiability #source code #thread #using- Automatic repair for multi-threaded programs with Deadlock/Livelock using maximum satisfiability (YL, SSK), pp. 237–247.
AdaEurope-2007-BliebergerBM #ada #detection #multi #source code #static analysis- Static Detection of Livelocks in Ada Multitasking Programs (JB, BB, RM), pp. 69–83.
HPDC-2001-JardineSC #concurrent- Livelock Avoidance for Meta-Schedulers (JJ, QS, MJC), pp. 141–146.
TACAS-1999-DongDRRRSSSW #case study #comparative #concurrent #tool support #verification- Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools (YD, XD, YSR, CRR, IVR, SAS, OS, EWS, DSW), pp. 74–88.
- AdaEurope-1991-ChengU #ada #petri net #using
- Analyzing Ada Tasking Deadlocks and Livelocks Using Extended Petri Nets (JC, KU), pp. 125–146.
STOC-1980-Toueg #network- Deadlock- and Livelock-Free Packet Switching Networks (ST), pp. 94–99.
