default search action
Daniel Larraz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Robert Lorch
, Daniel Larraz
A Comprehensive, Automated Security Analysis of the Uptane Automotive Over-the-Air Update Framework. RAID 2024: 594-612 - 2023
- [c12]Daniel Larraz, Robert Lorch, Moosa Yahyazadeh, M. Fareed Arif, Omar Chowdhury, Cesare Tinelli:
CRV: Automated Cyber-Resiliency Reasoning for System Design Models. FMCAD 2023: 209-220 - 2022
- [i4]Daniel Larraz, Cesare Tinelli
Realizability Checking of Contracts with Kind 2. CoRR abs/2205.09082 (2022) - 2021
- [j2]Baoluo Meng
VERDICT: A Language and Framework for Engineering Cyber Resilient and Safe System. Syst. 9(1): 18 (2021) - [c11]Daniel Larraz
Merit and Blame Assignment with Kind 2. FMICS 2021: 212-220 - [i3]Daniel Larraz, Mickaël Laurent, Cesare Tinelli:
Merit and Blame Assignment with Kind 2. CoRR abs/2105.06575 (2021) - 2020
- [c10]Andrew Reynolds, Haniel Barbosa, Daniel Larraz, Cesare Tinelli
Scalable Algorithms for Abduction via Enumerative Syntax-Guided Synthesis. IJCAR (1) 2020: 141-160 - [c9]M. Fareed Arif, Daniel Larraz
SYSLITE: Syntax-Guided Synthesis of PLTL Formulas from Finite Traces. FMCAD 2020: 93-103 - [i2]Cristina Borralleras, Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio:
Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers. CoRR abs/2008.13601 (2020)
2010 – 2019
- 2019
- [j1]Cristina Borralleras
Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers. ACM Trans. Comput. Log. 20(4): 25:1-25:36 (2019) - [c8]Haniel Barbosa, Andrew Reynolds, Daniel Larraz
Extending enumerative function synthesis via SMT-driven classification. FMCAD 2019: 212-220 - 2017
- [c7]Cristina Borralleras
Proving Termination Through Conditional Termination. TACAS (1) 2017: 99-117 - 2016
- [c6]Lorenzo Candeago
Speeding up the Constraint-Based Method in Difference Logic. SAT 2016: 284-301 - 2015
- [b1]Daniel Larraz:
Automatic program analysis using Max-SMT. Polytechnic University of Catalonia, Spain, 2015 - [c5]Marc Brockschmidt, Daniel Larraz
Compositional Safety Verification with Max-SMT. FMCAD 2015: 33-40 - [i1]Marc Brockschmidt, Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio:
Compositional Safety Verification with Max-SMT. CoRR abs/1507.03851 (2015) - 2014
- [c4]Daniel Larraz
Proving Non-termination Using Max-SMT. CAV 2014: 779-796 - [c3]Daniel Larraz
Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions. SAT 2014: 333-350 - 2013
- [c2]Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio:
Proving termination of imperative programs using Max-SMT. FMCAD 2013: 218-225 - [c1]Daniel Larraz
SMT-Based Array Invariant Generation. VMCAI 2013: 169-188
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-04 19:55 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: