( en | de | ru )

 

Disambiguation of "Lagoon, Vitaly"

Author of the publication

copydeleteadd this publication to your clipboard
Termination Analysis with Types Is More Accurate.

, , and . ICLP, volume 2916 of Lecture Notes in Computer Science, page 254-268. Springer, (2003)

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. You can also use the button next to the name to display some publications already assigned to the person.

Vitaly Raev

Vitaly Alexandrov

Vitaly Teterin

Vitaly Kozyura

Vitaly Belik

 

Other publications of authors with the same name

Sharing Analysis Using Set Logic Programs., , and . ICLP, page 417. MIT Press, (1997)Logic Programming with Satisfiability, , and . CoRR, (2007)The DNA Word Design Problem: A New Constraint Model and New Results., , and . IJCAI, page 585-591. ijcai.org, (2017)Telecommunications Feature Subscription as a Partial Order Constraint Problem., , and . ICLP, volume 5366 of Lecture Notes in Computer Science, page 749-753. Springer, (2008)Logic programming with satisfiability., , and . Theory Pract. Log. Program., 8 (1): 121-128 (2008)Solving Partial Order Constraints for LPO Termination., , and . RTA, volume 4098 of Lecture Notes in Computer Science, page 4-18. Springer, (2006)Size-Change Termination Analysis in k-Bits., , , and . ESOP, volume 3924 of Lecture Notes in Computer Science, page 230-245. Springer, (2006)Solving Partial Order Constraints for LPO Termination., , and . J. Satisf. Boolean Model. Comput., 5 (1-4): 193-215 (2008)Testing for Termination with Monotonicity Constraints., , and . ICLP, volume 3668 of Lecture Notes in Computer Science, page 326-340. Springer, (2005)Termination Analysis with Types Is More Accurate., , and . ICLP, volume 2916 of Lecture Notes in Computer Science, page 254-268. Springer, (2003)