The following pages link to Ben Wegbreit (Q1218291):
Displaying 19 items.
- Retrieval from context trees (Q1218292) (← links)
- The verification and synthesis of data structures (Q1844075) (← links)
- A generator of context-sensitive languages (Q2542287) (← links)
- Time- and tape-bounded Turing acceptors and AFLs (Q2542726) (← links)
- Tape-bounded Turing acceptors and principal AFLs (Q2542727) (← links)
- Mechanical program analysis (Q4062612) (← links)
- A Model for Control Structures for Artificial Intelligence Programming Languages (Q4088254) (← links)
- Proving Properties of Complex Data Structures (Q4091436) (← links)
- Verifying Program Performance (Q4099190) (← links)
- Faster retrieval from context trees (Q4099201) (← links)
- Subgoal induction (Q4120116) (← links)
- Goal-Directed Program Transformation (Q4122771) (← links)
- (Q4130970) (← links)
- Complexity of Synthesizing Inductive Assertions (Q4130972) (← links)
- Constructive Methods in Program Verification (Q4139639) (← links)
- The treatment of data types in EL1 (Q4401557) (← links)
- The synthesis of loop predicates (Q5180828) (← links)
- Procedure closure in EL1 (Q5180835) (← links)
- A note on AFLs and bounded erasing (Q5647880) (← links)
