Sökning: "name boundedness"

Hittade 1 uppsats innehållade orden name boundedness.

  1. 1. Algorithmic Analysis of Name-Bounded Programs : From Java programs to Petri Nets via π-calculus

    Master-uppsats, Blekinge Tekniska Högskola/Institutionen för programvaruteknik

    Författare :Matteo Settenvini; [2014]
    Nyckelord :pi-calculus; static verification; static analysis; concurrency; petri nets; name boundedness;

    Sammanfattning : Context. Name-bounded analysis is a type of static analysis that allows us to take a concurrent program, abstract away from it, and check for some interesting properties, such as deadlock-freedom, or watching the propagation of variables across different components or layers of the system. Objectives. LÄS MER