Daniel Larraz

Orcid: 0000-0001-5305-7340

According to our database1, Daniel Larraz authored at least 17 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Comprehensive, Automated Security Analysis of the Uptane Automotive Over-the-Air Update Framework.
Proceedings of the 27th International Symposium on Research in Attacks, 2024

2023
CRV: Automated Cyber-Resiliency Reasoning for System Design Models.
Proceedings of the Formal Methods in Computer-Aided Design, 2023

2022
Realizability Checking of Contracts with Kind 2.
CoRR, 2022

2021
VERDICT: A Language and Framework for Engineering Cyber Resilient and Safe System.
Syst., 2021

Merit and Blame Assignment with Kind 2.
Proceedings of the Formal Methods for Industrial Critical Systems, 2021

2020
SYSLITE: Syntax-Guided Synthesis of PLTL Formulas from Finite Traces.
Proceedings of the 2020 Formal Methods in Computer Aided Design, 2020

Scalable Algorithms for Abduction via Enumerative Syntax-Guided Synthesis.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

2019
Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers.
ACM Trans. Comput. Log., 2019

Extending enumerative function synthesis via SMT-driven classification.
Proceedings of the 2019 Formal Methods in Computer Aided Design, 2019

2017
Proving Termination Through Conditional Termination.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

2016
Speeding up the Constraint-Based Method in Difference Logic.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

2015
Automatic program analysis using Max-SMT.
PhD thesis, 2015

Compositional Safety Verification with Max-SMT.
Proceedings of the Formal Methods in Computer-Aided Design, 2015

2014
Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Proving Non-termination Using Max-SMT.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2013
SMT-Based Array Invariant Generation.
Proceedings of the Verification, 2013

Proving termination of imperative programs using Max-SMT.
Proceedings of the Formal Methods in Computer-Aided Design, 2013


  Loading...