|
Search the dblp DataBase
Sanjit A. Seshia:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Armando Solar-Lezama, Liviu Tancau, Rastislav Bodík, Sanjit A. Seshia, Vijay A. Saraswat
Combinatorial sketching for finite programs. [Citation Graph (0, 0)][DBLP] ASPLOS, 2006, pp:404-415 [Conf]
- Sanjit A. Seshia, Randal E. Bryant, Kenneth S. Stevens
Modeling and Verifying Circuits Using Generalized Relative Timing. [Citation Graph (0, 0)][DBLP] ASYNC, 2005, pp:98-108 [Conf]
- Randal E. Bryant, Sanjit A. Seshia
Decision Procedures Customized for Formal Verification. [Citation Graph (0, 0)][DBLP] CADE, 2005, pp:255-259 [Conf]
- Randal E. Bryant, Shuvendu K. Lahiri, Sanjit A. Seshia
Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions. [Citation Graph (0, 0)][DBLP] CAV, 2002, pp:78-92 [Conf]
- Cormac Flanagan, Shaz Qadeer, Sanjit A. Seshia
A Modular Checker for Multithreaded Programs. [Citation Graph (0, 0)][DBLP] CAV, 2002, pp:180-194 [Conf]
- Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman
Abstraction-Based Satisfiability Solving of Presburger Arithmetic. [Citation Graph (0, 0)][DBLP] CAV, 2004, pp:308-320 [Conf]
- Shuvendu K. Lahiri, Sanjit A. Seshia
The UCLID Decision Procedure. [Citation Graph (0, 0)][DBLP] CAV, 2004, pp:475-478 [Conf]
- Sanjit A. Seshia, Randal E. Bryant
Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods. [Citation Graph (0, 0)][DBLP] CAV, 2003, pp:154-166 [Conf]
- Ofer Strichman, Sanjit A. Seshia, Randal E. Bryant
Deciding Separation Formulas with SAT. [Citation Graph (0, 0)][DBLP] CAV, 2002, pp:209-222 [Conf]
- Randal E. Bryant, Shuvendu K. Lahiri, Sanjit A. Seshia
Convergence Testing in Term-Level Bounded Model Checking. [Citation Graph (0, 0)][DBLP] CHARME, 2003, pp:348-362 [Conf]
- Sanjit A. Seshia, Shuvendu K. Lahiri, Randal E. Bryant
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions. [Citation Graph (0, 0)][DBLP] DAC, 2003, pp:425-430 [Conf]
- Sanjit A. Seshia, R. K. Shyamasundar, A. K. Bhattacharjee, S. D. Dhodapkar
A Translation of Statecharts to Esterel. [Citation Graph (0, 0)][DBLP] World Congress on Formal Methods, 1999, pp:983-1007 [Conf]
- Shuvendu K. Lahiri, Sanjit A. Seshia, Randal E. Bryant
Modeling and Verification of Out-of-Order Microprocessors in UCLID. [Citation Graph (0, 0)][DBLP] FMCAD, 2002, pp:142-159 [Conf]
- Vinod Ganapathy, Sanjit A. Seshia, Somesh Jha, Thomas W. Reps, Randal E. Bryant
Automatic discovery of API-level exploits. [Citation Graph (0, 0)][DBLP] ICSE, 2005, pp:312-321 [Conf]
- Sanjit A. Seshia, Randal E. Bryant
Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds. [Citation Graph (0, 0)][DBLP] LICS, 2004, pp:100-109 [Conf]
- A. K. Bhattacharjee, S. D. Dhodapkar, Sanjit A. Seshia, R. K. Shyamasundar
A Graphical Environment for the Specification and Verification of Reactive Systems. [Citation Graph (0, 0)][DBLP] SAFECOMP, 1999, pp:431-444 [Conf]
- Mihai Christodorescu, Somesh Jha, Sanjit A. Seshia, Dawn Xiaodong Song, Randal E. Bryant
Semantics-Aware Malware Detection. [Citation Graph (0, 0)][DBLP] IEEE Symposium on Security and Privacy, 2005, pp:32-46 [Conf]
- Sanjit A. Seshia, Randal E. Bryant
Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds. [Citation Graph (0, 0)][DBLP] Logical Methods in Computer Science, 2005, v:1, n:2, pp:- [Journal]
- Cormac Flanagan, Stephen N. Freund, Shaz Qadeer, Sanjit A. Seshia
Modular verification of multithreaded programs. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:338, n:1-3, pp:153-183 [Journal]
- Sanjit A. Seshia, Wenchao Li, Subhasish Mitra
Verification-guided soft error resilience. [Citation Graph (0, 0)][DBLP] DATE, 2007, pp:1442-1447 [Conf]
- Thomas Huining Feng, Lynn Wang, Wei Zheng, Sri Kanajan, Sanjit A. Seshia
Interactive presentation: Automatic model generation for black box real-time systems. [Citation Graph (0, 0)][DBLP] DATE, 2007, pp:930-935 [Conf]
- Susmit Jha, Bryan A. Brady, Sanjit A. Seshia
Symbolic Reachability Analysis of Lazy Linear Hybrid Automata. [Citation Graph (0, 0)][DBLP] FORMATS, 2007, pp:241-256 [Conf]
- Sanjit A. Seshia
Autonomic Reactive Systems via Online Learning. [Citation Graph (0, 0)][DBLP] ICAC, 2007, pp:30- [Conf]
- Dirk Beyer, Arindam Chakrabarti, Thomas A. Henzinger, Sanjit A. Seshia
An Application ofWeb-Service Interfaces. [Citation Graph (0, 0)][DBLP] ICWS, 2007, pp:831-838 [Conf]
- Armando Solar-Lezama, Gilad Arnold, Liviu Tancau, Rastislav Bodík, Vijay A. Saraswat, Sanjit A. Seshia
Sketching stencils. [Citation Graph (0, 0)][DBLP] PLDI, 2007, pp:167-178 [Conf]
- Randal E. Bryant, Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman, Bryan A. Brady
Deciding Bit-Vector Arithmetic with Abstraction. [Citation Graph (0, 0)][DBLP] TACAS, 2007, pp:358-372 [Conf]
Beaver: Engineering an Efficient SMT Solver for Bit-Vector Arithmetic. [Citation Graph (, )][DBLP]
On voting machine design for verification and testability. [Citation Graph (, )][DBLP]
Scalable specification mining for verification and diagnosis. [Citation Graph (, )][DBLP]
Post-silicon validation opportunities, challenges and recent advances. [Citation Graph (, )][DBLP]
Design as you see FIT: System-level soft error analysis of sequential circuits. [Citation Graph (, )][DBLP]
Optimizations of an application-level protocol for enhanced dependability in FlexRay. [Citation Graph (, )][DBLP]
Automating Security Mediation Placement. [Citation Graph (, )][DBLP]
A Theory of Mutations with Applications to Vacuity, Coverage, and Fault Tolerance. [Citation Graph (, )][DBLP]
Formal verification at higher levels of abstraction. [Citation Graph (, )][DBLP]
Game-theoretic timing analysis. [Citation Graph (, )][DBLP]
The Case for Timing-Centric Distributed Software Invited Paper. [Citation Graph (, )][DBLP]
Oracle-guided component-based program synthesis. [Citation Graph (, )][DBLP]
Effective blame for information-flow violations. [Citation Graph (, )][DBLP]
Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds [Citation Graph (, )][DBLP]
On the Computational Complexity of Satisfiability Solving for String Theories [Citation Graph (, )][DBLP]
Search in 0.057secs, Finished in 0.059secs
|