{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:18:22Z","timestamp":1725549502191},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240587"},{"type":"electronic","value":"9783540305385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30538-5_2","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T08:40:30Z","timestamp":1268383230000},"page":"16-31","source":"Crossref","is-referenced-by-count":11,"title":["Verifying Probabilistic Procedural Programs"],"prefix":"10.1007","author":[{"given":"Javier","family":"Esparza","sequence":"first","affiliation":[]},{"given":"Kousha","family":"Etessami","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","first-page":"304","volume-title":"Computer Aided Verification","author":"R. Alur","year":"2001","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Analysis of recursive state machines. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 304\u2013313. Springer, Heidelberg (2001)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR 1997: Concurrency Theory","author":"A. Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Applications to model checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 135\u2013150. Springer, Heidelberg (1997)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/3-540-48224-5_54","volume-title":"Automata, Languages and Programming","author":"M. Benedikt","year":"2001","unstructured":"Benedikt, M., Godefroid, P., Reps, T.: Model checking of unrestricted hierarchical state machines. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 652\u2013666. Springer, Heidelberg (2001)"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.3233\/JCS-2001-9303","volume":"9","author":"F. Besson","year":"2001","unstructured":"Besson, F., Jensen, T., M\u00e9tayer, D.L., Thorn, T.: Model checking security properties of control flow graphs. Journal of Computer Security\u00a09, 217\u2013250 (2001)","journal-title":"Journal of Computer Security"},{"key":"2_CR5","unstructured":"Br\u00e1zdil, T., Ku\u010dera, A., Stra\u017eovsk\u00fd, O.: Decidability of temporal properties of probabilistic pushdown automata. Technical report (in preparation)"},{"issue":"6","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1145\/235809.235813","volume":"43","author":"S. Basu","year":"1996","unstructured":"Basu, S., Pollack, R., Roy, M.F.: On the combinatorial and algebraic complexity of quantifier elimination. Journal of the ACM\u00a043(6), 1002\u20131045 (1996)","journal-title":"Journal of the ACM"},{"issue":"5","key":"2_CR7","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1109\/T-C.1973.223746","volume":"22","author":"T.L. Booth","year":"1973","unstructured":"Booth, T.L., Thompson, R.A.: Applying probability measures to abstract languages. IEEE Transactions on Computers\u00a022(5), 442\u2013450 (1973)","journal-title":"IEEE Transactions on Computers"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Canny, J.: Some algebraic and geometric computations in pspace. In: Proceedings of 20th ACM STOC, pp. 460\u2013467 (1988)","DOI":"10.1145\/62212.62257"},{"issue":"4","key":"2_CR9","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1145\/210332.210339","volume":"42","author":"C. Courcoubetis","year":"1995","unstructured":"Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. Journal of the ACM\u00a042(4), 857\u2013907 (1995)","journal-title":"Journal of the ACM"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/10722167_20","volume-title":"Computer Aided Verification","author":"J. Esparza","year":"2000","unstructured":"Esparza, J., Hansel, D., Rossmanith, P., Schwoon, S.: Efficient algorithms for model checking pushdown systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 232\u2013247. Springer, Heidelberg (2000)"},{"key":"2_CR11","unstructured":"Esparza, J., Ku\u010dera, A., Mayr, R.: Model checking probabilistic pushdown automata. In: Proceedings of LICS 2004, pp. 12\u201321. IEEE Computer Society, Los Alamitos (2004), Full version: Tech. report FIMU-RS-2004-03, Masaryk University, Brno, available online at http:\/\/www.fmi.uni-stuttgart.de\/szs\/publications\/info\/esparza.EKM04rep.shtml."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Etessami, K., Yannakakis, M.: Recursive markov chains, stochastic grammars, and monotone systems of non-linear equations. Technical report, School of Informatics, University of Edinburgh (2004)","DOI":"10.1007\/978-3-540-31856-9_28"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: Some NP-complete geometric problems. In: Proceedings of 8th ACM STOC, pp. 10\u201322 (1976)","DOI":"10.1145\/800113.803626"},{"key":"2_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-51866-9","volume-title":"The Theory of Branching Processes","author":"T.E. Harris","year":"1963","unstructured":"Harris, T.E.: The Theory of Branching Processes. Springer, Heidelberg (1963)"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"6","author":"H. Hansson","year":"1994","unstructured":"Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects of Computing\u00a06, 512\u2013535 (1994)","journal-title":"Formal Aspects of Computing"},{"key":"2_CR16","unstructured":"Ku\u010dera, A.: Private communication (2004)"},{"key":"2_CR17","first-page":"351","volume-title":"Proceedings of LICS 2003","author":"M. Kwiatkowska","year":"2003","unstructured":"Kwiatkowska, M.: Model checking for probability and time: From theory to practice. In: Proceedings of LICS 2003, pp. 351\u2013360. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"2_CR18","unstructured":"Mayr, R.: Private communication (2004)"},{"key":"2_CR19","volume-title":"Foundations of Statistical Natural Language Processing","author":"C. Manning","year":"1999","unstructured":"Manning, C., Sch\u00fctze, H.: Foundations of Statistical Natural Language Processing. MIT Press, Cambridge (1999)"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. Parts I,II, III. Journal of Symbolic Computation, 255\u2013352 (1992)","DOI":"10.1016\/S0747-7171(10)80005-7"},{"key":"2_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2272-7","volume-title":"Introduction to Numerical Analysis","author":"J. Stoer","year":"1993","unstructured":"Stoer, J., Bulirsch, R.: Introduction to Numerical Analysis. Springer, Heidelberg (1993)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Tiwari, P.: A problem that is easier to solve on the unit-cost algebraic RAM. Journal of Complexity, 393\u2013397 (1992)","DOI":"10.1016\/0885-064X(92)90003-T"},{"key":"2_CR23","first-page":"327","volume-title":"Proceedings of FOCS 1985","author":"M. Vardi","year":"1985","unstructured":"Vardi, M.: Automatic verification of probabilistic concurrent finite-state programs. In: Proceedings of FOCS 1985, pp. 327\u2013338. IEEE Computer Society Press, Los Alamitos (1985)"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-44450-5_10","volume-title":"FST TCS 2000: Foundations of Software Technology and Theoretical Science","author":"I. Walukiewicz","year":"2000","unstructured":"Walukiewicz, I.: Model checking CTL properties of pushdown systems. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol.\u00a01974, pp. 127\u2013138. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30538-5_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,24]],"date-time":"2021-10-24T15:22:57Z","timestamp":1635088977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30538-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240587","9783540305385"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30538-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}