31 search results - page 1 / 7 » Identifying Enumeration Types Modeled with Symbolic Constant... |
WCRE
1996
IEEE
13 years 9 months ago
1996
IEEE
An important challenge in software reengineering is to encapsulate collections of related data that, due to the absence of appropriate constructs for encapsulation in legacy progr...
FATES
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. Classical state-oriented testing approaches are based on simple machine models such as Labelled Transition Systems (LTSs), in which data is represented by concrete values...
ISSTA
1998
ACM
13 years 9 months ago
1998
ACM
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...
IWFM
2003
13 years 6 months ago
2003
We outline a possible logic that will allow us to give a unified approach to reasoning about computational effects. The logic is given by extending Moggi’s computational λ-cal...
CAV
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Separation Logic consists of a Boolean combination of predicates of the form vi ≥ vj +c where c is a constant and vi, vj are variables of some ordered infinite type li...