| 2009 |
|---|
| 37 | EE | P. Vijay Suman,
Paritosh K. Pandya:
Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions.
LATA 2009: 728-739 |
| 2008 |
|---|
| 36 | EE | Swarup Mohalik,
A. C. Rajeev,
Manoj G. Dixit,
S. Ramesh,
P. Vijay Suman,
Paritosh K. Pandya,
Shengbing Jiang:
Model checking based analysis of end-to-end latency in embedded, real-time systems with clock drifts.
DAC 2008: 296-299 |
| 35 | EE | P. Vijay Suman,
Paritosh K. Pandya,
Shankara Narayanan Krishna,
Lakshmi Manasa:
Timed Automata with Integer Resets: Language Inclusion and Expressiveness.
FORMATS 2008: 78-92 |
| 34 | EE | Kamal Lodaya,
Paritosh K. Pandya,
Simoni S. Shah:
Marking the chops: an unambiguous temporal logic.
IFIP TCS 2008: 461-476 |
| 33 | EE | Dina Thomas,
Supratik Chakraborty,
Paritosh K. Pandya:
Efficient guided symbolic reachability using reachability expressions.
STTT 10(2): 113-129 (2008) |
| 2007 |
|---|
| 32 | EE | Paritosh K. Pandya,
Shankara Narayanan Krishna,
Kuntal Loya:
On Sampling Abstraction of Continuous Time Logic with Durations.
TACAS 2007: 246-260 |
| 2006 |
|---|
| 31 | EE | Raman Kazhamiakin,
Paritosh K. Pandya,
Marco Pistore:
Timed Modelling and Analysis in Web Service Compositions.
ARES 2006: 840-846 |
| 30 | EE | Kamal Lodaya,
Paritosh K. Pandya:
A Dose of Timed Logic, in Guarded Measure.
FORMATS 2006: 260-273 |
| 29 | EE | Raman Kazhamiakin,
Paritosh K. Pandya,
Marco Pistore:
Representation, Verification, and Computation of Timed Properties in Web.
ICWS 2006: 497-504 |
| 28 | EE | Dina Thomas,
Supratik Chakraborty,
Paritosh K. Pandya:
Efficient Guided Symbolic Reachability Using Reachability Expressions.
TACAS 2006: 120-134 |
| 2005 |
|---|
| 27 | EE | Shankara Narayanan Krishna,
Paritosh K. Pandya:
Modal Strength Reduction in Quantified Discrete Duration Calculus.
FSTTCS 2005: 444-456 |
| 26 | EE | Babita Sharma,
Paritosh K. Pandya,
Supratik Chakraborty:
Bounded Validity Checking of Interval Duration Logic.
TACAS 2005: 301-316 |
| 25 | EE | Paritosh K. Pandya:
Finding Extremal Models of Discrete Duration Calculus formulae using Symbolic Search.
Electr. Notes Theor. Comput. Sci. 128(6): 247-262 (2005) |
| 2003 |
|---|
| 24 | | Paritosh K. Pandya,
Jaikumar Radhakrishnan:
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings
Springer 2003 |
| 23 | EE | Gaurav Chakravorty,
Paritosh K. Pandya:
Digitizing Interval Duration Logic.
CAV 2003: 167-179 |
| 2002 |
|---|
| 22 | EE | Paritosh K. Pandya:
The Saga of Synchronous Bus Arbiter: On Model Checking Quantitative Timing Properties of Synchronous Programs.
Electr. Notes Theor. Comput. Sci. 65(5): (2002) |
| 21 | EE | Paritosh K. Pandya:
Interval Duration Logic: Expressiveness and Decidability.
Electr. Notes Theor. Comput. Sci. 65(6): (2002) |
| 2001 |
|---|
| 20 | EE | Paritosh K. Pandya:
Model Checking CTL*[DC].
TACAS 2001: 559-573 |
| 1998 |
|---|
| 19 | | Paritosh K. Pandya,
Y. S. Ramakrishna:
Recursive Mean-Value Calculus.
FSTTCS 1998: 257-268 |
| 18 | EE | Manoranjan Satpathy,
Dang Van Hung,
Paritosh K. Pandya:
Some Decidability Results for Duration Calculus under Synchronous Interpretation.
FTRTFT 1998: 186-197 |
| 17 | EE | Paritosh K. Pandya,
Dang Van Hung:
Duration Calculus of Weakly Monotonic Time.
FTRTFT 1998: 55-64 |
| 16 | | Paritosh K. Pandya,
H.-P. Wang,
Qiwen Xu:
Toward a theory of sequential hybrid programs.
PROCOMET 1998: 366-384 |
| 1996 |
|---|
| 15 | | Paritosh K. Pandya:
Weak Chop Inverses and Liveness in Mean-Value Calculus.
FTRTFT 1996: 148-167 |
| 1995 |
|---|
| 14 | | Paritosh K. Pandya:
Some Extensions to Propositional Mean-Value Caculus: Expressiveness and Decidability.
CSL 1995: 434-451 |
| 13 | EE | Michael R. Hansen,
Paritosh K. Pandya,
Zhou Chaochen:
Finite Divergence.
Theor. Comput. Sci. 138(1): 113-139 (1995) |
| 1994 |
|---|
| 12 | | K. Narayan Kumar,
Paritosh K. Pandya:
On the Computational Power of Operators in ICSP with Fairness.
FSTTCS 1994: 231-242 |
| 11 | | Huiqun Yu,
Paritosh K. Pandya,
Yongqiang Sun:
A Calculus for Hybrid Sampled Data Systems.
FTRTFT 1994: 716-737 |
| 10 | | Xinyao Yu,
Ji Wang,
Chaochen Zhou,
Paritosh K. Pandya:
Formal Design of Hybrid Systems.
FTRTFT 1994: 738-755 |
| 1993 |
|---|
| 9 | | M. R. K. Krishna Rao,
Paritosh K. Pandya,
R. K. Shyamasundar:
Verification Tools in the Development of Provably Correct Compilers.
FME 1993: 442-461 |
| 8 | | K. Narayan Kumar,
Paritosh K. Pandya:
ICSP and Its Relationship with ACSP and CSP.
FSTTCS 1993: 358-372 |
| 7 | | K. Narayan Kumar,
Paritosh K. Pandya:
Infinitary Parallelism without Unbounded Nondeterminism in CSP.
Acta Inf. 30(5): 467-487 (1993) |
| 1992 |
|---|
| 6 | | Paul H. B. Gardiner,
Paritosh K. Pandya:
Reasoning Algebraically about Recursion.
Sci. Comput. Program. 18(3): 271-280 (1992) |
| 1991 |
|---|
| 5 | | Paritosh K. Pandya,
Mathai Joseph:
P - A Logic - A Compositional Proof System for Distributed Programs.
Distributed Computing 5: 37-54 (1991) |
| 1990 |
|---|
| 4 | | Jonathan P. Bowen,
Jifeng He,
Paritosh K. Pandya:
An Approach to Verifiable Compiling Specification and Prototyping.
PLILP 1990: 45-59 |
| 1989 |
|---|
| 3 | | Paritosh K. Pandya:
Some Comments on the Assumption-Commitment Framework for Compositional Verification of Distributed Programs.
REX Workshop 1989: 622-640 |
| 1986 |
|---|
| 2 | | Mathai Joseph,
Paritosh K. Pandya:
Finding Response Times in a Real-Time System.
Comput. J. 29(5): 390-395 (1986) |
| 1 | | Paritosh K. Pandya,
Mathai Joseph:
A Structure-Directed Total Correctness Proof Rule for Recursive Procedure Calls.
Comput. J. 29(6): 531-537 (1986) |
