Sciweavers

FOSSACS
2016
Springer
8 years 24 days ago
A Theory of Slicing for Probabilistic Control Flow Graphs
The task of program slicing is to remove the parts of a program that are irrelevant in a given context. In probabilistic programs, where variables may be assigned random values fr...
Torben Amtoft, Anindya Banerjee
FOSSACS
2016
Springer
8 years 24 days ago
Coverability Trees for Petri Nets with Unordered Data
We study an extension of classical Petri nets where tokens carry values from a countable data domain, that can be tested for equality upon firing transitions. These Unordered Data...
Piotr Hofman, Slawomir Lasota, Ranko Lazic, J&eacu...