2 search results - page 1 / 1 » Typestate Checking and Regular Graph Constraints |
126
Voted
CORR
2004
Springer
14 years 10 months ago
2004
Springer
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 ...
78
Voted
CP
2000
Springer
15 years 2 months ago
2000
Springer
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...