메뉴 건너뛰기




Volumn , Issue , 2014, Pages 112-122

Expressing and verifying probabilistic assertions

Author keywords

Approximate computing; Data obfuscation; Differential privacy; Probabilistic programming; Sensors; Symbolic execution

Indexed keywords

BAYESIAN NETWORKS; C++ (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; EXTRACTION; SENSORS;

EID: 84901624490     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2594291.2594294     Document Type: Conference Paper
Times cited : (55)

References (39)
  • 1
    • 84857867264 scopus 로고    scopus 로고
    • Probabilistic relational reasoning for differential privacy
    • G. Barthe, B. Köpf, F. Olmedo, and S. Zanella Béguelin. Probabilistic relational reasoning for differential privacy. In POPL, 2012.
    • (2012) POPL
    • Barthe, G.1    Köpf, B.2    Olmedo, F.3    Béguelin, S.Z.4
  • 2
    • 84901646153 scopus 로고    scopus 로고
    • Deriving probability density functions from probabilistic functional programs
    • Springer
    • S. Bhat, J. Borgström, A. D. Gordon, and C. Russo. Deriving probability density functions from probabilistic functional programs. In TACAS. Springer, 2013.
    • (2013) TACAS
    • Bhat, S.1    Borgström, J.2    Gordon, A.D.3    Russo, C.4
  • 3
    • 84897803531 scopus 로고    scopus 로고
    • Uncertain: A first-order type for uncertain data
    • J. Bornholt, T. Mytkowicz, and K. S. McKinley. Uncertain: A first-order type for uncertain data. In ASPLOS, 2014.
    • (2014) ASPLOS
    • Bornholt, J.1    Mytkowicz, T.2    McKinley, K.S.3
  • 4
    • 84863438138 scopus 로고    scopus 로고
    • Proving acceptability properties of relaxed nondeterministic approximate programs
    • M. Carbin, D. Kim, S. Misailovic, and M. C. Rinard. Proving acceptability properties of relaxed nondeterministic approximate programs. In PLDI, 2012.
    • (2012) PLDI
    • Carbin, M.1    Kim, D.2    Misailovic, S.3    Rinard, M.C.4
  • 5
    • 84888167548 scopus 로고    scopus 로고
    • Verifying quantitative reliability of programs that execute on unreliable hardware
    • M. Carbin, S. Misailovic, and M. Rinard. Verifying quantitative reliability of programs that execute on unreliable hardware. In OOPSLA, 2013.
    • (2013) OOPSLA
    • Carbin, M.1    Misailovic, S.2    Rinard, M.3
  • 6
    • 84883717354 scopus 로고    scopus 로고
    • Efficiently sampling probabilistic programs via program analysis
    • A. T. Chaganty, A. V. Nori, and S. K. Rajamani. Efficiently sampling probabilistic programs via program analysis. In AISTATS, 2013.
    • (2013) AISTATS
    • Chaganty, A.T.1    Nori, A.V.2    Rajamani, S.K.3
  • 9
    • 0000182415 scopus 로고
    • A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
    • H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. The Annals of Mathematical Statistics, 23(4):493-507, 1952.
    • (1952) The Annals of Mathematical Statistics , vol.23 , Issue.4 , pp. 493-507
    • Chernoff, H.1
  • 10
    • 85037030721 scopus 로고
    • Design and synthesis of synchronization skeletons using branching-time temporal logic
    • E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Workshop on Logic of Programs, pages 52-71, 1982.
    • (1982) Workshop on Logic of Programs , pp. 52-71
    • Clarke, E.M.1    Emerson, E.A.2
  • 11
    • 84876591853 scopus 로고    scopus 로고
    • Neural acceleration for general-purpose approximate programs
    • H. Esmaeilzadeh, A. Sampson, L. Ceze, and D. Burger. Neural acceleration for general-purpose approximate programs. In MICRO, 2012.
    • (2012) MICRO
    • Esmaeilzadeh, H.1    Sampson, A.2    Ceze, L.3    Burger, D.4
  • 12
    • 84858790858 scopus 로고    scopus 로고
    • Architecture support for disciplined approximate programming
    • H. Esmaeilzadeh, A. Sampson, L. Ceze, and D. Burger. Architecture support for disciplined approximate programming. In ASPLOS, 2012.
    • (2012) ASPLOS
    • Esmaeilzadeh, H.1    Sampson, A.2    Ceze, L.3    Burger, D.4
  • 15
    • 84880893426 scopus 로고    scopus 로고
    • Effective Bayesian inference for stochastic programs
    • D. Koller, D. McAllester, and A. Pfeffer. Effective Bayesian inference for stochastic programs. In AAAI, 1997.
    • (1997) AAAI
    • Koller, D.1    McAllester, D.2    Pfeffer, A.3
  • 17
    • 79960351824 scopus 로고    scopus 로고
    • PRISM 4.0: Verification of probabilistic real-time systems
    • M. Kwiatkowska, G. Norman, and D. Parker. PRISM 4.0: Verification of probabilistic real-time systems. CAV, pages 585-591, 2011.
    • (2011) CAV , pp. 585-591
    • Kwiatkowska, M.1    Norman, G.2    Parker, D.3
  • 18
    • 3042658703 scopus 로고    scopus 로고
    • LLVM: A compilation framework for lifelong program analysis and transformation
    • C. Lattner and V. Adve. LLVM: A compilation framework for lifelong program analysis and transformation. In CGO, 2004.
    • (2004) CGO
    • Lattner, C.1    Adve, V.2
  • 20
    • 84901646156 scopus 로고    scopus 로고
    • LLVM Project. LLVM interpreter, 2013. http://llvm.org/docs/doxygen/html/ classllvm-1-1Interpreter.html.
    • (2013) LLVM Interpreter
  • 21
    • 70849116921 scopus 로고    scopus 로고
    • Privacy integrated queries: An extensible platform for privacy-preserving data analysis
    • F. D. McSherry. Privacy integrated queries: An extensible platform for privacy-preserving data analysis. In SIGMOD, 2009.
    • (2009) SIGMOD
    • McSherry, F.D.1
  • 23
    • 80053180249 scopus 로고    scopus 로고
    • Probabilistically accurate program transformations
    • S. Misailovic, D. M. Roy, and M. C. Rinard. Probabilistically accurate program transformations. In SAS, 2011.
    • (2011) SAS
    • Misailovic, S.1    Roy, D.M.2    Rinard, M.C.3
  • 26
    • 29144536833 scopus 로고    scopus 로고
    • A probabilistic language based upon sampling functions
    • S. Park, F. Pfenning, and S. Thrun. A probabilistic language based upon sampling functions. In POPL, 2005.
    • (2005) POPL
    • Park, S.1    Pfenning, F.2    Thrun, S.3
  • 27
    • 36348943558 scopus 로고    scopus 로고
    • A general importance sampling algorithm for probabilistic programs
    • A. Pfeffer. A general importance sampling algorithm for probabilistic programs. Technical Report TR-12-07, Harvard University, 2007. ftp://ftp.deas.harvard.edu/techreports/tr-12-07.pdf.
    • (2007) Technical Report TR-12-07, Harvard University
    • Pfeffer, A.1
  • 28
    • 0036039863 scopus 로고    scopus 로고
    • Stochastic lambda calculus and monads of probability distributions
    • N. Ramsey and A. Pfeffer. Stochastic lambda calculus and monads of probability distributions. In POPL, 2002.
    • (2002) POPL
    • Ramsey, N.1    Pfeffer, A.2
  • 29
    • 78249264133 scopus 로고    scopus 로고
    • Distance makes the types grow stronger: A calculus for differential privacy
    • J. Reed and B. C. Pierce. Distance makes the types grow stronger: A calculus for differential privacy. In ICFP, 2010.
    • (2010) ICFP
    • Reed, J.1    Pierce, B.C.2
  • 33
    • 84883071637 scopus 로고    scopus 로고
    • Static analysis for probabilistic programs: Inferring whole program properties from finitely many paths
    • S. Sankaranarayanan, A. Chakarov, and S. Gulwani. Static analysis for probabilistic programs: Inferring whole program properties from finitely many paths. In PLDI, 2013.
    • (2013) PLDI
    • Sankaranarayanan, S.1    Chakarov, A.2    Gulwani, S.3
  • 35
    • 0000090155 scopus 로고
    • Sequential tests of statistical hypotheses
    • A. Wald. Sequential tests of statistical hypotheses. The Annals of Mathematical Statistics, 16(2):117-186, 1945.
    • (1945) The Annals of Mathematical Statistics , vol.16 , Issue.2 , pp. 117-186
    • Wald, A.1
  • 36
    • 84874120134 scopus 로고    scopus 로고
    • Lightweight implementations of probabilistic programming languages via transformational compilation
    • D. Wingate, A. Stuhlmüller, and N. D. Goodman. Lightweight implementations of probabilistic programming languages via transformational compilation. In Artificial Intelligence and Statistics, 2011.
    • (2011) Artificial Intelligence and Statistics
    • Wingate, D.1    Stuhlmüller, A.2    Goodman, N.D.3
  • 38
    • 84855207965 scopus 로고    scopus 로고
    • Statistical probabilistic model checking with a focus on time-bounded properties
    • H. L. Younes and R. G. Simmons. Statistical probabilistic model checking with a focus on time-bounded properties. Information and Computation, 204(9):1368 - 1409, 2006.
    • (2006) Information and Computation , vol.204 , Issue.9 , pp. 1368-1409
    • Younes, H.L.1    Simmons, R.G.2
  • 39
    • 84857880446 scopus 로고    scopus 로고
    • Randomized accuracy-aware program transformations for efficient approximate computations
    • Z. A. Zhu, S. Misailovic, J. A. Kelner, and M. Rinard. Randomized accuracy-aware program transformations for efficient approximate computations. In POPL, 2012.
    • (2012) POPL
    • Zhu, Z.A.1    Misailovic, S.2    Kelner, J.A.3    Rinard, M.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.