Saurabh Srivastava

Bio: Saurabh Srivastava is an academic researcher from Indian Institutes of Technology. The author has contributed to research in topics: Program synthesis & Predicate abstraction. The author has an hindex of 15, co-authored 52 publications receiving 1258 citations. Previous affiliations of Saurabh Srivastava include University of California, Berkeley & Microsoft.

A Review of UAV Regulations and Policies in India

Abstract: The emergence of Unmanned Aerial Vehicle (UAV) is driving a paradigm shift in research and development. Initially, UAVs were limited for defense purposes only. Now, these are getting popular and are widely used in different sectors such as infrastructure, mining, and media. With the increase in usage of UAVs, legal and policy complexities of drone laws have also increased. However, the current legal framework that regulates UAVs, needs to be reviewed due to the rapid increase in UAV’s market in India. The introduction of national drone policy from Director General of Civil Aviation (DGCA) which is UAVs regulatory body in India, reduces the ambiguities in the system. However, some bottlenecks still exist. The present policy legalizes the use and operation of drones in India which needs to be analyzed carefully. This paper examines the existing UAVs regulations and issues like safety, security, and privacy associated with the use of drones. The complexities in the existing law and major policy gaps in India are also analyzed. Moreover, a comparative analysis of existing national and international drone laws is presented with emphasis on the registration of aircraft and important guidelines in regard to the qualification and license for pilots.

Seasonal and trend analysis of TWS for the Indo-Gangetic plain using GRACE data

Abstract: The GRACE satellite mission data is used to study Earth's mass variability on the Earth surface. The major component to the surface mass variability is changing terrestrial water storage (TWS). The...

An accurate ab initio potential energy curve and the vibrational bound states of X2Σu+ state of H2-

Abstract: Potential energy curve for the X 2 Σ u + state of H 2 - has been computed at the full CI/cc-pVXZ (X = D − Q) level. An analytic function is fitted to the resulting potential energy curve and is then used to calculate the vibrational bound states of H 2 - and compared with those for H2.

Radiative lifetimes of spin forbidden a1Δ → X3Σ- and spin allowed A3Π → X3Σ- transitions and complete basis set extrapolated ab initio potential energy curves for the ground and excited states of CH-.

Abstract: The spin forbidden transition a1Δ → X3Σ− in CH− has been studied using the Breit-Pauli Hamiltonian for a large number of geometries. This transition acquires intensity through spin-orbit coupling with singlet and triplet Π states. The transition moment matrix including more than one singlet and triplet Π states was calculated at the multi-reference configuration interaction/aug-cc-pV6Z level of theory. The computed radiative lifetime of 5.63 s is in good agreement with the experimental (5.9 s) and other theoretical (6.14 s) results. Transition moment values of the spin allowed A3Π → X3Σ− transition have also been calculated at the same level of theory. Calculations show that the corresponding radiative lifetime is considerably low, 2.4 × 10−7 s. Complete basis set extrapolated potential energy curves for the ground state of CH and the ground state and six low lying excited states (a1Δ, b1Σ+, two 3Π, and two 1Π) of CH− are reported. These curves are then used to calculate the vibrational bound states for C...

Modular Information Hiding and Type-Safe Linking for C

Abstract: This paper presents CMod, a novel tool that provides a sound module system for C. CMod works by enforcing four rules that are based on principles of modular reasoning and on current programming practice. CMod's rules flesh out the convention that .h header files are module interfaces and .c source files are module implementations. Although this convention is well-known, existing explanations of it are incomplete, omitting important subtleties needed for soundness. In contrast, we have proven formally that CMod's rules enforce both information hiding and type-safe linking. To use CMod, the programmer develops and builds their software as usual, redirecting the compiler and linker to CMod's wrappers. We evaluated CMod by applying it to 30 open source programs, totaling more than one million LoC. Violations to CMod's rules revealed more than a thousand information hiding errors, dozens of typing errors, and hundreds of cases that, although not currently bugs, make programming mistakes more likely as the code evolves. At the same time, programs generally adhere to the assumptions underlying CMod's rules, and so we could fix rule violations with a modest effort. We conclude that CMod can effectively support modular programming in C: it soundly enforces type-safe linking and information-hiding while being largely compatible with existing practice.

The C programming language

Abstract: This ebook is the first authorized digital version of Kernighan and Ritchie's 1988 classic, The C Programming Language (2nd Ed.). One of the best-selling programming books published in the last fifty years, "K&R" has been called everything from the "bible" to "a landmark in computer science" and it has influenced generations of programmers. Available now for all leading ebook platforms, this concise and beautifully written text is a "must-have" reference for every serious programmers digital library. As modestly described by the authors in the Preface to the First Edition, this "is not an introductory programming manual; it assumes some familiarity with basic programming concepts like variables, assignment statements, loops, and functions. Nonetheless, a novice programmer should be able to read along and pick up the language, although access to a more knowledgeable colleague will help."

Tools and Algorithms for the Construction and Analysis of Systems. Proc. TACAS 2009

Abstract: ing WS1S Systems to Verify Parameterized Networks . . . . . . . . . . . . 188 Kai Baukus, Saddek Bensalem, Yassine Lakhnech and Karsten Stahl FMona: A Tool for Expressing Validation Techniques over Infinite State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 204 J.-P. Bodeveix and M. Filali Transitive Closures of Regular Relations for Verifying Infinite-State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 220 Bengt Jonsson and Marcus Nilsson Diagnostic and Test Generation Using Static Analysis to Improve Automatic Test Generation . . . . . . . . . . . . . 235 Marius Bozga, Jean-Claude Fernandez and Lucian Ghirvu Efficient Diagnostic Generation for Boolean Equation Systems . . . . . . . . . . . . 251 Radu Mateescu Efficient Model-Checking Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 266 Jean-Pierre Krimm and Laurent Mounier Checking for CFFD-Preorder with Tester Processes . . . . . . . . . . . . . . . . . . . . . . . 283 Juhana Helovuo and Antti Valmari Fair Bisimulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299 Thomas A. Henzinger and Sriram K. Rajamani Integrating Low Level Symmetries into Reachability Analysis . . . . . . . . . . . . . 315 Karsten Schmidt Model-Checking Tools Model Checking Support for the ASM High-Level Language . . . . . . . . . . . . . . 331 Giuseppe Del Castillo and Kirsten Winter Table of

Ground Motion Characteristics Estimated from Spectral Ratio between Horizontal and Verticcl Components of Mietremors.

Abstract: The spectral ratio between horizontal and vertical components (H/V ratio) of microtremors measured at the ground surface has been used to estimate fundamental periods and amplification factors of a site, although this technique lacks theoretical background. The aim of this article is to formulate the H/V technique in terms of the characteristics of Rayleigh and Love waves, and to contribute to improve the technique. The improvement includes use of not only peaks but also troughs in the H/V ratio for reliable estimation of the period and use of a newly proposed smoothing function for better estimation of the amplification factor. The formulation leads to a simple formula for the amplification factor expressed with the H/V ratio. With microtremor data measured at 546 junior high schools in 23 wards of Tokyo, the improved technique is applied to mapping site periods and amplification factors in the area.

Automating string processing in spreadsheets using input-output examples

Abstract: We describe the design of a string programming/expression language that supports restricted forms of regular expressions, conditionals and loops. The language is expressive enough to represent a wide variety of string manipulation tasks that end-users struggle with. We describe an algorithm based on several novel concepts for synthesizing a desired program in this language from input-output examples. The synthesis algorithm is very efficient taking a fraction of a second for various benchmark examples. The synthesis algorithm is interactive and has several desirable features: it can rank multiple solutions and has fast convergence, it can detect noise in the user input, and it supports an active interaction model wherein the user is prompted to provide outputs on inputs that may have multiple computational interpretations.The algorithm has been implemented as an interactive add-in for Microsoft Excel spreadsheet system. The prototype tool has met the golden test - it has synthesized part of itself, and has been used to solve problems beyond author's imagination.