Pages that link to "Item:Q1107510"

The following pages link to The addition of bounded quantification and partial functions to a computational logic and its theorem prover (Q1107510):

Displayed 7 items.

• Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks (Q437040) ‎ (← links)
• A verification system for concurrent programs based on the Boyer-Moore prover (Q1203115) ‎ (← links)
• On proving the termination of algorithms by machine (Q1341666) ‎ (← links)
• Milestones from the Pure Lisp Theorem Prover to ACL2 (Q2280212) ‎ (← links)
• Limited second-order functionality in a first-order setting (Q2303245) ‎ (← links)
• Programmed Strategies for Program Verification (Q2864527) ‎ (← links)
• Termination analysis for partial functions (Q5030190) ‎ (← links)