?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=Almost+sure+productivity&rft.creator=Aguirre%2C+A&rft.creator=Barthe%2C+G&rft.creator=Hsu%2C+J&rft.creator=Silva%2C+A&rft.description=We+introduce+Almost+Sure+Productivity+(ASP)%2C+a+probabilistic+generalization+of+the+productivity%0D%0Acondition+for+coinductively+defined+structures.+Intuitively%2C+a+probabilistic+coinductive+stream+or%0D%0Atree+is+ASP+if+it+produces+infinitely+many+outputs+with+probability+1.+Formally%2C+we+define+ASP%0D%0Ausing+a+final+coalgebra+semantics+of+programs+inspired+by+Kerstan+and+K%C3%B6nig.+Then%2C+we+introduce%0D%0Aa+core+language+for+probabilistic+streams+and+trees%2C+and+provide+two+approaches+to+verify+ASP%3A%0D%0Aa+syntactic+sufficient+criterion%2C+and+a+decision+procedure+by+reduction+to+model-checking+LTL%0D%0Aformulas+on+probabilistic+pushdown+automata.&rft.subject=Coinduction%2C+Probabilistic+Programming%2C+Productivity&rft.publisher=LIPIcs+%2C+Schloss+Dagstuhl+-+Leibniz-Zentrum+f%C3%BCr+Informatik&rft.date=2018-07-01&rft.type=Proceedings+paper&rft.language=eng&rft.source=+++++In%3A++Proceedings+of+the+45th+International+Colloquium+on+Automata%2C+Languages%2C+and+Programming+(ICALP+2018).++(pp.+113.1-113.15).++LIPIcs+%2C+Schloss+Dagstuhl+-+Leibniz-Zentrum+f%C3%BCr+Informatik%3A+Prague%2C+Czech+Republic.+(2018)+++++&rft.format=text&rft.identifier=https%3A%2F%2Fdiscovery.ucl.ac.uk%2Fid%2Feprint%2F10056434%2F1%2FLIPIcs-ICALP-2018-113.pdf&rft.identifier=https%3A%2F%2Fdiscovery.ucl.ac.uk%2Fid%2Feprint%2F10056434%2F&rft.rights=open