Travelled to:1 × China
1 × Croatia
1 × Hungary
1 × South Africa
1 × United Kingdom
2 × Italy
7 × USA
Collaborated with:M.C.Rinard M.Carbin H.Hoffmann S.Sidiroglou D.Marinov Vimuth Fernando D.Kim M.Kling Z.Huang T.Gehr M.T.Vechev A.Milicevic S.Khurshid Keyur Joshi D.M.Roy Z.A.Zhu J.A.Kelner S.Sidiroglou-Douskos S.D.0001 O.Legunsen S.Dutta W.Zhang Shengwei An R.Singh R.Samanta S.V.Adve S.Achour Z.Qi N.Petrovic Antonio Franques S.Abadal J.Torrellas A.Agarwal P.Tsankov L.Vanbever Pascal Wiesmann Abdulrahman Mahmoud Radha Venkatagiri Khalique Ahmed C.W.Fletcher H.Sharif Prakalp Srivastava Muhammad Huzaifa Maria Kotsifakou Yasmin Sarita Nathan Zhao V.S.Adve
Talks about:program (10) approxim (6) probabilist (5) accuraci (5) test (5) comput (4) awar (4) transform (3) properti (3) verifi (3)
Person: Sasa Misailovic
DBLP: Misailovic:Sasa
Contributed to:
20142013
20132012
2012
2012
2011
2011
2011
2011
201020102007200720182019
20162019201820202019Wrote 23 papers:
- OOPSLA-2014-MisailovicCAQR #approximate #kernel #named #optimisation
- Chisel: reliability- and accuracy-aware optimization of approximate computational kernels (SM, MC, SA, ZQ, MCR), pp. 309–328.
- OOPSLA-2013-CarbinMR #hardware #reliability #source code #verification
- Verifying quantitative reliability for programs that execute on unreliable hardware (MC, SM, MCR), pp. 33–52.
- PEPM-2013-CarbinKMR #approximate #program transformation
- Verified integrity properties for safe approximate program transformations (MC, DK, SM, MCR), pp. 63–66.
- OOPSLA-2012-KlingMCR #infinity #named #on-demand
- Bolt: on-demand infinite loop escape in unmodified binaries (MK, SM, MC, MCR), pp. 431–450.
- PLDI-2012-CarbinKMR #approximate #nondeterminism #proving #source code
- Proving acceptability properties of relaxed nondeterministic approximate programs (MC, DK, SM, MCR), pp. 169–180.
- POPL-2012-ZhuMKR #approximate #performance #program transformation #random
- Randomized accuracy-aware program transformations for efficient approximate computations (ZAZ, SM, JAK, MCR), pp. 441–454.
- ASPLOS-2011-HoffmannSCMAR #power management
- Dynamic knobs for responsive power-aware computing (HH, SS, MC, SM, AA, MCR), pp. 199–212.
- ECOOP-2011-CarbinMKR #detection #infinity
- Detecting and Escaping Infinite Loops with Jolt (MC, SM, MK, MCR), pp. 609–633.
- ESEC-FSE-2011-Sidiroglou-DouskosMHR #performance #trade-off
- Managing performance vs. accuracy trade-offs with loop perforation (SSD, SM, HH, MCR), pp. 124–134.
- SAS-2011-MisailovicRR #program transformation
- Probabilistically Accurate Program Transformations (SM, DMR, MCR), pp. 316–333.
- ICSE-2010-MisailovicSHR #profiling #quality
- Quality of service profiling (SM, SS, HH, MCR), pp. 25–34.
- OOPSLA-2010-RinardHMS #analysis #comprehension #statistics
- Patterns and statistical analysis for understanding reduced resource computing (MCR, HH, SM, SS), pp. 806–821.
- ESEC-FSE-2007-MisailovicMPKM #execution #generative #parallel #testing
- Parallel test generation and execution with Korat (SM, AM, NP, SK, DM), pp. 135–144.
- ICSE-2007-MilicevicMMK #generative #named #testing
- Korat: A Tool for Generating Structurally Complex Test Inputs (AM, SM, DM, SK), pp. 771–774.
- ESEC-FSE-2018-DuttaLHM #probability #programming #testing
- Testing probabilistic programming systems (SD0, OL, ZH, SM), pp. 574–586.
- ESEC-FSE-2019-DuttaZHM #debugging #named #probability #programming #reduction #testing
- Storm: program reduction for testing and debugging probabilistic programming systems (SD, WZ, ZH, SM), pp. 729–739.
- CAV-2016-GehrMV #named #probability #source code
- PSI: Exact Symbolic Inference for Probabilistic Programs (TG, SM, MTV), pp. 62–83.
- OOPSLA-2019-FernandoJM #approximate #canonical #parallel #safety #source code #verification
- Verifying safety and accuracy of approximate parallel programs via canonical sequentialization (VF, KJ, SM), p. 29.
- OOPSLA-2019-SharifSHKJSZAMA #compilation #information retrieval #named #optimisation
- ApproxHPVM: a portable compiler IR for accuracy-aware optimizations (HS, PS, MH, MK, KJ, YS, NZ, VSA, SM, SVA), p. 30.
- PLDI-2018-GehrMTVWV #named #network #probability
- Bayonet: probabilistic inference for networks (TG, SM, PT, LV, PW, MTV), pp. 586–602.
- POPL-2020-AnSMS #relational #synthesis #using
- Augmented example-based synthesis using relational perturbation properties (SA, RS, SM, RS), p. 24.
- ASPLOS-2019-FernandoFAMT #approximate #manycore #named
- Replica: A Wireless Manycore for Communication-Intensive and Approximate Data (VF, AF, SA, SM, JT), pp. 849–863.
- ASPLOS-2019-MahmoudVAMMFA #adaptation #fault #hardware #named #testing
- Minotaur: Adapting Software Testing Techniques for Hardware Errors (AM, RV, KA, SM, DM, CWF, SVA), pp. 1087–1103.