Jorge A. Navas

Orcid: 0000-0002-0516-1167

Affiliations:
  • SRI International, Menlo Park, CA, USA
  • Certora Inc, Austin, TX, USA
  • Technical University of Madrid, Spain (former)


According to our database1, Jorge A. Navas authored at least 57 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Inductive Predicate Synthesis Modulo Programs (Extended).
CoRR, 2024

Inductive Predicate Synthesis Modulo Programs.
Proceedings of the 38th European Conference on Object-Oriented Programming, 2024

2023
OCCAM-v2: Combining Static and Dynamic Analysis for Effective and Efficient Whole-Program Specialization.
Commun. ACM, 2023

2022
OCCAM-v2: Combining Static and Dynamic Analysis for Effective and Efficient Whole-program Specialization: Leveraging scalable pointer analysis, value analysis, and dynamic analysis.
ACM Queue, 2022

Verifying Solidity Smart Contracts via Communication Abstraction in SmartACE.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2022

Efficient Modular SMT-Based Model Checking of Pointer Programs.
Proceedings of the Static Analysis - 29th International Symposium, 2022

2021
A Fresh Look at Zones and Octagons.
ACM Trans. Program. Lang. Syst., 2021

Compositional Verification of Smart Contracts Through Communication Abstraction (Extended).
CoRR, 2021

Abstract Interpretation of LLVM with a Region-Based Memory Model.
Proceedings of the Software Verification - 13th International Conference, 2021

Compositional Verification of Smart Contracts Through Communication Abstraction.
Proceedings of the Static Analysis - 28th International Symposium, 2021

Disjunctive Interval Analysis.
Proceedings of the Static Analysis - 28th International Symposium, 2021

Automatically Tailoring Abstract Interpretation to Custom Usage Scenarios.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

Automated Safety Verification of Programs Invoking Neural Networks.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020
Automatically Tailoring Static Analysis to Custom Usage Scenarios.
CoRR, 2020

Verification of an Optimized NTT Algorithm.
Proceedings of the Software Verification - 12th International Conference, 2020

MiDas: Containerizing Data-Intensive Applications with I/O Specialization.
Proceedings of the 3rd International Workshop on Practical Reproducible Evaluation of Computer Systems, 2020

2019
Simple and precise static analysis of untrusted Linux kernel extensions.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

Unification-based Pointer Analysis without Oversharing.
Proceedings of the 2019 Formal Methods in Computer Aided Design, 2019

Dissecting Widening: Separating Termination from Information.
Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

2018
Executable Counterexamples in Software Model Checking.
Proceedings of the Verified Software. Theories, Tools, and Experiments, 2018

Verification of Fault-Tolerant Protocols with Sally.
Proceedings of the NASA Formal Methods - 10th International Symposium, 2018

Generating Component Interfaces by Integrating Static and Symbolic Analysis, Learning, and Runtime Monitoring.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Verification, 2018

2017
A Context-Sensitive Memory Model for Verification of C/C++ Programs.
Proceedings of the Static Analysis - 24th International Symposium, 2017

2016
A complete refinement procedure for regular separability of context-free languages.
Theor. Comput. Sci., 2016

An Abstract Domain of Uninterpreted Functions.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2016

Exploiting Sparsity in Difference-Bound Matrices.
Proceedings of the Static Analysis - 23rd International Symposium, 2016

2015
Horn clauses as an intermediate representation for program analysis and transformation.
Theory Pract. Log. Program., 2015

Algorithmic logic-based verification.
ACM SIGLOG News, 2015

SeaHorn: A Framework for Verifying C Programs (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

A Tool for Intersecting Context-Free Grammars and Its Applications.
Proceedings of the NASA Formal Methods - 7th International Symposium, 2015

Finding Inconsistencies in Programs with Loops.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

The SeaHorn Verification Framework.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014
Interval Analysis and Machine Arithmetic: Why Signedness Ignorance Is Bliss.
ACM Trans. Program. Lang. Syst., 2014

A Partial-Order Approach to Array Content Analysis.
CoRR, 2014

Verification of Programs by Combining Iterated Specialization with Interpolation.
Proceedings of the Proceedings First Workshop on Horn Clauses for Verification and Synthesis, 2014

IKOS: A Framework for Static Analysis Based on Abstract Interpretation.
Proceedings of the Software Engineering and Formal Methods - 12th International Conference, 2014

Analyzing Array Manipulating Programs by Program Transformation.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2014

2013
Failure tabled constraint logic programming by interpolation.
Theory Pract. Log. Program., 2013

Unbounded Model-Checking with Interpolation for Regular Language Constraints.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Boosting concolic testing via interpolation.
Proceedings of the Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, 2013

Abstract Interpretation over Non-lattice Abstract Domains.
Proceedings of the Static Analysis - 20th International Symposium, 2013

Modelling Destructive Assignments.
Proceedings of the Principles and Practice of Constraint Programming, 2013

2012
Path-Sensitive Backward Slicing.
Proceedings of the Static Analysis - 19th International Symposium, 2012

TRACER: A Symbolic Execution Tool for Verification.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Signedness-Agnostic Program Analysis: Precise Integer Bounds for Low-Level Code.
Proceedings of the Programming Languages and Systems - 10th Asian Symposium, 2012

2011
Symbolic Execution for Verification.
CoRR, 2011

Unbounded Symbolic Execution for Program Verification.
Proceedings of the Runtime Verification - Second International Conference, 2011

2010
Towards Parameterized Regular Type Inference Using Set Constraints
CoRR, 2010

Abstraction Learning.
Proceedings of the Automated Technology for Verification and Analysis, 2010

2009
User-Definable Resource Usage Bounds Analysis for Java Bytecode.
Proceedings of the Fourth Workshop on Bytecode Semantics, 2009

2008
Negative Ternary Set-Sharing.
Proceedings of the Logic Programming, 24th International Conference, 2008

2007
An Efficient, Parametric Fixpoint Algorithm for Analysis of Java Bytecode.
Proceedings of the Second Workshop on Bytecode Semantics, 2007

A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2007

User-Definable Resource Bounds Analysis for Logic Programs.
Proceedings of the Logic Programming, 23rd International Conference, 2007

2006
Efficient Top-Down Set-Sharing Analysis Using Cliques.
Proceedings of the Practical Aspects of Declarative Languages, 8th International Symposium, 2006

2005
A study of set-sharing analysis via cliques.
CoRR, 2005

A Study of Set-Sharing Analysis via Clique.
Proceedings of the 15th International Workshop on Logic Programming Environments, 2005


  Loading...