Analysis of Concurrent Programs [Pisa]

• State of the art prior to project:
  • Based on all possible interleavings/complex domains.
• Achievements:
  • Notion of approximation based on confluence. Scheduling-independent analyses.
  • Top down (operational) suspension analysis.
  • Frameworks for compositional analysis of ccp:
    • based on re-execution
    • based on confluence (source to source program transformation embeds full ccp into confluent ccp)
  • Domain independent correct approximation of ask guards.
    • Shown that in general case no domain independent solution of problem is available.
    • For anti-monotonic properties a domain independent solution exists that can be used to identify sure suspension.
    • Suspension free cc programs can be mapped into CLP progs. (ask approximation not needed, simpler, modular).