( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the computational complexity of dynamic slicing problems for program schemas.

, , и . Math. Struct. Comput. Sci., 21 (6): 1339-1362 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Laurence Lapopin

Laurence Germond

Laurence Vidrascu

Laurence Clark

Laurence Dunn

 

Другие публикации лиц с тем же именем

Complexity of Data Dependence Problems for Program Schemas with Concurrency., , и . ACM Trans. Comput. Log., 13 (2): 15:1-15:18 (2012)On the computational complexity of dynamic slicing problems for program schemas., , и . CoRR, (2017)Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas., , и . J. Log. Algebraic Methods Program., 80 (8): 481-496 (2011)Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas., , и . J. Log. Algebraic Methods Program., 80 (2): 92-112 (2011)On the computational complexity of dynamic slicing problems for program schemas., , и . Math. Struct. Comput. Sci., 21 (6): 1339-1362 (2011)Static Backward Slicing of Non-deterministic Programs and Systems., и . ACM Trans. Program. Lang. Syst., 40 (3): 11:1-11:46 (2018)Omega Algebras and Regular Equations., и . RAMiCS, том 6663 из Lecture Notes in Computer Science, стр. 248-263. Springer, (2011)Complexity of Data Dependence problems for Program Schemas with Concurrency, , и . CoRR, (2010)On Completeness of Omega-Regular Algebras., и . RAMiCS, том 7560 из Lecture Notes in Computer Science, стр. 179-194. Springer, (2012)Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages., и . RAMiCS, том 8428 из Lecture Notes in Computer Science, стр. 65-82. Springer, (2014)