![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Deepak Goyal Charles Barton , Philippe Charles , Deepak Goyal, Mukund Raghavachari , Marcus Fontoura , Vanja Josifovski : Streaming XPath Processing with Forward and Backward Axes. ICDE 2003 : 455-466 John Field , Deepak Goyal, G. Ramalingam , Eran Yahav : Typestate Verification: Abstraction Techniques and Complexity Results. SAS 2003 : 439-462 G. Ramalingam , Alex Varshavsky , John Field , Deepak Goyal, Shmuel Sagiv : Deriving Specialized Program Analyses for Certifying Component-Client Conformance. PLDI 2002 : 83-94 Roman Manevich , G. Ramalingam , John Field , Deepak Goyal, Shmuel Sagiv : Compactly Representing First-Order Structures for Static Analysis. SAS 2002 : 196-212 Deepak Goyal, Robert Paige : A New Solution to the Hidden Copy Problem. SAS 1998 : 327-348 Deepak Goyal, Robert Paige : The formal reconstruction and speedup of the linear time fragment of Willard's relational calculus subset. Algorithmic Languages and Calculi 1997 : 382-414 1 [ 6 ] 2 [ 6 ] 3 [ 3 ] [ 4 ] [ 5 ] 4 [ 6 ] 5 [ 6 ] 6 [ 3 ] 7 [ 1 ] [ 2 ] 8 [ 6 ] 9 [ 3 ] [ 4 ] [ 5 ] 10 [ 3 ] [ 4 ] 11 [ 4 ] 12 [ 5 ] ![]() ©2004 Association for Computing Machinery |