Travelled to:1 × Brazil
1 × Finland
1 × France
1 × Portugal
1 × USA
Collaborated with:G.K.Narwane S.Ramesh A.Trivedi J.Millo L.Manasa P.K.Pandya K.Loya P.A.Abdulla Jatin Arora 0002 M.F.Atig S.Mohalik
Talks about:time (3) composit (2) product (2) verif (2) line (2) reachabl (1) automata (1) abstract (1) undecid (1) softwar (1)
Person: Shankara Narayanan Krishna
DBLP: Krishna:Shankara_Narayanan
Contributed to:
2015
2015
2013
2012
2007
2019Wrote 6 papers:
- DAC-2015-KrishnaNRT #analysis #composition #modelling #product line
- Compositional modeling and analysis of automotive feature product lines (SNK, GKN, SR, AT), p. 6.
- LATA-2015-KrishnaMT #automaton #bound #decidability #problem #reachability #recursion
- Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable (SNK, LM, AT), pp. 237–248.
- IFM-2013-MilloRKN #composition #product line #verification
- Compositional Verification of Software Product Lines (JVM, SR, SNK, GKN), pp. 109–123.
- SPLC-2012-MohalikRMKN
- Tracing SPLs precisely and efficiently (SM, SR, JVM, SNK, GKN), pp. 186–195.
- TACAS-2007-PandyaKL #abstraction #logic #on the
- On Sampling Abstraction of Continuous Time Logic with Durations (PKP, SNK, KL), pp. 246–260.
- PLDI-2019-AbdullaAAK #semantics #source code #verification
- Verification of programs under the release-acquire semantics (PAA, JA0, MFA, SNK), pp. 1117–1132.