Pranav Garg

According to our database1, Pranav Garg authored at least 19 papers between 2011 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
A Learning-Based Approach to Synthesizing Invariants for Incomplete Verification Engines.
J. Autom. Reason., 2020

2019
Sorcar: Property-Driven Algorithms for Learning Conjunctive Invariants.
Proceedings of the Static Analysis - 26th International Symposium, 2019

CADENCE: Conditional Anomaly Detection for Events Using Noise-Contrastive Estimation.
Proceedings of the 12th ACM Workshop on Artificial Intelligence and Security, 2019

2018
Horn-ICE learning for synthesizing invariants and contracts.
Proc. ACM Program. Lang., 2018

Invariant Synthesis for Incomplete Verification Engines.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2018

2017
Inferring Formal Properties of Production Key-Value Stores.
CoRR, 2017

Efficient Incrementalized Runtime Checking of Linear Measures on Lists.
Proceedings of the 2017 IEEE International Conference on Software Testing, 2017

2016
Learning invariants using decision trees and implication counterexamples.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

2015

Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists.
Formal Methods Syst. Des., 2015

Alchemist: Learning Guarded Affine Functions.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014
Natural proofs for asynchronous programs using almost-synchronous reductions.
Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications, 2014

ICE: A Robust Framework for Learning Invariants.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2013
Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists.
Proceedings of the Static Analysis - 20th International Symposium, 2013

Natural proofs for structure, data, and separation.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2013

Feedback-directed unit test generation for C/C++ using concolic execution.
Proceedings of the 35th International Conference on Software Engineering, 2013

Learning Universally Quantified Invariants of Linear Data Structures.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2011
Compositionality Entails Sequentializability.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2011

Rebound: scalable checkpointing for coherent shared memory.
Proceedings of the 38th International Symposium on Computer Architecture (ISCA 2011), 2011


  Loading...