Saurabh Srivastava

TL;DR: The proposed technique synthesizes programs for complicated arithmetic algorithms including Strassen's matrix multiplication and Bresenham's line drawing; several sorting algorithms; and several dynamic programming algorithms using verification tools built in the VS3 project.

TL;DR: This paper shows how the constraint- based approach can be used to model a wide spectrum of program analyses in an expressive domain containing disjunctions and conjunctions of linear inequalities, and presents the first constraint-based approach to weakest precondition and strongest postcondition inference.

TL;DR: Three novel algorithms are presented, having different strengths, that combine template and predicate abstraction based formalisms to discover required sophisticated program invariants using SMT solvers, and can verify program properties that, to the knowledge, have not been automatically verified before.

TL;DR: This work shows how to reduce the template-based search problem to satisfiability solving, which permits the use of off-the-shelf solvers to efficiently explore the search space.

TL;DR: In this paper, the authors explored the role of culture and international business in internationalization outcomes through a systematic review and analysis of articles published between 2009 and 2019, by mapping the current research domain, this review reflects the avenues for future research in theory development, context, characteristics, and methodology in eight research clusters identified as national culture, external uncertainty avoidance, knowledge transfer & collaboration, HRM & management practices, international diversification research, entrepreneurial mindset, interaction, and firm performance.