The following pages link to Maria Chiara Meo (Q388221):
Displayed 32 items.
- The expressive power of CHR with priorities (Q388222) (← links)
- Exploiting linearity in sharing analysis of object-oriented programs (Q737080) (← links)
- Item:Q388221 (redirect page) (← links)
- Differential logic programs: Programming methodologies and semantics (Q1126260) (← links)
- Compositionality properties of SLD-derivations (Q1274454) (← links)
- A compositional semantics for logic programs (Q1314414) (← links)
- Descending chains and narrowing on template abstract domains (Q1671249) (← links)
- A timed concurrent constraint language. (Q1854359) (← links)
- A theory of observables for logic programs (Q1854446) (← links)
- Observable behaviors and equivalences of logic programs (Q1900312) (← links)
- On collecting semantics for program analysis (Q2182314) (← links)
- Verification of time-aware business processes using constrained Horn clauses (Q2409725) (← links)
- A compositional semantics for CHR (Q2946569) (← links)
- On the Expressive Power of Multiple Heads in CHR (Q2946654) (← links)
- Theoretical Foundations and Semantics of Logic Programming (Q3578389) (← links)
- Decidability properties for fragments of CHR (Q3585171) (← links)
- Expressiveness of Multiple Heads in CHR (Q3599074) (← links)
- A Compositional Semantics for CHR with Propagation Rules (Q3616886) (← links)
- (Q4221353) (← links)
- Unfolding for CHR programs (Q4592981) (← links)
- Timed soft concurrent constraint programs: An interleaved and a parallel approach (Q4593013) (← links)
- (Q4681453) (← links)
- Abstract diagnosis (Q4700386) (← links)
- (Q4738216) (← links)
- Resultant semantics for prolog (Q4895546) (← links)
- (Q4954441) (← links)
- The role of linearity in sharing analysis (Q5055490) (← links)
- Narrowing Operators on Template Abstract Domains (Q5206948) (← links)
- Proving correctness of timed concurrent constraint programs (Q5277712) (← links)
- Semantics and Controllability of Time-Aware Business Processes* (Q5377319) (← links)
- (Q5688899) (← links)
- Timed concurrent language for argumentation with maximum parallelism (Q6162115) (← links)