@inproceedings{10.1007/978-3-642-31424-7_51,
    Abstract = {We present APEX, a tool for analysing probabilistic programs that are open, i.e. where variables or even functions can be left unspecified. APEX transforms a program into an automaton that captures the program's probabilistic behaviour under all instantiations of the unspecified components. The translation is compositional and effectively leverages state reduction techniques. APEX can then further analyse the produced automata; in particular, it can check two automata for equivalence which translates to equivalence of the corresponding programs under all environments. In this way, APEX can verify a broad range of anonymity and termination properties of randomised protocols and other open programs, sometimes with an exponential speed-up over competing state-of-the-art approaches.},
    Address = {Berlin, Heidelberg},
    Author = {Kiefer, Stefan and Murawski, Andrzej S. and Ouaknine, Jo{\"e}l and Wachter, Bj{\"o}rn and Worrell, James},
    BookTitle = {Computer Aided Verification},
    Editor = {Madhusudan, P. and Seshia, Sanjit A.},
    File = {apex12 (0) - a - a - f.pdf},
    ISBN = {978-3-642-31424-7},
    Pages = {693--698},
    Publisher = {Springer Berlin Heidelberg},
    Title = {APEX: An Analyzer for Open Probabilistic Programs},
    Year = {2012},
    date-added = {2018-06-29 19:54:43 +0000},
    date-modified = {2018-06-29 19:54:43 +0000},
    doi = {10.1007/978-3-642-31424-7_51}
}

@inproceedings{10.1007/978-3-642-31424-7_51, Abstract = {We present APEX, a tool for analysing probabilistic programs that are open, i.e. where variables or even functions can be left unspecified. APEX transforms a program into an automaton that captures the program's probabilistic behaviour under all instantiations of the unspecified components. The translation is compositional and effectively leverages state reduction techniques. APEX can then further analyse the produced automata; in particular, it can check two automata for equivalence which translates to equivalence of the corresponding programs under all environments. In this way, APEX can verify a broad range of anonymity and termination properties of randomised protocols and other open programs, sometimes with an exponential speed-up over competing state-of-the-art approaches.}, Address = {Berlin, Heidelberg}, Author = {Kiefer, Stefan and Murawski, Andrzej S. and Ouaknine, Jo{\"e}l and Wachter, Bj{\"o}rn and Worrell, James}, BookTitle = {Computer Aided Verification}, Editor = {Madhusudan, P. and Seshia, Sanjit A.}, File = {apex12 (0) - a - a - f.pdf}, ISBN = {978-3-642-31424-7}, Pages = {693--698}, Publisher = {Springer Berlin Heidelberg}, Title = {APEX: An Analyzer for Open Probabilistic Programs}, Year = {2012}, date-added = {2018-06-29 19:54:43 +0000}, date-modified = {2018-06-29 19:54:43 +0000}, doi = {10.1007/978-3-642-31424-7_51} }