Sciweavers

456 search results - page 92 / 92
» A Proof System for Abstract Non-interference
Sort
View
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 5 months 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