default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaúl E. Monti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Philip Tasche
, Raúl E. Monti, Stefanie Eva Drerup, Pauline Blohm, Paula Herber, Marieke Huisman:
Deductive Verification of Parameterized Embedded Systems Modeled in SystemC. VMCAI (2) 2024: 187-209- 2022
- [j1]Carlos E. Budde, Pedro R. D'Argenio, Raúl E. Monti, Mariëlle Stoelinga:
Analysis of non-Markovian repairable fault trees through rare event simulation. Int. J. Softw. Tools Technol. Transf. 24(5): 821-841 (2022) - [c10]Marieke Huisman, Raúl E. Monti:
Teaching Design by Contract Using Snap! The Logic of Software. A Tasting Menu of Formal Methods 2022: 243-263 - [c9]Raúl E. Monti, Robert Rubbens, Marieke Huisman:
On Deductive Verification of an Industrial Concurrent Software Component with VerCors. ISoLA (1) 2022: 517-534 - 2021
- [c8]Marieke Huisman, Raúl E. Monti:
Teaching Design by Contract using Snap! SEENG@ICSE 2021: 1-5 - [i4]Marieke Huisman, Raúl E. Monti:
Teaching Design by Contract using Snap! CoRR abs/2107.05679 (2021) - 2020
- [c7]Marieke Huisman, Raúl E. Monti:
On the Industrial Application of Critical Software Verification with VerCors. ISoLA (3) 2020: 273-292 - [c6]Raúl E. Monti, Carlos E. Budde, Pedro R. D'Argenio:
A compositional semantics for Repairable Fault Trees with general distributions. LPAR 2020: 354-372 - [c5]Carlos E. Budde, Marco Biagi, Raúl E. Monti, Pedro R. D'Argenio, Mariëlle Stoelinga:
Rare Event Simulation for Non-Markovian Repairable Fault Trees. TACAS (1) 2020: 463-482 - [p1]Marieke Huisman, Raúl E. Monti, Mattias Ulbrich, Alexander Weigl:
The VerifyThis Collaborative Long Term Challenge. 20 Years of KeY 2020: 246-260
2010 – 2019
- 2019
- [i3]Raúl E. Monti, Pedro R. D'Argenio, Carlos E. Budde:
A compositional semantics for Repairable Fault Trees with general distributions. CoRR abs/1910.10507 (2019) - [i2]Carlos E. Budde, Marco Biagi, Raúl E. Monti, Pedro R. D'Argenio, Mariëlle Stoelinga:
Rare Event Simulation for non-Markovian repairable Fault Trees. CoRR abs/1910.11672 (2019) - 2018
- [c4]Pedro R. D'Argenio, Raúl E. Monti:
Input/Output Stochastic Automata with Urgency: Confluence and Weak Determinism. ICTAC 2018: 132-152 - [i1]Pedro R. D'Argenio, Raúl E. Monti:
Input/Output Stochastic Automata with Urgency: Confluence and weak determinism. CoRR abs/1808.02777 (2018) - 2017
- [c3]Pedro R. D'Argenio, Carlos E. Budde, Matias David Lee, Raúl E. Monti, Leonardo Rodríguez, Nicolás Wolovick:
The Road from Stochastic Automata to the Simulation of Rare Events. ModelEd, TestEd, TrustEd 2017: 276-294 - 2016
- [c2]Pedro R. D'Argenio, Matias David Lee, Raúl E. Monti:
Input/Output Stochastic Automata - Compositionality and Determinism. FORMATS 2016: 53-68 - [c1]Carlos E. Budde, Pedro R. D'Argenio, Raúl E. Monti:
Compositional Construction of Importance Functions in Fully Automated Importance Splitting. VALUETOOLS 2016
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-04-25 05:50 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:
