ACM Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA), October[removed]Efficient Software Model Checking of Data Structure Properties Paul T. Darga Chandrasekhar Boyapati - Red–black tree - Document - PDFSEARCH.IO

First Page	Meta Content
	ACM Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA), October[removed]Efficient Software Model Checking of Data Structure Properties Paul T. Darga Chandrasekhar Boyapati Add to Reading List Document Date: 2008-09-12 18:54:00 Open Document File Size: 375,68 KB Share Result on Facebook City Portland / / Country United States / / Currency USD / / / Facility Computer Science Department University of Michigan / / IndustryTerm space management / glass box search algorithm / search progresses / above search / software model checkers / search trees / software verification techniques / software model checking / search space / search algorithm / / Organization University of Michigan / Ann Arbor / / Person Node / Checking / Paul T. Darga Chandrasekhar Boyapati / / / Position N2 head / Languages Keywords Software Model / Verifying Programs General / Private / Field operation head / programmer / head / / ProgrammingLanguage Java / / ProvinceOrState Oregon / / Technology Object-Oriented Programming / glass box search algorithm / maximum Search Algorithm / search algorithm / java / / SocialTag Binary trees Tree traversal Model checking Red–black tree Binary decision diagram Linked list Stack Invariant Class invariant Graph theory

ACM Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA), October[removed]Efficient Software Model Checking of Data Structure Properties Paul T. Darga Chandrasekhar BoyapatiAdd to Reading List