Travelled to:1 × Belgium
1 × Estonia
1 × Ireland
1 × Russia
1 × Spain
1 × The Netherlands
2 × Cyprus
2 × Italy
3 × United Kingdom
7 × USA
Collaborated with:D.A.Naumann A.Nanevski T.Amtoft I.Sergey S.Rosenberg N.Heintze J.G.Riecke A.Malkis ∅ D.A.Schmidt S.Itzhaky N.Immerman M.Sagiv G.Stewart M.Marron O.Lhoták S.Bandhakavi Q.Sun V.B.Livshits A.V.Nori S.K.Rajamani M.Abadi V.P.Ranganath M.B.Dwyer J.Hatcliff O.Lahav
Talks about:inform (6) flow (5) program (4) analysi (4) logic (4) structur (3) calculus (3) modular (3) region (3) reason (3)
Person: Anindya Banerjee
DBLP: Banerjee:Anindya
Contributed to:
2015
2015
2014
2013
2013
2012
2012
201220102009
2008200620052005
20042002
19991999
19971994Wrote 21 papers:
- ESOP-2015-SergeyNB #algorithm #concurrent #specification #verification
- Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity (IS, AN, AB), pp. 333–358.
- PLDI-2015-SergeyNB #concurrent #fine-grained #source code #verification
- Mechanized verification of fine-grained concurrent programs (IS, AN, AB), pp. 77–87.
- POPL-2014-ItzhakyBILNS #composition #effectiveness #reasoning
- Modular reasoning about heap paths via effectively propositional formulas (SI, AB, NI, OL, AN, MS), pp. 385–396.
- CAV-2013-ItzhakyBINS #data type #effectiveness #linked data #open data #reachability #reasoning
- Effectively-Propositional Reasoning about Reachability in Linked Data Structures (SI, AB, NI, AN, MS), pp. 756–772.
- PPDP-2013-StewartBN #data flow #data type #dependent type #policy #semistructured data
- Dependent types for enforcement of information flow and erasure policies in heterogeneous data structures (GS, AB, AN), pp. 145–156.
- CC-2012-MarronLB #analysis #paradigm #programming
- Programming Paradigm Driven Heap Analysis (MM, OL, AB), pp. 41–60.
- PPoPP-2012-MalkisB #verification
- Verification of software barriers (AM, AB), pp. 313–314.
- VMCAI-2012-RosenbergBN #logic
- Decision Procedures for Region Logic (SR, AB, DAN), pp. 379–395.
- ESOP-2010-NaumannB #bound #first-order #higher-order #information management
- Dynamic Boundaries: Information Hiding by Second Order Framing with First Order Assertions (DAN, AB), pp. 2–22.
- PLDI-2009-LivshitsNRB #data flow #named #problem #specification
- Merlin: specification inference for explicit information flow problems (VBL, AVN, SKR, AB), pp. 75–86.
- ECOOP-2008-BanerjeeNR #invariant #logic #reasoning
- Regional Logic for Local Reasoning about Global Invariants (AB, DAN, SR), pp. 387–411.
- POPL-2006-AmtoftBB #data flow #logic #object-oriented #source code
- A logic for information flow in object-oriented programs (TA, SB, AB), pp. 91–102.
- ECOOP-2005-BanerjeeN #encapsulation
- State Based Ownership, Reentrance, and Encapsulation (AB, DAN), pp. 387–411.
- ESOP-2005-RanganathABDH #slicing
- A New Foundation for Control-Dependence and Slicing for Modern Program Structures (VPR, TA, AB, MBD, JH), pp. 77–93.
- SAS-2004-AmtoftB #analysis #data flow #logic
- Information Flow Analysis in Logical Form (TA, AB), pp. 100–115.
- SAS-2004-SunBN #composition #constraints #data flow #object-oriented
- Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language (QS, AB, DAN), pp. 84–99.
- POPL-2002-BanerjeeN #data access #independence #representation
- Representation independence, confinement and access control [extended abstract] (AB, DAN), pp. 166–177.
- LICS-1999-BanerjeeHR #analysis #polymorphism #λ-calculus
- Region Analysis and the Polymorphic λ Calculus (AB, NH, JGR), pp. 88–97.
- POPL-1999-AbadiBHR #calculus #dependence
- A Core Calculus of Dependency (MA, AB, NH, JGR), pp. 147–160.
- ICFP-1997-Banerjee #analysis #composition #type system
- A Modular, Polyvariant, and Type-Based Closure Analysis (AB), pp. 1–10.
- SAS-1994-BanerjeeS #call-by #λ-calculus
- Stackability in the Simply-Typed Call-by-Value λ Calculus (AB, DAS), pp. 131–146.