3 search results - page 1 / 1 » Greatest Bisimulations for Binary Methods |
ENTCS
2002
13 years 5 months ago
2002
In previous work [14] I introduced a generalised notion of coalgebra that is capable of modelling binary methods as they occur in object-oriented programming. An important problem...
ENTCS
2006
13 years 5 months ago
2006
We extend the Reichel-Jacobs coalgebraic account of specification and refinement of objects and classes in Object Oriented Programming to (generalized) binary methods. These are m...
MMB
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Bisimulation reduction is a classical means to fight the infamous state space explosion problem, which limits the applicability of automated methods for verification li...