Travelled to:1 × Denmark
1 × Estonia
1 × Ireland
1 × Japan
1 × Portugal
1 × South Africa
1 × Spain
1 × United Kingdom
12 × USA
2 × Austria
2 × Canada
2 × France
2 × Italy
2 × Serbia
4 × Germany
Collaborated with:S.Gulwani ∅ G.Godoy L.Bachmair A.Gascón S.Sankaranarayanan H.Rueß M.Schmidt-Schauß P.Lincoln J.Leike S.Jha N.Shankar B.Dutertre A.Zutshi V.A.Korthikanti A.Taly B.McCloskey E.Huntingford R.Venkatesan S.A.Seshia C.Creus F.Massanes H.Saïdi C.R.Ramakrishnan I.V.Ramakrishnan L.M.d.Moura S.Owre J.M.Rushby M.Sorea
Talks about:rewrit (10) abstract (9) system (8) program (7) polynomi (5) linear (5) right (5) time (5) interpret (4) synthesi (4)
Person: Ashish Tiwari
DBLP: Tiwari:Ashish
Facilitated 1 volumes:
EdContributed to:
2015
2015
2015
20152014
2014201220112011
20112011
2011
20102009
200920092008
200820072007
20072007200720062006200520052004
20042002
2001200019991997Wrote 39 papers:
- CADE-2015-TiwariGD #synthesis #using
- Program Synthesis Using Dual Interpretation (AT, AG, BD), pp. 482–497.
- CAV-2015-Tiwari #abstraction
- Time-Aware Abstractions in HybridSal (AT), pp. 504–510.
- CSL-2015-GasconST #polynomial #strict #unification
- Two-Restricted One Context Unification is in Polynomial Time (AG, MSS, AT), pp. 405–422.
- LICS-2015-GasconTS #polynomial #problem #unification
- One Context Unification Problems Solvable in Polynomial Time (AG, AT, MSS), pp. 499–510.
- CAV-2014-TiwariL
- A Nonlinear Real Arithmetic Fragment (AT, PL), pp. 729–736.
- VMCAI-2014-LeikeT #polynomial #source code #synthesis
- Synthesis for Polynomial Lasso Programs (JL, AT), pp. 434–452.
- CAV-2012-Tiwari #relational
- HybridSAL Relational Abstracter (AT), pp. 725–731.
- CAV-2012-ZutshiST #abstraction #relational
- Timed Relational Abstractions for Sampled Data Control Systems (AZ, SS, AT), pp. 343–361.
- CAV-2011-SankaranarayananT #abstraction #hybrid #relational
- Relational Abstractions for Continuous and Hybrid Systems (SS, AT), pp. 686–702.
- LICS-2011-Tiwari #biology #logic
- Logic in Software, Dynamical and Biological Systems (AT), pp. 9–10.
- PLDI-2011-GulwaniJTV #source code #synthesis
- Synthesis of loop-free programs (SG, SJ, AT, RV), pp. 62–73.
- PLDI-2011-GulwaniKT #geometry
- Synthesizing geometry constructions (SG, VAK, AT), pp. 50–61.
- RTA-2011-Tiwari
- Rewriting in Practice (AT), pp. 3–8.
- TLCA-2011-Tiwari
- Rewriting in Practice (AT), pp. 6–8.
- ICSE-2010-JhaGST #component #synthesis
- Oracle-guided component-based program synthesis (SJ, SG, SAS, AT), pp. 215–224.
- LICS-2009-CreusGMT #normalisation #term rewriting
- Non-linear Rewrite Closure and Weak Normalization (CC, GG, FM, AT), pp. 365–374.
- SAS-2009-GodoyT #invariant #source code
- Invariant Checking for Programs with Procedure Calls (GG, AT), pp. 326–342.
- VMCAI-2009-TalyGT #constraints #logic #theorem proving #using
- Synthesizing Switching Logic Using Constraint Solving (AT, SG, AT), pp. 305–319.
- CAV-2008-GulwaniT #analysis #approach #constraints #hybrid
- Constraint-Based Approach for Analysis of Hybrid Systems (SG, AT), pp. 190–203.
- POPL-2008-GulwaniMT #logic #quantifier
- Lifting abstract interpreters to quantified logical domains (SG, BM, AT), pp. 235–246.
- CADE-2007-TiwariG #logic #program analysis #proving #theorem proving #using
- Logical Interpretation: Static Program Analysis Using Theorem Proving (AT, SG), pp. 147–166.
- CAV-2007-GulwaniT #abstract domain #bytecode #low level
- An Abstract Domain for Analyzing Heap-Manipulating Low-Level Software (SG, AT), pp. 379–392.
- ESOP-2007-GulwaniT #analysis #interprocedural #summary
- Computing Procedure Summaries for Interprocedural Analysis (SG, AT), pp. 253–267.
- RTA-2007-GodoyHT #termination
- Termination of Rewriting with Right-Flat Rules (GG, EH, AT), pp. 200–213.
- VMCAI-2007-GulwaniT
- Assertion Checking Unified (SG, AT), pp. 363–377.
- ESOP-2006-GulwaniT #abstraction #linear
- Assertion Checking over Combined Abstraction of Linear Arithmetic and Uninterpreted Functions (SG, AT), pp. 279–293.
- PLDI-2006-GulwaniT
- Combining abstract interpreters (SG, AT), pp. 376–386.
- CADE-2005-GodoyT #linear #term rewriting #termination
- Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules (GG, AT), pp. 164–176.
- CSL-2005-GodoyT #confluence #linear #term rewriting
- Confluence of Shallow Right-Linear Rewrite Systems (GG, AT), pp. 541–556.
- CSL-2005-Tiwari #algebra #approach #constraints #satisfiability
- An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints (AT), pp. 248–262.
- CAV-2004-MouraORRSST
- SAL 2 (LMdM, SO, HR, JMR, NS, MS, AT), pp. 496–500.
- CAV-2004-Tiwari #linear #source code #termination
- Termination of Linear Programs (AT), pp. 70–82.
- IJCAR-2004-GodoyT #term rewriting
- Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure (GG, AT), pp. 91–106.
- LICS-2002-Tiwari #confluence #polynomial #term rewriting
- Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time (AT), p. 447–?.
- TACAS-2001-TiwariRSS #generative #invariant
- A Technique for Invariant Generation (AT, HR, HS, NS), pp. 113–127.
- CADE-2000-BachmairT #congruence
- Abstract Congruence Closure and Specializations (LB, AT), pp. 64–78.
- CADE-2000-TiwariBR #revisited
- Rigid E-Unification Revisited (AT, LB, HR), pp. 220–234.
- RTA-1999-BachmairRRT #normalisation #term rewriting
- Normalization via Rewrite Closures (LB, CRR, IVR, AT), pp. 190–204.
- RTA-1997-BachmairT #commutative #polynomial
- D-Bases for Polynomial Ideals over Commutative Noetherian Rings (LB, AT), pp. 113–127.