default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVlad Rusu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Horatiu Cheval, David Nowak, Vlad Rusu
:
Formal definitions and proofs for partial (co)recursive functions. J. Log. Algebraic Methods Program. 141: 100999 (2024)- 2023
- [c43]David Nowak, Vlad Rusu:
While Loops in Coq. FROM 2023: 96-109 - 2022
- [j20]Vlad Rusu, David Nowak:
Defining Corecursive Functions in Coq Using Approximations (Artifact). Dagstuhl Artifacts Ser. 8(2): 02:1-02:2 (2022) - [c42]Vlad Rusu, David Nowak:
Defining Corecursive Functions in Coq Using Approximations. ECOOP 2022: 12:1-12:24 - [c41]Florian Vanhems, Vlad Rusu, David Nowak, Gilles Grimaud:
A Formal Correctness Proof for an EDF Scheduler Implementation. RTAS 2022: 281-292 - [e3]Vlad Rusu:
Proceedings of the Sixth Working Formal Methods Symposium, FROM 2022, "Al. I. Cuza University", Iasi, Romania, 19-20 September, 2022. EPTCS 369, 2022 [contents] - 2021
- [j19]Vlad Rusu, David Nowak:
(Co)inductive proof systems for compositional proofs in reachability logic. J. Log. Algebraic Methods Program. 118: 100619 (2021) - [j18]Vlad Rusu:
Guest Editor's foreword. J. Log. Algebraic Methods Program. 123: 100716 (2021) - 2020
- [j17]Vlad Rusu, Gilles Grimaud, Michaël Hauspie:
Proving partial-correctness and invariance properties of transition-system models. Sci. Comput. Program. 186 (2020)
2010 – 2019
- 2019
- [c40]Vlad Rusu, David Nowak:
(Co)inductive Proof Systems for Compositional Proofs in Reachability Logic. FROM 2019: 32-47 - 2018
- [c39]Vlad Rusu, Gilles Grimaud, Michaël Hauspie:
Proving Partial-Correctness and Invariance Properties of Transition-System Models. TASE 2018: 60-67 - [e2]Vlad Rusu:
Rewriting Logic and Its Applications - 12th International Workshop, WRLA 2018, Held as a Satellite Event of ETAPS, Thessaloniki, Greece, June 14-15, 2018, Proceedings. Lecture Notes in Computer Science 11152, Springer 2018, ISBN 978-3-319-99839-8 [contents] - 2017
- [j16]Vlad Rusu, Andrei Arusoaie:
Executing and verifying higher-order functional-imperative programs in Maude. J. Log. Algebraic Methods Program. 93: 68-91 (2017) - [j15]Dorel Lucanu, Vlad Rusu, Andrei Arusoaie:
A generic framework for symbolic execution: A coinductive approach. J. Symb. Comput. 80: 125-163 (2017) - [c38]Andrei Arusoaie, David Nowak, Vlad Rusu, Dorel Lucanu:
A Certified Procedure for RL Verification. SYNASC 2017: 129-136 - 2016
- [j14]Stefan Ciobaca, Dorel Lucanu, Vlad Rusu, Grigore Rosu:
A language-independent proof system for full program equivalence. Formal Aspects Comput. 28(3): 469-497 (2016) - [j13]Vlad Rusu, Dorel Lucanu, Traian-Florin Serbanuta, Andrei Arusoaie, Andrei Stefanescu, Grigore Rosu:
Language definitions as rewrite theories. J. Log. Algebraic Methods Program. 85(1): 98-120 (2016) - [c37]Vlad Rusu, Andrei Arusoaie:
Proving Reachability-Logic Formulas Incrementally. WRLA 2016: 134-151 - 2015
- [j12]Andrei Arusoaie, Dorel Lucanu, Vlad Rusu:
Symbolic execution based on language transformation. Comput. Lang. Syst. Struct. 44: 48-71 (2015) - [j11]Dorel Lucanu, Vlad Rusu:
Program equivalence by circular reasoning. Formal Aspects Comput. 27(4): 701-726 (2015) - [c36]Dorel Lucanu, Vlad Rusu, Andrei Arusoaie, David Nowak:
Verifying Reachability-Logic Properties on Rewriting-Logic Specifications. Logic, Rewriting, and Concurrency 2015: 451-474 - 2014
- [c35]Stefan Ciobaca, Dorel Lucanu, Vlad Rusu, Grigore Rosu:
A Language-Independent Proof System for Mutual Program Equivalence. ICFEM 2014: 75-90 - [c34]Stefan Ciobaca, Dorel Lucanu, Vlad Rusu, Grigore Rosu:
A Theoretical Foundation for Programming Languages Aggregation. WADT 2014: 30-47 - [c33]Andrei Arusoaie, Dorel Lucanu, Vlad Rusu, Traian-Florin Serbanuta, Andrei Stefanescu, Grigore Rosu:
Language Definitions as Rewrite Theories. WRLA 2014: 97-112 - 2013
- [j10]Vlad Rusu:
Embedding domain-specific modelling languages in Maude specifications. Softw. Syst. Model. 12(4): 847-869 (2013) - [c32]Dorel Lucanu, Vlad Rusu:
Program Equivalence by Circular Reasoning. IFM 2013: 362-377 - [c31]Andrei Arusoaie, Dorel Lucanu, Vlad Rusu:
A Generic Framework for Symbolic Execution. SLE 2013: 281-301 - 2011
- [j9]Vlad Rusu:
Embedding domain-specific modelling languages in maude specifications. ACM SIGSOFT Softw. Eng. Notes 36(1): 1-8 (2011) - [c30]Benoît Combemale, Laure Gonnord, Vlad Rusu:
A Generic Tool for Tracing Executions Back to a DSML's Operational Semantics. ECMFA 2011: 35-51 - [c29]Vlad Rusu, Dorel Lucanu:
A K-Based Formal Framework for Domain-Specific Modelling Languages. FoVeOOS 2011: 214-231 - [c28]Andrei Arusoaie, Dorel Lucanu, Vlad Rusu:
Towards a K Semantics for OCL. K 2011: 81-96 - [e1]Francisco Durán, Vlad Rusu:
Proceedings Second International Workshop on Algebraic Methods in Model-based Software Engineering, AMMSE 2011, Zurich, Switzerland, 30th June 2011. EPTCS 56, 2011 [contents] - 2010
- [j8]Marina Egea, Vlad Rusu:
Formal executable semantics for conformance in the MDE framework. Innov. Syst. Softw. Eng. 6(1-2): 73-81 (2010) - [j7]Thomas Genet, Vlad Rusu:
Equational approximations for tree automata completion. J. Symb. Comput. 45(5): 574-597 (2010) - [c27]Abdoulaye Gamatié, Vlad Rusu, Éric Rutten:
Operational Semantics of the Marte Repetitive Structure Modeling Concepts for Data-Parallel Applications Design. ISPDC 2010: 25-32 - [c26]Vlad Rusu:
Combining Theorem Proving and Narrowing for Rewriting-Logic Specifications. TAP@TOOLS 2010: 135-150
2000 – 2009
- 2009
- [j6]Vlad Rusu, Manuel Clavel:
Vérification d'invariants pour des systèmes spécifiés en logique de réécriture. Stud. Inform. Univ. 7(2): 83-112 (2009) - [c25]Vlad Rusu, Manuel Clavel:
Vérification d'invariants pour des systèmes spécifiés en logique de réécriture. JFLA 2009: 317-350 - 2007
- [j5]Camille Constant, Thierry Jéron, Hervé Marchand, Vlad Rusu:
Integrating formal verification and conformance testing for reactive systems. IEEE Trans. Software Eng. 33(8): 558-574 (2007) - [c24]Martijn Oostdijk, Vlad Rusu, Jan Tretmans, René G. de Vries, Tim A. C. Willemse:
Integrating Verification, Testing, and Learning for Cryptographic Protocols. IFM 2007: 538-557 - 2006
- [j4]Vlad Rusu:
Verifying an ATM Protocol Using a Combination of Formal Techniques. Comput. J. 49(6): 710-730 (2006) - [c23]Gilles Barthe, Julien Forest, David Pichardie, Vlad Rusu:
Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant. FLOPS 2006: 114-129 - [c22]Bertrand Jeannet, Thierry Jéron, Vlad Rusu:
Model-Based Test Selection for Infinite-State Reactive Systems. FMCO 2006: 47-69 - [c21]Thierry Jéron, Hervé Marchand, Vlad Rusu:
Symbolic Determinisation of Extended Automata. IFIP TCS 2006: 197-212 - 2005
- [j3]David Cachera, Thomas P. Jensen, David Pichardie, Vlad Rusu:
Extracting a data flow analyser in constructive logic. Theor. Comput. Sci. 342(1): 56-78 (2005) - [c20]Vlad Rusu, Hervé Marchand, Thierry Jéron:
Automatic Verification and Conformance Testing for Validating Safety Properties of Reactive Systems. FM 2005: 189-204 - [c19]Bertrand Jeannet, Thierry Jéron, Vlad Rusu, Elena Zinovieva:
Symbolic Test Selection Based on Approximate Analysis. TACAS 2005: 349-364 - 2004
- [c18]David Cachera, Thomas P. Jensen, David Pichardie, Vlad Rusu:
Extracting a Data Flow Analyser in Constructive Logic. ESOP 2004: 385-400 - [c17]Vlad Rusu, Hervé Marchand, Valéry Tschaen, Thierry Jéron, Bertrand Jeannet:
From Safety Verification to Safety Testing. TestCom 2004: 160-176 - 2003
- [j2]Vlad Rusu:
Combining formal verification and conformance testing for validating reactive systems. Softw. Test. Verification Reliab. 13(3): 157-180 (2003) - [c16]Thieny Eron, Hervé Marchand, Vlad Rusu, Valéry Tschaen:
Ensuring the conformance of reactive discrete-event systems using supervisory control. CDC 2003: 2692-2697 - [c15]Vlad Rusu:
Compositional Verification of an ATM Protocol. FME 2003: 223-243 - 2002
- [c14]Vlad Rusu:
Verification Using Test Generation Techniques. FME 2002: 252-271 - [c13]Duncan Clarke, Thierry Jéron, Vlad Rusu, Elena Zinovieva:
STG: A Symbolic Test Generation Tool. TACAS 2002: 470-475 - 2001
- [c12]Duncan Clarke, Thierry Jéron, Vlad Rusu, Elena Zinovieva:
Automated Test and Oracle Generation for Smart-Card Applications. E-smart 2001: 58-70 - [c11]Vlad Rusu:
Verifying a Sliding Window Protocol using PVS. FORTE 2001: 251-268 - [c10]Duncan Clarke, Thierry Jéron, Vlad Rusu, Elena Zinovieva:
STG: a tool for generating symbolic test programs and oracles from operational specifications. ESEC / SIGSOFT FSE 2001: 301-302 - [c9]Vlad Rusu, Elena Zinovieva:
Analyzing Automata with Presburger Arithmetic and Uninterpreted Function Symbols. VEPAS 2001: 327-341 - 2000
- [c8]Vlad Rusu, Lydie du Bousquet, Thierry Jéron:
An Approach to Symbolic Test Generation. IFM 2000: 338-357
1990 – 1999
- 1999
- [j1]Olivier F. Roux, Vlad Rusu, Franck Cassez:
Hybrid Verifications of Reactive Programs. Formal Aspects Comput. 11(4): 448-471 (1999) - [c7]Vlad Rusu, Eli Singerman:
On Proving Safety Properties by Integrating Static Analysis, Theorem Proving and Abstraction. TACAS 1999: 178-192 - 1998
- [c6]Thomas A. Henzinger, Vlad Rusu:
Reachability Verification for Hybrid Automata. HSCC 1998: 190-204 - 1997
- [c5]Augusto Burgueño, Vlad Rusu:
Task-System Analysis Using Slope-Parametric Hybrid Automata. Euro-Par 1997: 1262-1273 - [c4]Vlad Rusu:
Verifying Periodic Task-Control Systems. HART 1997: 63-68 - [c3]Frédéric Boniol, Augusto Burgueño, Olivier F. Roux, Vlad Rusu:
Analysis of Slope-Parametric Hybrid Automata. HART 1997: 75-80 - 1996
- [c2]Olivier F. Roux, Vlad Rusu:
Uniformity for the Decidability of Hybrid Automata. SAS 1996: 301-316 - 1994
- [c1]Olivier F. Roux, Vlad Rusu:
Verifying Time-bounded Properties for ELECTRE Reactive Programs with Stopwatch Automata. Hybrid Systems 1994: 405-416
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
