| Document Date: 2015-06-19 11:24:31
Open Document File Size: 77,76 KBShare Result on Facebook
City Torino / San Francisco / Rome / Nice / Lisbon / London / Guwahati / Austin / Warwick / San Diego / Paris / / Company M. Hague A. S. / Matsuda / Ground Annotated Stack Tree Rewrite Systems / Pushdown Systems / CONCUR / / Country France / United States / Italy / Portugal / United Kingdom / India / / Event Reorganization / / Facility Technical University of Munich / University of London / / IndustryTerm inear time algorithm / concurrent software / verification tools / saturation algorithm / Tree generating regular systems / well-structured transition systems / ground stack tree rewriting systems / higher-order model-checking tools / / Organization Technical University of Munich / Engineering and Physical Sciences Research Council / University of London / / Person Naoki Kobayashi / O. Serre / H. Luke Ong / / Position Prime Minister / / ProgrammingLanguage Python / JavaScript / C++ / / PublishedMedium Theoretical Computer Science / / Technology traversal-based algorithm / saturation algorithm / java / context-bounded algorithm / 2012 algorithm / inear time algorithm / shared memory / / URL http /
SocialTag |
Annotated Stack Trees∗ M. Hague1 and V. Penelle2 1 Royal Holloway, University of London 2