Pages that link to "Item:Q5408403"

The following pages link to A type-directed abstraction refinement approach to higher-order model checking (Q5408403):

Displaying 24 items.

• Counterexample-guided partial bounding for recursive function synthesis (Q832233) (← links)
• Equivalence-based abstraction refinement for \(\mu \)HORS model checking (Q1990515) (← links)
• Local higher-order fixpoint iteration (Q2105477) (← links)
• Typestate verification: abstraction techniques and complexity results (Q2568446) (← links)
• Horn Clause Solvers for Program Verification (Q2947164) (← links)
• Typing Weak MSOL Properties (Q2949449) (← links)
• Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence (Q2988360) (← links)
• Higher-Order Model Checking in Direct Style (Q3179299) (← links)
• Recursion Schemes and the WMSO+U Logic (Q3304152) (← links)
• (Q4625705) (← links)
• Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems (Q5005159) (← links)
• (Q5021005) (← links)
• (Q5076057) (← links)
• (Q5109508) (← links)
• Streett Automata Model Checking of Higher-Order Recursion Schemes (Q5111330) (← links)
• (Q5129945) (← links)
• The Complexity of the Diagonal Problem for Recursion Schemes (Q5136337) (← links)
• Automata, Logic and Games for the $$\lambda $$ -Calculus (Q5224488) (← links)
• Programming Languages and Systems (Q5316577) (← links)
• Model Checking Software (Q5899034) (← links)
• Cost Automata, Safe Schemes, and Downward Closures (Q6044492) (← links)
• A temporal logic for higher-order functional programs (Q6536300) (← links)
• A type-based HFL model checking algorithm (Q6536312) (← links)
• Partial bounding for recursive function synthesis (Q6632203) (← links)