( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
BHDL: Circuit Design in B.

, , , , и . ACSD, стр. 241-242. IEEE Computer Society, (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.

Philippe Kersting

Philippe Bopp

Philippe Moisan

Philippe Zysset

Philippe Dreuw

 

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

The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable., , и . ILPS, стр. 250-265. MIT Press, (1993)Prolog Program Transformations and Meta-Interpreters., , и . LOPSTR, стр. 238-251. Springer, (1991)Solving Classes of Set Constraints with Tree Automata., , и . CP, том 1330 из Lecture Notes in Computer Science, стр. 62-76. Springer, (1997)Halting Problem of One Binary Horn Clause id Undecidable., , и . Structural Complexity and Recursion-theoretic methods in Logic-Programming, стр. 5-14. Mathematical Sciences Institute, Cornell University, (1992)Weighted Systems Revisited., , и . WSA, том 81-82 из Series Bigre, стр. 163-173. Atelier Irisa, IRISA, Campus de Beaulieu, (1992)WEIGHTED GRAPHS, A Tool for Expressing the Behavious of Recursive Rules in Logic Programming.. FGCS, стр. 397-404. OHMSHA Ltd. Tokyo and Springer-Verlag, (1988)BHDL: Circuit Design in B., , , , и . ACSD, стр. 241-242. IEEE Computer Society, (2003)Co-Design and Refinement for Safety Critical Systems., и . DFT, стр. 78-86. IEEE Computer Society, (2004)Une analyse du comportement récursif de programmes Prolog par une interprétation abstraite., , и . JTASPEFT/WSA, том 74 из Series Bigre, стр. 62-69. Atelier Irisa, IRISA, Campus de Beaulieu, (1991)Termination induction by means of an abstract OLDT resolution., , и . JFPL, стр. 353-373. (1992)