Sciweavers

90 search results - page 7 / 18
» Chart Generation
Sort
View
FORTE
2007
13 years 9 months ago
Recovering Repetitive Sub-functions from Observations
This paper proposes an algorithm which, given a set of observations of an existing concurrent system that has repetitive subfunctions, constructs a Message Sequence Charts (MSC) gr...
Guy-Vincent Jourdan, Hasan Ural, Shen Wang, Hü...
CONCUR
2007
Springer
13 years 11 months ago
Checking Coverage for Infinite Collections of Timed Scenarios
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
S. Akshay, Madhavan Mukund, K. Narayan Kumar
IANDC
2010
115views more  IANDC 2010»
13 years 4 months ago
18th International Conference on Concurrency Theory
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
Luís Caires, Vasco Thudichum Vasconcelos
COMPSAC
2006
IEEE
14 years 1 months ago
A Practical Approach for Automated Test Case Generation using Statecharts
This paper presents an approach for automated test case generation using a software specification modeled in Statecharts. The steps defined in such approach involve: translation o...
Valdivino A. Santiago, Ana Silvia Martins do Amara...
CICLING
2009
Springer
14 years 8 months ago
Generating Executable Scenarios from Natural Language
Abstract. Bridging the gap between the specification of software requirements and actual execution of the behavior of the specified system has been the target of much research in r...
Michal Gordon, David Harel