( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Automatic equivalence proofs for non-deterministic coalgebras.

, , , , , и . Sci. Comput. Program., 78 (9): 1324-1345 (2013)

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.

Dorel Banabic

Lucian Dorel Dulca

Dorel Gușat

Érik Martin-Dorel

 

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

Automating Coinduction with Case Analysis., , и . ICFEM, том 6447 из Lecture Notes in Computer Science, стр. 220-236. Springer, (2010)Unification in Matching Logic., и . FM, том 11800 из Lecture Notes in Computer Science, стр. 502-518. Springer, (2019)Relaxed models for rewriting logic.. Theor. Comput. Sci., 290 (1): 265-289 (2003)Operationally-based program equivalence proofs using LCTRSs., , и . J. Log. Algebraic Methods Program., (октября 2023)Proof-Carrying Parameters in Certified Symbolic Execution: The Case Study of Antiunification., и . FROM, том 369 из EPTCS, стр. 1-16. (2022)Matching-Logic-Based Understanding of Polynomial Functors and their Initial/Final Models.. FROM, том 389 из EPTCS, стр. 41-55. (2023)Semantic Web Languages - Towards an Institutional Perspective., , и . Essays Dedicated to Joseph A. Goguen, том 4060 из Lecture Notes in Computer Science, стр. 99-123. Springer, (2006)Specification and Verification of Synchronizing Concurrent Objects., и . IFM, том 2999 из Lecture Notes in Computer Science, стр. 307-327. Springer, (2004)Patterns for Maude Metalanguage Applications., , , , и . WRLA, том 238 из Electronic Notes in Theoretical Computer Science, стр. 121-138. Elsevier, (2008)Path Directed Symbolic Execution in the K Framework., , и . SYNASC, стр. 133-141. IEEE Computer Society, (2010)