The following pages link to Michael R. Laurence (Q624385):
Displaying 14 items.
- Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas (Q624386) (← links)
- Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas (Q649588) (← links)
- A unifying theory of control dependence and its application to arbitrary program structures (Q650921) (← links)
- Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time (Q875512) (← links)
- Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas (Q997992) (← links)
- Equivalence of conservative, free, linear program schemas is decidable (Q1853616) (← links)
- Completeness results for omega-regular algebras (Q2347912) (← links)
- The complexity of contract negotiation (Q2457671) (← links)
- On Completeness of Omega-Regular Algebras (Q2915143) (← links)
- Complexity of Data Dependence Problems for Program Schemas with Concurrency (Q2946663) (← links)
- Omega Algebras and Regular Equations (Q3007581) (← links)
- On the computational complexity of dynamic slicing problems for program schemas (Q3103616) (← links)
- A Generating Set for the Automorphism Group of a Graph Group (Q4864054) (← links)
- Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages (Q5410478) (← links)
