Sciweavers

CORR
2004
Springer
177views Education» more  CORR 2004»
14 years 9 days ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard