Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ganesh Khandu Narwane

dblp:70/10827 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Requirements engineering and software design · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Requirements engineering and software design
software product lines
0.212015
Compositional modeling and analysis of automotive feature product lines · DAC 2015
Requirements engineering and software design › software product lines
variability modeling
0.212015
Compositional modeling and analysis of automotive feature product lines · DAC 2015
Embedded and real-time systems › cyber-physical system platforms
hybrid systems
0.112015
Compositional modeling and analysis of automotive feature product lines · DAC 2015
Embedded and real-time systems
timing constraints
0.112015
Compositional modeling and analysis of automotive feature product lines · DAC 2015

Methods — techniques the papers use, named apart from their topics

formal modeling · 0.4compositional verification · 0.4
YearPublicationVenuePosition
2015 Compositional modeling and analysis of automotive feature product lines
abstract
Modern automotive systems are composed of hundreds of software-implemented features often interacting with physical subsystems under real-time constraints. For efficient management of their development, the features are conceived and realized as product lines involving variability with different variants being deployed in different vehicle classes. The variability information is expressed at different levels of abstraction during the various phases of development, like requirements, design and implementation. We introduce and study a formal model of such feature product lines capable of capturing variability and real-time behavior. We define a notion of conformance to relate the variability at different levels of abstraction and propose a compositional method of verifying conformance of multiple features. The proposed approach naturally extends to hybrid system behaviors consisting of discrete and continuous plant variables. We demonstrate the applicability of the approach by giving a simple paradigmatic example.
S. Krishna 0004, Ganesh Khandu Narwane, S. Ramesh 0002, Ashutosh Trivedi 0001
DAC2
2013 Compositional Verification of Software Product Lines
Jean-Vivien Millo, S. Ramesh 0002, S. Krishna 0004, Ganesh Khandu Narwane
IFM4
2012 Tracing SPLs precisely and efficiently
abstract
In a Software Product Line (SPL), the central notion of implementability provides the requisite connection between specifications (feature sets) and their implementations (component sets), leading to the definition of products. While it appears to be a simple extension (to sets) of the trace-ability relation between components and features, it actually involves several subtle issues which are overlooked in the definitions in existing literature. In this paper, we give a precise and formal definition of implementability over a fairly expressive traceability relation to solve these issues. The consequent definition of products in the given SPL naturally entails a set of useful analysis problems that are either refinements of known problems, or are completely novel. We also propose a new approach to solve these analysis problems by encoding them as Quantified Boolean Formula(QBF) and solving them through Quantified Satisfiability (QSAT) solvers. The methodology scales much better than the SAT-based solutions hinted in the literature and is demonstrated through a prototype tool called SPLANE (SPL Analysis Engine), on a couple of fairly large case studies.
Swarup Mohalik, S. Ramesh 0002, Jean-Vivien Millo, S. Krishna 0004, Ganesh Khandu Narwane
SPLC (1)5