The following pages link to Joxan Jaffar (Q688822):
Displaying 23 items.
- Projecting CLP(\({\mathcal R}\)) constraints (Q688823) (← links)
- Semantics of infinite tree logic programming (Q1090469) (← links)
- Presburger arithmetic with array segments (Q1159191) (← links)
- Toward practical query evaluation for constraint databases (Q1378380) (← links)
- Model counting for recursively-defined strings (Q2164241) (← links)
- TRACER: A Symbolic Execution Tool for Verification (Q2903126) (← links)
- Minimal and complete word unification (Q3474892) (← links)
- A theory of complete logic programs with equality (Q3707362) (← links)
- Canonical logic programs (Q3721789) (← links)
- (Q3727354) (← links)
- Comments on “general failure of logic programs” (Q3729995) (← links)
- (Q3793766) (← links)
- The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1 (Q4245932) (← links)
- (Q4391452) (← links)
- (Q4473044) (← links)
- Shape Neutral Analysis of Graph-based Data-structures (Q4559807) (← links)
- Progressive Reasoning over Recursively-Defined Strings (Q4633536) (← links)
- A correctness proof of an indenting program (Q4742293) (← links)
- A framework for combining analysis and verification (Q5178839) (← links)
- Logic Programming (Q5475772) (← links)
- Logic Programming (Q5475796) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5898607) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5898624) (← links)
