The following pages link to Fred Mesnard (Q714503):
Displaying 22 items.
- A new look at the automatic synthesis of linear ranking functions (Q714505) (← links)
- An SMT-based concolic testing tool for logic programs (Q2039953) (← links)
- A second-order formulation of non-termination (Q2353638) (← links)
- On the completeness of selective unification in concolic testing of logic programs (Q2409737) (← links)
- Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs (Q3522065) (← links)
- A non-termination criterion for binary constraint logic programs (Q3621267) (← links)
- (Q4218865) (← links)
- CLP(χ) for automatically proving program properties1An earlier version of this paper was presented at the workshop “Frontiers of Combining Systems”, Munich, March 1996.1 (Q4245935) (← links)
- (Q4385452) (← links)
- (Q4411982) (← links)
- Concolic testing in logic programming (Q4593010) (← links)
- cTI: a constraint-based termination inference tool for ISO-Prolog (Q4673545) (← links)
- Computing convex hulls with a linear solver (Q4673547) (← links)
- (Q4779112) (← links)
- (Q4939272) (← links)
- Selective Unification in (Constraint) Logic Programming* (Q4988929) (← links)
- Concolic Testing in CLP (Q5140007) (← links)
- Logic Programming (Q5191484) (← links)
- On proving left termination of constraint logic programs (Q5267429) (← links)
- Recurrence with affine level mappings is P-time decidable for CLP (Q5437651) (← links)
- On Termination of Binary CLP Programs (Q5458805) (← links)
- Static Analysis (Q5466573) (← links)
