default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarlos E. Budde
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]Gabriel Dengler
, Laura Carnevali, Carlos E. Budde, Enrico Vicario:
Transient Evaluation of Non-Markovian Models by Stochastic State Classes and Simulation. QEST+FORMATS 2024: 213-232- [i9]Ranindya Paramitha, Yuan Feng, Fabio Massacci, Carlos E. Budde:
Cross-ecosystem categorization: A manual-curation protocol for the categorization of Java Maven libraries along Python PyPI Topics. CoRR abs/2403.06300 (2024) - [i8]Roman Andriushchenko, Alexander Bork, Carlos E. Budde, Milan Ceska, Kush Grover, Ernst Moritz Hahn, Arnd Hartmanns, Bryant Israelsen, Nils Jansen, Joshua Jeppson, Sebastian Junges, Maximilian A. Köhl, Bettina Könighofer, Jan Kretínský, Tobias Meggendorfer, David Parker, Stefan Pranger, Tim Quatmann, Enno Ruijters, Landon Taylor, Matthias Volk, Maximilian Weininger, Zhen Zhang:
Tools at the Frontiers of Quantitative Verification. CoRR abs/2405.13583 (2024) - [i7]Gabriel Dengler, Laura Carnevali, Carlos E. Budde, Enrico Vicario:
Transient Evaluation of Non-Markovian Models by Stochastic State Classes and Simulation. CoRR abs/2406.16447 (2024) - 2023
- [j6]Carlos E. Budde, Anni Karinsalo, Silvia Vidor, Jarno Salonen, Fabio Massacci:
Consolidating cybersecurity in Europe: A case study on job profiles assessment. Comput. Secur. 127: 103082 (2023) - [j5]Milan Lopuhaä-Zwakenberg, Carlos E. Budde, Mariëlle Stoelinga:
Efficient and Generic Algorithms for Quantitative Attack Tree Analysis. IEEE Trans. Dependable Secur. Comput. 20(5): 4169-4187 (2023) - 2022
- [j4]Carlos E. Budde:
FIG: the Finite Improbability Generator v1.3. SIGMETRICS Perform. Evaluation Rev. 49(4): 59-64 (2022) - [j3]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) - [c22]Carlos E. Budde:
Using Statistical Model Checking for Cybersecurity Analysis. CyberSec4Europe 2022: 16-32 - [c21]Silvia Vidor, Carlos E. Budde:
A Maturity Assessment Model for Cyber Security Education in Europe. World Conference on Information Security Education 2022: 60-74 - [c20]Carlos E. Budde, Duncan Jansen, Inka L. M. Locht, Mariëlle Stoelinga:
Learning to Learn HVAC Failures: Layering ML Experiments in the Absence of Ground Truth. RSSRail 2022: 95-111 - [i6]Bart Verkuil, Carlos E. Budde, Doina Bucur:
Automated fault tree learning from continuous-valued sensor data: a case study on domestic heaters. CoRR abs/2203.07374 (2022) - [i5]Milan Lopuhaä-Zwakenberg, Carlos E. Budde, Mariëlle Stoelinga:
Efficient and Generic Algorithms for Quantitative Attack Tree Analysis. CoRR abs/2212.05358 (2022) - 2021
- [c19]Carlos E. Budde, Mariëlle Stoelinga:
Efficient Algorithms for Quantitative Attack Tree Analysis. CSF 2021: 1-15 - [c18]Carlos E. Budde, Christina Kolb, Mariëlle Stoelinga:
Attack Trees vs. Fault Trees: Two Sides of the Same Coin from Different Currencies. QEST 2021: 457-467 - [c17]Mariëlle Stoelinga, Christina Kolb, Stefano M. Nicoletti, Carlos E. Budde, Ernst Moritz Hahn:
The Marriage Between Safety and Cybersecurity: Still Practicing. SPIN 2021: 3-21 - [c16]Carlos E. Budde, Arnd Hartmanns:
Replicating sc Restart with Prolonged Retrials: An Experimental Report. TACAS (2) 2021: 373-380 - [i4]Carlos E. Budde, Mariëlle Stoelinga:
Efficient Algorithms for Quantitative Attack Tree Analysis. CoRR abs/2105.07511 (2021) - 2020
- [j2]Carlos E. Budde, Pedro R. D'Argenio, Arnd Hartmanns, Sean Sedwards:
An efficient statistical model checker for nondeterminism and rare events. Int. J. Softw. Tools Technol. Transf. 22(6): 759-780 (2020) - [c15]Jaime Arias, Carlos E. Budde, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk, Mariëlle Stoelinga:
Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-agent Systems. ICFEM 2020: 3-19 - [c14]Carlos E. Budde, Arnd Hartmanns, Michaela Klauck, Jan Kretínský, David Parker, Tim Quatmann, Andrea Turrini, Zhen Zhang:
On Correctness, Precision, and Performance in Quantitative Verification - QComp 2020 Competition Report. ISoLA (4) 2020: 216-241 - [c13]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 - [c12]Carlos E. Budde, Mariëlle Stoelinga:
Automated Rare Event Simulation for Fault Tree Analysis via Minimal Cut Sets. MMB 2020: 259-277 - [c11]Carlos E. Budde, Enno Ruijters, Mariëlle Stoelinga:
The Dynamic Fault Tree Rare Event Simulator. QEST 2020: 233-238 - [c10]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 - [c9]Carlos E. Budde:
FIG: The Finite Improbability Generator. TACAS (1) 2020: 483-491
2010 – 2019
- 2019
- [j1]Carlos E. Budde, Pedro R. D'Argenio, Arnd Hartmanns:
Automated compositional importance splitting. Sci. Comput. Program. 174: 90-108 (2019) - [i3]Jaime Arias, Carlos E. Budde, Wojciech Penczek, Laure Petrucci, Mariëlle Stoelinga:
Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-Agent Systems. CoRR abs/1906.05283 (2019) - [i2]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) - [i1]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
- [c8]Alessandro Abate, Carlos E. Budde, Nathalie Cauchi, Arnaud van Harmelen, Khaza Anuarul Hoque, Mariëlle Stoelinga:
Modelling Smart Buildings Using Fault Maintenance Trees. EPEW 2018: 110-125 - [c7]Carlos E. Budde, Pedro R. D'Argenio, Arnd Hartmanns, Sean Sedwards:
A Statistical Model Checker for Nondeterminism and Rare Events. TACAS (2) 2018: 340-358 - 2017
- [c6]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 - [c5]Carlos E. Budde, Pedro R. D'Argenio, Arnd Hartmanns:
Better Automated Importance Splitting for Transient Rare Events. SETTA 2017: 42-58 - [c4]Carlos E. Budde, Christian Dehnert, Ernst Moritz Hahn, Arnd Hartmanns, Sebastian Junges, Andrea Turrini:
JANI: Quantitative Model and Tool Interaction. TACAS (2) 2017: 151-168 - 2016
- [c3]Carlos E. Budde, Pedro R. D'Argenio, Raúl E. Monti:
Compositional Construction of Importance Functions in Fully Automated Importance Splitting. VALUETOOLS 2016 - 2015
- [c2]Carlos E. Budde, Pedro R. D'Argenio, Holger Hermanns:
Rare Event Simulation with Fully Automated Importance Splitting. EPEW 2015: 275-290 - 2012
- [c1]Carlos E. Budde, Pedro R. D'Argenio, Pedro Sánchez Terraf, Nicolás Wolovick:
A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems. ROCKS 2012: 67-86
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-10-07 21:25 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:
