Sciweavers

662 search results - page 115 / 133
» Model Checking Procedures for Infinite State Systems
Sort
View
SIGSOFT
2003
ACM
15 years 10 months ago
Towards scalable compositional analysis by refactoring design models
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia...
STEP
2003
IEEE
15 years 2 months ago
Incorporating Quality Requirements in Software Migration Process
The reengineering of legacy software systems to modern Object Oriented platforms has received significant attention over the past few years. However, most often the reengineering ...
Ying Zou
89
Voted
HYBRID
2010
Springer
15 years 3 months ago
On the connections between PCTL and dynamic programming
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
Federico Ramponi, Debasish Chatterjee, Sean Summer...
QEST
2009
IEEE
15 years 4 months ago
Recent Extensions to Traviando
—Traviando is a trace analyzer and visualizer for simulation traces of discrete event dynamic systems. In this paper, we briefly outline recent extensions of Traviando towards a...
Peter Kemper
SIGSOFT
2001
ACM
15 years 10 months ago
Detecting implied scenarios in message sequence chart specifications
Scenario-based specifications such as Message Sequence Charts (MSCs) are becoming increasingly popular as part of a requirements specification. Scenarios describe how system compo...
Jeff Kramer, Jeff Magee, Sebastián Uchitel