The following publications are possibly variants of this publication:
- Proving Reachability-Logic Formulas IncrementallyVlad Rusu, Andrei Arosoaie. 2016:
- Proving Reachability-Logic Formulas IncrementallyVlad Rusu, Andrei Arusoaie. WRLA 2016: 134-151 [doi]
- Proving Partial-Correctness and Invariance Properties of Transition-System ModelsVlad Rusu, Gilles Grimaud, Michaël Hauspie. In TASE 2018 - 12th International Symposium on Theoretical Aspects of Software Engineering. 2018:
- Proving Partial-Correctness and Invariance Properties of Transition-System ModelsVlad Rusu, Gilles Grimaud, Michaël Hauspie. SCP, 186, 2020. [doi]
- (Co)inductive Proof Systems for Compositional Proofs in Reachability LogicVlad Rusu, David Nowak. In Proceedings Third Symposium on Working Formal Methods, Electronic Proceeding in Theoretical Computer Science 303. 2019: 32-47 [doi]
- (Co)inductive Proof Systems for Compositional Proofs in Reachability LogicVlad Rusu, David Nowak. Journal of Logical and Algebraic Methods in Programming, , 2020.
- (Co)inductive Proof Systems for Compositional Proofs in Reachability LogicVlad Rusu, David Nowak. Preprint 2020.
- Verifying Reachability-Logic Properties on Rewriting-Logic SpecificationsDorel Lucanu, Vlad Rusu, Andrei Arusoaie, David Nowak. In Logic, Rewriting and Concurrency: Festschrift Symposium in Honor of José Meseguer. 2015:
- Verifying Reachability-Logic Properties on Rewriting-Logic SpecificationsAndrei Arusoaie, Dorel Lucanu, David Nowak, Vlad Rusu. Preprint 2015.
- Combining Theorem Proving and Narrowing for Rewriting-Logic SpecificationsVlad Rusu. tap 2010: 135-150 [doi]
- Verification d'invariants pour des systemes specifies en logique de reecritureVlad Rusu, Manuel Clavel. jfla 2009: 317-350