default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKedar S. Namjoshi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c59]Kedar S. Namjoshi
, Sougol Gheissi, Krishan K. Sabnani:
Algorithms for In-Place, Consistent Network Update. SIGCOMM 2024: 244-257- [i5]Huaixi Lu, Akshay Jajoo, Kedar S. Namjoshi:
Atomicity and Abstraction for Cross-Blockchain Interactions. CoRR abs/2403.07248 (2024) - 2022
- [c58]Ruoxi Zhang, Richard J. Trefler, Kedar S. Namjoshi:
Synthesizing Locally Symmetric Parameterized Protocols from Temporal Specifications. FMCAD 2022: 235-244 - [c57]Kedar S. Namjoshi, Nisarg Patel:
Synthesis of Compact Strategies for Coordination Programs. TACAS (1) 2022: 46-63 - 2021
- [c56]Martin Carroll, Kedar S. Namjoshi, Itai Segall:
The Resh Programming Language for Multirobot Orchestration. ICRA 2021: 4026-4032 - [c55]Kedar S. Namjoshi, Anton Xue:
A Self-certifying Compilation Framework for WebAssembly. VMCAI 2021: 127-148 - [e4]Cezara Dragoi, Suvam Mukherjee, Kedar S. Namjoshi:
Static Analysis - 28th International Symposium, SAS 2021, Chicago, IL, USA, October 17-19, 2021, Proceedings. Lecture Notes in Computer Science 12913, Springer 2021, ISBN 978-3-030-88805-3 [contents] - [i4]Martin Carroll, Kedar S. Namjoshi, Itai Segall:
The Resh Programming Language for Multirobot Orchestration. CoRR abs/2103.13921 (2021) - 2020
- [j10]Suguman Bansal, Kedar S. Namjoshi, Yaniv Sa'ar:
Synthesis of coordination programs from linear temporal specifications. Proc. ACM Program. Lang. 4(POPL): 54:1-54:27 (2020) - [c54]Kedar S. Namjoshi, Lucas M. Tabajara:
Witnessing Secure Compilation. VMCAI 2020: 1-22
2010 – 2019
- 2019
- [i3]Kedar S. Namjoshi, Richard J. Trefler:
Symmetry Reduction for the Local Mu-Calculus. CoRR abs/1903.10405 (2019) - [i2]Suguman Bansal, Kedar S. Namjoshi, Yaniv Sa'ar:
Synthesis of coordination programs from linear temporal logic. CoRR abs/1911.03807 (2019) - [i1]Kedar S. Namjoshi, Lucas M. Tabajara:
Witnessing Secure Compilation. CoRR abs/1911.05866 (2019) - 2018
- [j9]Chaoqiang Deng, Kedar S. Namjoshi:
Securing a compiler transformation. Formal Methods Syst. Des. 53(2): 166-188 (2018) - [c53]Suguman Bansal, Kedar S. Namjoshi, Yaniv Sa'ar:
Synthesis of Asynchronous Reactive Programs from Temporal Specifications. CAV (1) 2018: 367-385 - [c52]Kedar S. Namjoshi, Zvonimir Pavlinovic:
The Impact of Program Transformations on Static Program Analysis. SAS 2018: 306-325 - [c51]Kedar S. Namjoshi, Richard J. Trefler:
Symmetry Reduction for the Local Mu-Calculus. TACAS (2) 2018: 379-395 - [p1]Dimitra Giannakopoulou, Kedar S. Namjoshi, Corina S. Pasareanu:
Compositional Reasoning. Handbook of Model Checking 2018: 345-383 - 2017
- [c50]Chaoqiang Deng, Kedar S. Namjoshi:
Witnessing Network Transformations. RV 2017: 155-171 - [c49]Chaoqiang Deng, Kedar S. Namjoshi:
Securing the SSA Transform. SAS 2017: 88-105 - 2016
- [c48]Rigel Gjomemo, Phu H. Phung, Edmund Ballou, Kedar S. Namjoshi, V. N. Venkatakrishnan, Lenore D. Zuck:
Leveraging Static Analysis Tools for Improving Usability of Memory Error Sanitization Compilers. QRS 2016: 323-334 - [c47]Chaoqiang Deng, Kedar S. Namjoshi:
Securing a Compiler Transformation. SAS 2016: 170-188 - [c46]Kedar S. Namjoshi, Nimit Singhania:
Loopy: Programmable and Formally Verified Loop Transformations. SAS 2016: 383-402 - [c45]Kedar S. Namjoshi, Richard J. Trefler:
Parameterized Compositional Model Checking. TACAS 2016: 589-606 - 2015
- [c44]Kedar S. Namjoshi, Richard J. Trefler:
Loop Freedom in AODVv2. FORTE 2015: 98-112 - [c43]Kedar S. Namjoshi, Richard J. Trefler:
Analysis of Dynamic Process Networks. TACAS 2015: 164-178 - [c42]Rigel Gjomemo, Kedar S. Namjoshi, Phu H. Phung, V. N. Venkatakrishnan, Lenore D. Zuck:
From Verification to Optimizations. VMCAI 2015: 300-317 - 2013
- [c41]Kedar S. Namjoshi, Giacomo Tagliabue, Lenore D. Zuck:
A Witnessing Compiler: A Proof of Concept. RV 2013: 340-345 - [c40]Kedar S. Namjoshi, Lenore D. Zuck:
Witnessing Program Transformations. SAS 2013: 304-323 - [c39]Kedar S. Namjoshi, Richard J. Trefler:
Uncovering Symmetries in Irregular Process Networks. VMCAI 2013: 496-514 - [c38]Kedar S. Namjoshi:
Model Checking in Bits and Pieces. Festschrift for Dave Schmidt 2013: 404-416 - 2012
- [j8]Pramod V. Koppol, Kedar S. Namjoshi, Thanos Stathopoulos, Gordon T. Wilfong:
The Inherent Difficulty of Timely Primary-Backup Replication. Bell Labs Tech. J. 17(2): 15-24 (2012) - [c37]Kedar S. Namjoshi, Richard J. Trefler:
Local Symmetry and Compositional Verification. VMCAI 2012: 348-362 - 2011
- [c36]Uri Klein, Kedar S. Namjoshi:
Formalization and Automated Verification of RESTful Behavior. CAV 2011: 541-556 - [c35]Pramod V. Koppol, Kedar S. Namjoshi, Thanos Stathopoulos, Gordon T. Wilfong:
The inherent difficulty of timely primary-backup replication. PODC 2011: 349-350 - [e3]Kedar S. Namjoshi, Andreas Zeller, Avi Ziv:
Hardware and Software: Verification and Testing - 5th International Haifa Verification Conference, HVC 2009, Haifa, Israel, October 19-22, 2009, Revised Selected Papers. Lecture Notes in Computer Science 6405, Springer 2011, ISBN 978-3-642-19236-4 [contents] - 2010
- [j7]Kedar S. Namjoshi, Tomohiro Yoneda:
Preface. Int. J. Found. Comput. Sci. 21(2) (2010) - [j6]Kedar S. Namjoshi, Richard J. Trefler:
On the completeness of compositional reasoning methods. ACM Trans. Comput. Log. 11(3): 16:1-16:22 (2010) - [c34]Nalini Vasudevan, Kedar S. Namjoshi, Stephen A. Edwards:
Simple and fast biased locks. PACT 2010: 65-74 - [c33]Ariel Cohen, Kedar S. Namjoshi, Yaniv Sa'ar:
A Dash of Fairness for Compositional Reasoning. CAV 2010: 543-557 - [c32]Ariel Cohen, Kedar S. Namjoshi, Yaniv Sa'ar:
SPLIT: A Compositional LTL Verifier. CAV 2010: 558-561 - [c31]Ariel Cohen, Kedar S. Namjoshi, Yaniv Sa'ar, Lenore D. Zuck, Katya I. Kisyova:
Parallelizing a Symbolic Compositional Model-Checking Algorithm. Haifa Verification Conference 2010: 46-59 - [c30]Kedar S. Namjoshi, Girija J. Narlikar:
Robust and Fast Pattern Matching for Intrusion Detection. INFOCOM 2010: 740-748
2000 – 2009
- 2009
- [j5]Robert M. Arlein, Dennis Dams, Richard B. Hull, John P. Letourneau, Kedar S. Namjoshi:
Telco meets the Web: Programming shared-experience services. Bell Labs Tech. J. 14(3): 167-185 (2009) - [j4]Ariel Cohen, Kedar S. Namjoshi:
Local proofs for global safety properties. Formal Methods Syst. Des. 34(2): 104-125 (2009) - 2008
- [c29]Ariel Cohen, Kedar S. Namjoshi:
Local Proofs for Linear-Time Properties of Concurrent Programs. CAV 2008: 149-161 - [c28]Christopher L. Conway, Dennis Dams, Kedar S. Namjoshi, Clark W. Barrett:
Pointer Analysis, Conditional Soundness, and Proving the Absence of Errors. SAS 2008: 62-77 - 2007
- [c27]Ariel Cohen, Kedar S. Namjoshi:
Local Proofs for Global Safety Properties. CAV 2007: 55-67 - [c26]Kedar S. Namjoshi:
Symmetry and Completeness in the Analysis of Parameterized Systems. VMCAI 2007: 299-313 - [e2]Kedar S. Namjoshi, Tomohiro Yoneda, Teruo Higashino, Yoshio Okamura:
Automated Technology for Verification and Analysis, 5th International Symposium, ATVA 2007, Tokyo, Japan, October 22-25, 2007, Proceedings. Lecture Notes in Computer Science 4762, Springer 2007, ISBN 978-3-540-75595-1 [contents] - 2006
- [e1]E. Allen Emerson, Kedar S. Namjoshi:
Verification, Model Checking, and Abstract Interpretation, 7th International Conference, VMCAI 2006, Charleston, SC, USA, January 8-10, 2006, Proceedings. Lecture Notes in Computer Science 3855, Springer 2006, ISBN 3-540-31139-4 [contents] - 2005
- [c25]Christopher L. Conway, Kedar S. Namjoshi, Dennis Dams, Stephen A. Edwards:
Incremental Algorithms for Inter-procedural Analysis of Safety Properties. CAV 2005: 449-461 - [c24]Dennis Dams, Kedar S. Namjoshi:
Orion: High-Precision Methods for Static Error Analysis of C and C++ Programs. FMCO 2005: 138-160 - [c23]Dennis Dams, Kedar S. Namjoshi:
Automata as Abstractions. VMCAI 2005: 216-232 - 2004
- [c22]Kedar S. Namjoshi:
An Efficiently Checkable, Proof-Based Formulation of Vacuity in Model Checking. CAV 2004: 57-69 - [c21]Dennis Dams, Kedar S. Namjoshi:
The Existence of Finite Abstractions for Branching Time Model Checking. LICS 2004: 335-344 - 2003
- [j3]E. Allen Emerson, Kedar S. Namjoshi:
On Reasoning About Rings. Int. J. Found. Comput. Sci. 14(4): 527-550 (2003) - [j2]Amy P. Felty, Kedar S. Namjoshi:
Feature specification and automated conflict detection. ACM Trans. Softw. Eng. Methodol. 12(1): 3-27 (2003) - [c20]Kedar S. Namjoshi:
Abstraction for Branching Time Properties. CAV 2003: 288-300 - [c19]Nina Amla, E. Allen Emerson, Kedar S. Namjoshi, Richard J. Trefler:
Abstract Patterns of Compositional Reasoning. CONCUR 2003: 423-438 - [c18]Kedar S. Namjoshi:
Lifting Temporal Proofs through Abstractions. VMCAI 2003: 174-188 - [c17]Dennis Dams, Kedar S. Namjoshi:
Shape Analysis through Predicate Abstraction and Model Checking. VMCAI 2003: 310-324 - 2002
- [c16]Nina Amla, E. Allen Emerson, Kedar S. Namjoshi, Richard J. Trefler:
Visual Specifications for Modular Reasoning about Asynchronous Systems. FORTE 2002: 226-242 - 2001
- [c15]Kedar S. Namjoshi:
Certifying Model Checkers. CAV 2001: 2-13 - [c14]Nina Amla, E. Allen Emerson, Robert P. Kurshan, Kedar S. Namjoshi:
Rtdt: A Front-End for Efficient Model Checking of Synchronous Timing Diagrams. CAV 2001: 387-390 - [c13]Nina Amla, E. Allen Emerson, Kedar S. Namjoshi, Richard J. Trefler:
Assume-Guarantee Based Compositional Reasoning for Synchronous Timing Diagrams. TACAS 2001: 465-479 - 2000
- [j1]Richard Raimi, Ramin Hojati, Kedar S. Namjoshi:
Environment modeling and language universality. ACM Trans. Design Autom. Electr. Syst. 5(3): 705-725 (2000) - [c12]Kedar S. Namjoshi, Richard J. Trefler:
On the Competeness of Compositional Reasoning. CAV 2000: 139-153 - [c11]Kedar S. Namjoshi, Robert P. Kurshan:
Syntactic Program Transformations for Automatic Abstraction. CAV 2000: 435-449 - [c10]Amy P. Felty, Kedar S. Namjoshi:
Feature Specification and Automatic Conflict Detection. FIW 2000: 179-192 - [c9]Nina Amla, E. Allen Emerson, Robert P. Kurshan, Kedar S. Namjoshi:
Model Checking Synchronous Timing Diagrams. FMCAD 2000: 283-298
1990 – 1999
- 1999
- [c8]Panagiotis Manolios, Kedar S. Namjoshi, Robert Summers:
Linking Theorem Proving and Model-Checking with Well-Founded Bisimulation. CAV 1999: 369-379 - [c7]Kedar S. Namjoshi, Robert P. Kurshan:
Efficient Analysis of Cyclic Definitions. CAV 1999: 394-405 - [c6]Nina Amla, E. Allen Emerson, Kedar S. Namjoshi:
Efficient Decompositional Model Checking for Regular Timing Diagrams. CHARME 1999: 67-81 - 1998
- [c5]E. Allen Emerson, Kedar S. Namjoshi:
Verification of Parameterized Bus Arbitration Protocol. CAV 1998: 452-463 - [c4]E. Allen Emerson, Kedar S. Namjoshi:
On Model Checking for Non-Deterministic Infinite-State Systems. LICS 1998: 70-80 - 1997
- [c3]Kedar S. Namjoshi:
A Simple Characterization of Stuttering Bisimulation. FSTTCS 1997: 284-296 - 1996
- [c2]E. Allen Emerson, Kedar S. Namjoshi:
Automatic Verification of Parameterized Synchronous Systems (Extended Abstract). CAV 1996: 87-98 - 1995
- [c1]E. Allen Emerson, Kedar S. Namjoshi:
Reasoning about Rings. POPL 1995: 85-94
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
