Mahadevan Subramaniam
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mahadevan Subramaniam has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Daniel J. Rosenkrantz
Biocomplexity Institute, University of Virginia , Charlottesville, VA 22904
1 shared publication - Deepak Kapur
University of New Mexico
1 shared publication - Hai-Feng Guo
Department of Computer Science University of Nebraska at Omaha Omaha 68182-0500 NE USA
1 shared publication - Harvey Siy
Computer Science Department, University of Nebraska at Omaha, Omaha, NE 68182, U.S.A.
1 shared publication - Parvathi Chundi
University of Nebraska at Omaha
1 shared publication Patrick Conway
Advanced Micro Devices, Sunnyvale, CA 94088, U.S.A.
1 shared publication
Latest Publications
- Open Access
L2C2: Logic-based LSC Consistency Checking
Live sequence charts (LSCs) have been proposed as an inter-object scenario-based specification and visual programming language for reactive systems. In this paper, we introduce a logic-based framework to check the consistency of an LSC specification. An LSC simulator has been implemented in logic programming, utilizing a memoized depth-first search strategy, to show how a reactive system in LSCs would response to a set of external event sequences. A formal notation is defined to specify external event sequences, extending the regular expression with a parallel operator and a testing control. The parallel operator allows interleaved parallel external events to be tested in LSCs simultaneously; while the testing control provides users to a new approach to specify and test certain temporal properties (e.g., CTL formula) in a form of LSC. Our framework further provides either a state transition graph or a failure trace to justify the consistency checking results.
Open AccessL2C2: Logic-based LSC Consistency Checking
Live sequence charts (LSCs) have been proposed as an inter-object scenario-based specification and visual programming language for reactive systems. In this paper, we introduce a logic-based framework to check the consistency of an LSC specification. An LSC simulator has been implemented in logic programming, utilizing a memoized depth-first search strategy, to show how a reactive system in LSCs would response to a set of external event sequences. A formal notation is defined to specify external event sequences, extending the regular expression with a parallel operator and a testing control. The parallel operator allows interleaved parallel external events to be tested in LSCs simultaneously; while the testing control provides users to a new approach to specify and test certain temporal properties (e.g., CTL formula) in a form of LSC. Our framework further provides either a state transition graph or a failure trace to justify the consistency checking results.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2007 IEEE International Conference on Software Maintenance
- No. 10636773,p. 415-424
Discovering Dynamic Developer Relationships from Software Version Histories by Time Series Segmentation
Time series analysis is a promising approach to discover temporal patterns from time stamped, numeric data. A novel approach to apply time series analysis to discern temporal information from software version repositories is proposed. Version logs containing numeric as well as non-numeric data are represented as an item-set time series. A dynamic programming based algorithm to optimally segment an item-set time series is presented. The algorithm automatically produces a compacted item-set time series that can be analyzed to discern temporal patterns. The effectiveness of the approach is illustrated by applying to the Mozilla data set to study the change frequency and developer activity profiles. The experimental results show that the segmentation algorithm produces segments that capture meaningful information and is superior to the information content obtaining by arbitrarily segmenting time period into regular time intervals.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2007 IEEE International Conference on Software Maintenance
- No. 10636773,p. 415-424
Discovering Dynamic Developer Relationships from Software Version Histories by Time Series Segmentation
Time series analysis is a promising approach to discover temporal patterns from time stamped, numeric data. A novel approach to apply time series analysis to discern temporal information from software version repositories is proposed. Version logs containing numeric as well as non-numeric data are represented as an item-set time series. A dynamic programming based algorithm to optimally segment an item-set time series is presented. The algorithm automatically produces a compacted item-set time series that can be analyzed to discern temporal patterns. The effectiveness of the approach is illustrated by applying to the Mozilla data set to study the change frequency and developer activity profiles. The experimental results show that the segmentation algorithm produces segments that capture meaningful information and is superior to the information content obtaining by arbitrarily segmenting time period into regular time intervals.
- 1 January 2007
- Published by Springer Nature
- p. 177-191
Predicting Failures of and Repairing Inductive Proof Attempts
- 1 January 2007
- Published by Springer Nature
- p. 177-191
Predicting Failures of and Repairing Inductive Proof Attempts
- 1 August 2006
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 19 (3) , 355-368
A methodology for early validation of cache coherence protocols based on relational databases
- 1 August 2006
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 19 (3) , 355-368
A methodology for early validation of cache coherence protocols based on relational databases
- 1 December 2003
- Published by Office of Scientific and Technical Information (OSTI)
Higher-order transformation and the distributed data problem.
The distributed data problem, is characterized by the desire to bring together semantically related data from syntactically unrelated portions of a term. Two strategic combinators, dynamic and transient, are introduced in the context of a classical strategic programming framework. The impact of the resulting system on instances of the distributed data problem is then explored.
- 1 December 2003
- Published by Office of Scientific and Technical Information (OSTI)
Higher-order transformation and the distributed data problem.
The distributed data problem, is characterized by the desire to bring together semantically related data from syntactically unrelated portions of a term. Two strategic combinators, dynamic and transient, are introduced in the context of a classical strategic programming framework. The impact of the resulting system on instances of the distributed data problem is then explored.