Travelled to:
1 × Austria
1 × Croatia
1 × Denmark
1 × Hungary
1 × Korea
1 × New Zealand
1 × Russia
1 × United Kingdom
13 × USA
2 × Estonia
2 × Spain
3 × Italy
4 × France
5 × Germany
Collaborated with:
F.Ivancic A.Gupta B.E.Chang A.Chakarov Z.Manna M.Colón A.Cox H.B.Sipma A.Tiwari H.Sipma S.Chaudhuri V.Kahlon ∅ H.Bennett G.Balakrishnan B.Jeannet P.Schrammel X.Chen E.Ábrahám M.Y.Vardi S.Gulwani A.Zutshi R.Frohardt J.V.Deshmukh E.A.Emerson T.Dang P.Givens T.Yeh N.Maeda A.Sánchez C.Sánchez S.Blackshear M.Sridharan Y.Annpureddy C.Liu G.E.Fainekos W.R.Harris Y.Yang R.M.Chang G.Jiang I.Shlyakhter O.Wei A.Kanade R.Alur S.Ramesh K.C.Shashidhar J.Yang N.Sinha N.Sharma H.Tokuoka T.Imoto Y.Miyazaki
Talks about:
analysi (14) program (12) use (9) system (7) linear (7) generat (6) invari (5) relat (5) model (5) abstract (4)
Person: Sriram Sankaranarayanan
DBLP: Sankaranarayanan:Sriram
Contributed to:
Wrote 38 papers:
- CAV-2014-CoxCS #abstraction #library #named #parametricity #reuse #set
- QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers (AC, BYEC, SS), pp. 866–873.
- POPL-2014-JeannetSS #linear
- Abstract acceleration of general linear loops (BJ, PS, SS), pp. 529–540.
- SAS-2014-ChakarovS #fixpoint #invariant #probability
- Expectation Invariants for Probabilistic Program Loops as Fixed Points (AC, SS), pp. 85–100.
- CAV-2013-ChakarovS #probability #program analysis
- Probabilistic Program Analysis with Martingales (AC, SS), pp. 511–526.
- CAV-2013-ChenAS #hybrid
- Flow*: An Analyzer for Non-linear Hybrid Systems (XC, EÁ, SS), pp. 258–263.
- ECOOP-2013-CoxCS #generative #graph #invariant #relational
- QUIC Graphs: Relational Invariant Generation for Containers (AC, BYEC, SS), pp. 401–425.
- ICSE-2013-GivensCSY #grammar inference #user interface
- Exploring the internal state of user interfaces by combining computer vision techniques with grammatical inference (PG, AC, SS, TY), pp. 1165–1168.
- LICS-2013-ChaudhuriSV #analysis
- Regular Real Analysis (SC, SS, MYV), pp. 509–518.
- PLDI-2013-SankaranarayananCG #probability #source code #static analysis
- Static analysis for probabilistic programs: inferring whole program properties from finitely many paths (SS, AC, SG), pp. 447–458.
- SAS-2013-Sankaranarayanan #static analysis
- Static Analysis in the Continuously Changing World (SS), pp. 4–5.
- CAV-2012-ZutshiST #abstraction #relational
- Timed Relational Abstractions for Sampled Data Control Systems (AZ, SS, AT), pp. 343–361.
- CC-2012-YangBMIGSSS #c++ #inheritance #program analysis
- Object Model Construction for Inheritance in C++ and Its Applications to Program Analysis (JY, GB, NM, FI, AG, NS, SS, NS), pp. 144–164.
- SAS-2012-SanchezSSC #generative #invariant #self #using
- Invariant Generation for Parametrized Systems Using Self-reflection — (Extended Version) (AS, SS, CS, BYEC), pp. 146–163.
- TACAS-2012-CoxSC #bound #precise #verification
- A Bit Too Precise? Bounded Verification of Quantized Digital Filters (AC, SS, BYEC), pp. 33–47.
- ASE-2011-IvancicBGSMTIM #bound #framework #named #scalability #verification
- DC2: A framework for scalable, scope-bounded software verification (FI, GB, AG, SS, NM, HT, TI, YM), pp. 133–142.
- CAV-2011-SankaranarayananT #abstraction #hybrid #relational
- Relational Abstractions for Continuous and Hybrid Systems (SS, AT), pp. 686–702.
- ESOP-2011-ColonS
- Generalizing the Template Polyhedral Domain (MC, SS), pp. 176–195.
- SAS-2011-BlackshearCSS #analysis #precise
- The Flow-Insensitive Precision of Andersen’s Analysis in Practice (SB, BYEC, SS, MS), pp. 60–76.
- SAT-2011-BennettS #principle #using
- Model Counting Using the Inclusion-Exclusion Principle (HB, SS), pp. 362–363.
- TACAS-2011-AnnpureddyLFS #hybrid #logic #named
- S-TaLiRo: A Tool for Temporal Logic Falsification for Hybrid Systems (YA, CL, GEF, SS), pp. 254–257.
- VMCAI-2011-FrohardtCS #modelling #physics
- Access Nets: Modeling Access to Physical Spaces (RF, BYEC, SS), pp. 184–198.
- POPL-2010-HarrisSIG #program analysis #satisfiability #source code
- Program analysis via satisfiability modulo path programs (WRH, SS, FI, AG), pp. 71–82.
- ASE-2009-DeshmukhES #analysis #concurrent #library
- Symbolic Deadlock Analysis in Concurrent Libraries and Their Clients (JVD, EAE, SS), pp. 480–491.
- CAV-2009-KanadeAIRSS #generative #modelling
- Generating and Analyzing Symbolic Traces of Simulink/Stateflow Models (AK, RA, FI, SR, SS, KCS), pp. 430–445.
- TACAS-2009-KahlonSG #concurrent #reduction #semantics #source code #thread
- Semantic Reduction of Thread Interleavings in Concurrent Programs (VK, SS, AG), pp. 124–138.
- ICSE-2008-SankaranarayananIG #induction #library #logic programming #mining #specification #using
- Mining library specifications using inductive logic programming (SS, FI, AG), pp. 131–140.
- ISSTA-2008-SankaranarayananCIG #learning
- Dynamic inference of likely data preconditions over predicates by tree learning (SS, SC, FI, AG), pp. 295–306.
- SAS-2008-BalakrishnanSIWG #analysis #detection #named #refinement
- SLR: Path-Sensitive Analysis through Infeasible-Path Detection and Syntactic Language Refinement (GB, SS, FI, OW, AG), pp. 238–254.
- TACAS-2008-SankaranarayananDI #hybrid #model checking #using
- Symbolic Model Checking of Hybrid Systems Using Template Polyhedra (SS, TD, FI), pp. 188–202.
- CAV-2007-KahlonYSG #concurrent #detection #performance #source code
- Fast and Accurate Static Data-Race Detection for Concurrent Programs (VK, YY, SS, AG), pp. 226–239.
- ESEC-FSE-2007-SankaranarayananCJI #constraints #feedback #generative #monte carlo #using
- State space exploration using feedback constraint generation and Monte-Carlo sampling (SS, RMC, GJ, FI), pp. 321–330.
- SAS-2007-SankaranarayananIG #program analysis #using
- Program Analysis Using Symbolic Ranges (SS, FI, AG), pp. 366–383.
- SAS-2006-SankaranarayananISG #static analysis
- Static Analysis in Disjunctive Numerical Domains (SS, FI, IS, AG), pp. 3–17.
- VMCAI-2006-SankaranarayananCSM #analysis #performance #relational
- Efficient Strongly Relational Polyhedral Analysis (SS, MC, HBS, ZM), pp. 111–125.
- VMCAI-2005-SankaranarayananSM #analysis #linear #programming #scalability #using
- Scalable Analysis of Linear Systems Using Mathematical Programming (SS, HBS, ZM), pp. 25–41.
- POPL-2004-SankaranarayananSM #generative #invariant #using
- Non-linear loop invariant generation using Gröbner bases (SS, HS, ZM), pp. 318–329.
- SAS-2004-SankaranarayananSM #analysis #constraints
- Constraint-Based Linear-Relations Analysis (SS, HBS, ZM), pp. 53–68.
- CAV-2003-ColonSS #constraints #generative #invariant #linear #theorem proving #using
- Linear Invariant Generation Using Non-linear Constraint Solving (MC, SS, HS), pp. 420–432.