A verification of class structure evolution model and its parameters
Abstract
References
Recommendations
A Perfect Model for Bounded Verification
LICS '12: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer ScienceA class of languages C is perfect if it is closed under Boolean operations and the emptiness problem is decidable. Perfect language classes are the basis for the automata-theoretic approach to model checking: a system is correct if the language ...
Towards Constructing a Class Evolution Model
APSEC '97: Proceedings of the Fourth Asia-Pacific Software Engineering and International Computer Science ConferenceSoftware tends to change itself according to user requirements changes. In the object-oriented technology, it is important to find a way how classes evolve to cope with new user requirements or to obtain reusability. We propose that developers need to ...
Temporal logics with language parameters
AbstractWe develop a generic framework to extend the logics LTL, CTL+ and CTL⁎ by automata-based connectives from formal language classes and analyse this framework with regard to regular languages, visibly pushdown languages, deterministic and non-...
Comments
Information & Contributors
Information
Published In
- Conference Chair:
- Mikio Aoyama,
- Program Chairs:
- Katsuro Inoue,
- Vaclav Rajlich
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Article
Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 157Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in