{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:47:54Z","timestamp":1764841674371,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237010"},{"type":"electronic","value":"9783642237027"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23702-7_24","type":"book-chapter","created":{"date-parts":[[2011,9,9]],"date-time":"2011-09-09T17:31:31Z","timestamp":1315589491000},"page":"316-333","source":"Crossref","is-referenced-by-count":22,"title":["Probabilistically Accurate Program Transformations"],"prefix":"10.1007","author":[{"given":"Sasa","family":"Misailovic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel M.","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin C.","family":"Rinard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Ansel, J., Chan, C., Wong, Y., Olszewski, M., Zhao, Q., Edelman, A., Amara-singhe, S.: Petabricks: A language and compiler for algorithmic choice. In: PLDI 2010 (2010)","DOI":"10.1145\/1542476.1542481"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Arnold, B., Balakrishnan, N., Nagaraja, H.: A first course in order statistics. Society for Industrial Mathematics, Philadelphia (2008)","DOI":"10.1137\/1.9780898719062"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Baek, W., Chilimbi, T.: Green: A framework for supporting energy-conscious programming using controlled approximation. In: PLDI 2010 (2010)","DOI":"10.1145\/1806596.1806620"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Bienia, C., Kumar, S., Singh, J.P., Li, K.: The PARSEC benchmark suite: Characterization and architectural implications. In: PACT 2008 (2008)","DOI":"10.1145\/1454115.1454128"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Carbin, M., Rinard, M.: Automatically Identifying Critical Input Regions and Code in Applications. In: ISSTA 2010 (2010)","DOI":"10.1145\/1831708.1831713"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Gulwani, S., Lublinerman, R.: Continuity analysis of programs. In: POPL 2010 (2010)","DOI":"10.1145\/1706299.1706308"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Gulwani, S., Lublinerman, R., Navidpour, S.: Proving Programs Robust. In: FSE 2011 (2011)","DOI":"10.1145\/2025113.2025131"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Solar-Lezama, A.: Smooth interpretation. In: PLDI 2010 (2010)","DOI":"10.1145\/1806596.1806629"},{"key":"24_CR9","volume-title":"Sampling techniques","author":"W.G. Cochran","year":"1977","unstructured":"Cochran, W.G.: Sampling techniques. John Wiley & Sons, Chichester (1977)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Di Pierro, A., Hankin, C., Wiklicky, H.: A systematic approach to probabilistic pointer analysis. In: ASPLAS 2007 (2007)","DOI":"10.1007\/978-3-540-76637-7_23"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Di Pierro, A., Hankin, C., Wiklicky, H.: Probabilistic \u03bb-calculus and quantitative program analysis. Journal of Logic and Computation (2005)","DOI":"10.1093\/logcom\/exi008"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Di Pierro, A., Wiklicky, H.: Concurrent constraint programming: Towards probabilistic abstract interpretation. In: PPDP 2000 (2000)","DOI":"10.1145\/351268.351284"},{"key":"24_CR13","unstructured":"Goodman, N., Mansinghka, V., Roy, D., Bonawitz, K., Tenenbaum, J.: Church: a language for generative models. In: UAI 2008 (2008)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Necula, G.C.: Precise interprocedural analysis using random interpretation. In: POPL 2005 (2005)","DOI":"10.1145\/1040305.1040332"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Zuleger, F.: The reachability-bound problem. In: PLDI 2010 (2010)","DOI":"10.1145\/1806596.1806630"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Hall, M., Murphy, B., Amarasinghe, S., Liao, S., Lam, M.: Interprocedural analysis for parallelization. In: Languages and Compilers for Parallel Computing (1996)","DOI":"10.1007\/BFb0014192"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Hoffman, H., Sidiroglou, S., Carbin, M., Misailovic, S., Agarwal, A., Rinard, M.: Dynamic knobs for power-aware computing. In: ASPLOS 2011 (2011)","DOI":"10.1145\/1950365.1950390"},{"key":"24_CR18","unstructured":"Hoffmann, H., Misailovic, S., Sidiroglou, S., Agarwal, A., Rinard, M.: Using Code Perforation to Improve Performance, Reduce Energy Consumption, and Respond to Failures. Technical Report MIT-CSAIL-TR-2009-042 (2009)"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-45685-6_16","volume-title":"Theorem Proving in Higher Order Logics","author":"J. Hurd","year":"2002","unstructured":"Hurd, J.: A formal approach to probabilistic termination. In: Carre\u00f1o, V.A., Mu\u00f1oz, C.A., Tahar, S. (eds.) TPHOLs 2002. LNCS, vol.\u00a02410, p. 230. Springer, Heidelberg (2002)"},{"key":"24_CR20","volume-title":"Optimizing compilers for modern architectures: a dependence-based approach","author":"K. Kennedy","year":"2002","unstructured":"Kennedy, K., Allen, J.R.: Optimizing compilers for modern architectures: a dependence-based approach. Morgan Kaufmann, San Francisco (2002)"},{"key":"24_CR21","unstructured":"Klir, G.: Uncertainty and information. John Wiley & Sons, Chichester (2006)"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Semantics of probabilistic programs. Journal of Computer and System Sciences (1981)","DOI":"10.1016\/0022-0000(81)90036-2"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Prism: Probabilistic symbolic model checker. In: Computer Performance Evaluation: Modelling Techniques and Tools (2002)","DOI":"10.1007\/3-540-46029-2_13"},{"key":"24_CR24","unstructured":"Misailovic, S., Roy, D., Rinard, M.: Probabilistic and Statistical Analysis of Per-forated Patterns. Technical Report MIT-CSAIL-TR-2011-003, MIT (2011)"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Misailovic, S., Sidiroglou, S., Hoffmann, H., Rinard, M.: Quality of service profiling. In: ICSE 2010 (2010)","DOI":"10.1145\/1806799.1806808"},{"key":"24_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-540-45099-3_17","volume-title":"Static Analysis","author":"D. Monniaux","year":"2000","unstructured":"Monniaux, D.: Abstract interpretation of probabilistic semantics. In: SAS 2000. LNCS, vol.\u00a01824, pp. 322\u2013340. Springer, Heidelberg (2000)"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Monniaux, D.: An abstract monte-carlo method for the analysis of probabilistic programs. In: POPL 2001 (2001)","DOI":"10.1145\/360204.360211"},{"key":"24_CR28","volume-title":"Interval analysis","author":"R.E. Moore","year":"1966","unstructured":"Moore, R.E.: Interval analysis. Prentice-Hall, Englewood Cliffs (1966)"},{"key":"24_CR29","unstructured":"Morgan, C., McIver, A.: pGCL: formal reasoning for random algorithms. South African Computer Journal\u00a022 (1999)"},{"key":"24_CR30","doi-asserted-by":"crossref","unstructured":"Park, S., Pfenning, F., Thrun, S.: A probabilistic language based upon sampling functions. In: POPL 2005 (2005)","DOI":"10.1145\/1040305.1040320"},{"key":"24_CR31","doi-asserted-by":"crossref","unstructured":"Ramsey, N., Pfeffer, A.: Stochastic lambda calculus and monads of probability distributions. In: POPL 2002 (2002)","DOI":"10.1145\/503272.503288"},{"key":"24_CR32","doi-asserted-by":"crossref","unstructured":"Reed, J., Pierce, B.C.: Distance makes the types grow stronger: a calculus for differential privacy. In: ICFP 2010 (2010)","DOI":"10.1145\/1863543.1863568"},{"key":"24_CR33","doi-asserted-by":"crossref","unstructured":"Rinard, M.: Probabilistic accuracy bounds for fault-tolerant computations that discard tasks. In: ICS 2006 (2006)","DOI":"10.1145\/1183401.1183447"},{"key":"24_CR34","doi-asserted-by":"crossref","unstructured":"Rinard, M.: Using early phase termination to eliminate load imbalances at barrier synchronization points. In: OOPSLA 2007 (2007)","DOI":"10.1145\/1297027.1297055"},{"key":"24_CR35","doi-asserted-by":"crossref","unstructured":"Rinard, M., Hoffmann, H., Misailovic, S., Sidiroglou, S.: Patterns and statistical analysis for understanding reduced resource computing. In: Onward! 2010 (2010)","DOI":"10.1145\/1869459.1869525"},{"key":"24_CR36","doi-asserted-by":"crossref","unstructured":"Saheb-Djahromi, N.: Probabilistic LCF. In: MFCS 1978 (1978)","DOI":"10.1007\/3-540-08921-7_92"},{"key":"24_CR37","doi-asserted-by":"crossref","unstructured":"Sampson, A., Dietl, W., Fortuna, E., Gnanapragasam, D., Ceze, L., Grossman, D.: Enerj: Approximate data types for safe and general low-power computation. In: PLDI 2011 (2011)","DOI":"10.1145\/1993498.1993518"},{"key":"24_CR38","doi-asserted-by":"crossref","unstructured":"Sidiroglou, S., Misailovic, S., Hoffmann, H., Rinard, M.: Managing Performance vs. Accuracy Trade-offs With Loop Perforation. In: FSE 2011 (2011)","DOI":"10.1145\/2025113.2025133"},{"key":"24_CR39","doi-asserted-by":"crossref","unstructured":"Smith, M.: Probabilistic abstract interpretation of imperative programs using truncated normal distributions. Electronic Notes in Theoretical Computer Science (2008)","DOI":"10.1016\/j.entcs.2008.11.018"},{"key":"24_CR40","doi-asserted-by":"crossref","unstructured":"Sorber, J., Kostadinov, A., Garber, M., Brennan, M., Corner, M.D., Berger, E.D.: Eon: a language and runtime system for perpetual systems. In: SenSys 2007 (2007)","DOI":"10.1145\/1322263.1322279"},{"key":"24_CR41","volume-title":"The algebra of random variables","author":"M.D. Springer","year":"1979","unstructured":"Springer, M.: The algebra of random variables. John Wiley & Sons, Chichester (1979)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23702-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T03:03:18Z","timestamp":1560567798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23702-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237010","9783642237027"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23702-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}