( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A language-independent proof system for full program equivalence.

, , , и . Formal Asp. Comput., 28 (3): 469-497 (2016)

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.

Vlad Manilici

Flow-based routing in community networks. TU Berlin, (2009)

Vlad Rojanschi

Julia Vlad

Laura Rusu

Mihaela Rusu

 

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

Embedding domain-specific modelling languages in maude specifications.. ACM SIGSOFT Softw. Eng. Notes, 36 (1): 1-8 (2011)Verifying Periodic Task-Control Systems.. HART, том 1201 из Lecture Notes in Computer Science, стр. 63-68. Springer, (1997)Uniformity for the Decidability of Hybrid Automata., и . SAS, том 1145 из Lecture Notes in Computer Science, стр. 301-316. Springer, (1996)Proving partial-correctness and invariance properties of transition-system models., , и . Sci. Comput. Program., (2020)Symbolic Determinisation of Extended Automata., , и . IFIP TCS, том 209 из IFIP, стр. 197-212. Springer, (2006)Ensuring the conformance of reactive discrete-event systems using supervisory control., , , и . CDC, стр. 2692-2697. IEEE, (2003)Symbolic execution based on language transformation., , и . Comput. Lang. Syst. Struct., (2015)Task-System Analysis Using Slope-Parametric Hybrid Automata., и . Euro-Par, том 1300 из Lecture Notes in Computer Science, стр. 1262-1273. Springer, (1997)Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant., , , и . FLOPS, том 3945 из Lecture Notes in Computer Science, стр. 114-129. Springer, (2006)On Proving Safety Properties by Integrating Static Analysis, Theorem Proving and Abstraction., и . TACAS, том 1579 из Lecture Notes in Computer Science, стр. 178-192. Springer, (1999)