SELECT
PUBLICATIONS
·
C. Kintala, “Software Rejuvenation in Embedded Systems,”
Journal of Automata, Languages and
Combinatorics, Vol. 14, No. 1, pp. 63-73,
http://www.jalc.de/search/j14_1_i.html, 2009
·
V. Sundaram, S. Homchaudhuri, S. Garg, C. Kintala and S.
Bagchi, “Improving Dependability Using Sharing Supplementary Memory and
Opportunistic Micro Rejuvenation in Multi-tasking Embedded Systems,” Proceedings
of 13th
·
L. Bernstein
and C. M. R. Kintala, “Integrating
Software Reliability and Software Engineering in Education,” Workshop on Applied
Software Reliability, Proceedings of Intl. Conference on Dependable Systems and
Networks, June 25, 2006.
http://www.dsn.org
·
S. Garg, C. M. R. Kintala and D. Stott, “Reducing the
recovery times of IP-Phones in an H.323 based VoIP System,” Presented at the 3rd
International Service Availability Symposium, Helsinki, Finland, May 15-16,
2006.
http://www.cs.helsinki.fi/events/isas2006/
·
B. Karacali and C. M. R. Kintala, “Scalable Network
Monitoring for Multimedia Applications in Enterprise Networks,” Presented at the
13th International Conf. on Computer
Communications and Networks (ICCCN-2004)), Chicago,
pp. 329-334, October 11-13, 2004.
·
M. Kappes and C. M. R. Kintala, “Tradeoffs Between
Reliability and Conciseness of Deterministic Finite Automata,” Journal of
Automata, Languages and Combinatorics, pp. 281-292, Vol. 9, No. 2, 2004.
http://fuzzy.cs.uni-magdeburg.de/theo/jalc/contents/jalc0902.html
·
D. Liang, P. E. Chung, Y. Huang, C. Kintala, W. Lee, T. K.
Tsai and C. Wang, “NT-SwiFT: software implemented fault tolerance on Windows
NT,” Journal of Systems and Software,
Vol. 71, pp. 127-141, April 2004.
http://www.elsevier.com/locate/jss
·
D. Chen, S. Garg, C. M. R. Kintala, and K. S. Trivedi,
“Dependability Enhancement of 802.11 Wireless LAN with redundancy techniques,”
Presented at the International Conference on
Dependable Systems and Networks (DSN 2003), June
22-25, 2003.
· J.
Goldstine, M. Kappes, C. Kintala, J. Leung, A. Malcher and D. Wotschke,
“Descriptional Complexity of Machines with Limited Resources,” Journal of
Universal Computer Science (JUCS),
Vol. 8, No. 2,
http://www.jucs.org/jucs_8_2, pp. 193-234, March 2002.
· O.
Damani, P. Chung, Y. Huang, C. Kintala and Y. Wang, “ONE-IP:
Techniques for Hosting a Service on a Cluster of
Machines,” Computer Networks and ISDN
Systems, Vol. 29, pp. 1019-1027, 1997.
Originally, presented at the 6th WWW conf.,
http://www6.nttlabs.com/HyperNews/get/PAPER196.html,
April 7-11, 1997.
· Y.
M. Wang, Y. Huang, W. K. Fuchs, C. M. R. Kintala, and G. Suri, “Progressive
Retry for Software Failure Recovery in Message-Passing Applications,”
IEEE Transactions on Computers, Vol. 46, No. 10,
pp. 1137-1141, October 1997.
· Y.
Huang and C. M. R. Kintala, “Software Fault Tolerance in the Application Layer,”
Chapter 10 in Trends in Software Series,
John Wiley & Sons, 1996.
·
S. Garg, Y. Huang, C. M. R. Kintala and K. Trivedi,
“Minimizing Completion Time of a Program by Checkpointing and Rejuvenation,”
Proceedings of ACM SIGMETRICS Conf. on
Measurement and Modeling of Computer Systems, Philadelphia, Pa., pp.
252-261, May 23-26, 1996.
·
Y. Huang, C. M. R. Kintala, N. Kolettis and N. D. Fulton,
“Software Rejuvenation: Analysis, Module and Applications,” Proceedings of
25th International Symposium on Fault
Tolerant Computing (FTCS-25), pp. 381-390, June
27-30, 1995.
·
Y. M. Wang, Y. Huang, K. P. Vo, P. Y. Chung and C. M. R.
Kintala, “Checkpointing and Its Applications,” Proceedings of
25th
International Symposium on Fault Tolerant Computing (FTCS-25)
pp. 22-31, June 27-30, 1995.
· C.
M. R. Kintala, K. Y. Pun and D. Wotschke, “Concise Representations of Regular
Languages,” Mathematical Systems Theory,
Vol. 26, pp. 379-395, 1993.
·
Y. Huang and C. M. R. Kintala, Software Implemented Fault Tolerance:
Technologies and Experience,” Proceedings of 23rd
International Symposium on Fault Tolerant Computing (FTCS-23),
pp.2-9, June 22-24, 1993.
·
J. Goldstine, C. M. R. Kintala and D. Wotschke, “On
Measuring Nondeterminism in Regular Languages,”
Information and Computation, Vol.86,
No.2, pp.179-194, 1990.
· C.
M. R. Kintala and D. Wotschke, “Concurrent Conciseness of Degree, Probabilistic,
Nondeterministic and Deterministic Finite Automata,”
3rd Symposium on Theoretical Aspects of Computer Science,
pp.291-305, January 16-18, 1986.
·
D. G. Belanger and C. M. R. Kintala, “Data Extraction
Tools,” AT&T Technical Journal, Vol.
64, No. 9, pp. 2025-2036, 1985.
· B.A.
Bottos and C. M. R. Kintala, “Generation of Syntax-Directed Editors with
Text-Oriented Features,” AT&T Technical
Journal, Vol. 62, No. 10, Part 2, pp. 3205-3224, 1983.
·
E. Gansner, J. Horgan, C. M. R. Kintala, D. Moore and P.
Surko, “Semantics and Correctness of a Query Language Translation,”
9th ACM Symposium on Principles of Programming Languages,
pp. 278-287, Jan 25-27, 1982.
·
S. Ginsburg and C. M. R. Kintala, “Strict Interpretations of Deterministic
Pushdown Acceptors,” Mathematical Systems
Theory, Vol. 14, pp. 229-240, 1981.
· C.
M. R. Kintala and D. Wotschke, “Amounts of Nondeterminism in Finite Automata,”
Acta Informatica, Vol. 13, pp.
199-204, 1980.
· C.
M. R. Kintala and P.C. Fischer, “Refining Nondeterminism in Relativized
Polynomial-Time Bounded Computations,” SIAM Jl. on
Computing, Vol.19, No.1, pp. 46-53, 1980.
·
C. M. R. Kintala and P.C. Fischer,“Computations with a restricted number of
nondeterministic steps,” 9th
ACM Symposium on Theory of Computing, pp.
178-185, 1977.