391 search results - page 38 / 79 » Formal Universes |
97
Voted
FM
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
101
Voted
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
A binary language-theoretic operation is proposed, which is dual to the concatenation of languages in the same sense as the universal quantifier in logic is dual to the existenti...
131
click to vote
IDEAS
2003
IEEE
15 years 5 months ago
2003
IEEE
In the context of information system engineering, we propose a four-layer metamodeling architecture with a comprehensive set of operations on metamodels. Our architecture enables ...
92
Voted
CAV
2003
Springer
15 years 5 months ago
2003
Springer
ion and BDDs Complement SAT-based BMC in DiVer Aarti Gupta1, Malay Ganai1 , Chao Wang2, Zijiang Yang1, Pranav Ashar1 1 NEC Laboratories America, Princeton, NJ, U.S.A. 2 University ...
FORMATS
2003
Springer
15 years 5 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...