In this thesis are presented different program slicing techniques for two concurrent languages: CSP and Petri Nets. As for CSP, two static slices are introduced, using both a new kind of graph. Furthermore, their implementation is also presented and tested. As for Petri Nets, two dynamic slicing techniques are proposed.Tamarit Muñoz, S. (2008). Slicing Techniques Applied to Concurrent Languages. http://hdl.handle.net/10251/13627Archivo delegad
International audienceConcurrent Constraint Programming (CCP) is a declarative model for concurrency...
Program Slicing is the process of deleting statements in a program that do not affect a given set of...
International audienceConcurrent Constraint Programming (CCP) is a declarative model for concurrency...
AbstractPetri nets provide a means for modelling and verifying the behavior of concurrent systems. P...
AbstractStatic analysis of concurrent languages is a complex task due to the non-deterministic execu...
Static analysis of concurrent languages is a complex task due to the non-deterministic execution of ...
Program slicing is a technique to identify statements that may influence the computations in other s...
Concurrent Constraint Programming (CCP) is a declarative model for concurrency where agents interact...
Dynamic slicing is a technique to extract the part of the program (called slice) that influences or...
Petri nets slicing is a technique that aims to improve the verification of systems modeled in Petri ...
Concurrent Constraint Programming (CCP) is declarative model for concurrency where agents interact b...
International audienceConcurrent Constraint Programming (CCP) is a declarative model for concurrency...
Program Slicing is the process of deleting statements in a program that do not affect a given set of...
International audienceConcurrent Constraint Programming (CCP) is a declarative model for concurrency...
AbstractPetri nets provide a means for modelling and verifying the behavior of concurrent systems. P...
AbstractStatic analysis of concurrent languages is a complex task due to the non-deterministic execu...
Static analysis of concurrent languages is a complex task due to the non-deterministic execution of ...
Program slicing is a technique to identify statements that may influence the computations in other s...
Concurrent Constraint Programming (CCP) is a declarative model for concurrency where agents interact...
Dynamic slicing is a technique to extract the part of the program (called slice) that influences or...
Petri nets slicing is a technique that aims to improve the verification of systems modeled in Petri ...
Concurrent Constraint Programming (CCP) is declarative model for concurrency where agents interact b...
International audienceConcurrent Constraint Programming (CCP) is a declarative model for concurrency...
Program Slicing is the process of deleting statements in a program that do not affect a given set of...
International audienceConcurrent Constraint Programming (CCP) is a declarative model for concurrency...