Joao Marques-Silva

Joao Marques-Silva

Auto-generated profile, based on publicly available information

Joao Marques-Silva

ICREA and University of Lleida

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 1999 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
JMJ.P. Marques-Silva
J.P. Marques-Silva
KSK.A. Sakallah
K.A. Sakallah

26 June 2018
Verified
Book Chapter
Closed access
PDF file
AIAlexey Ignatiev
Alexey Ignatiev
AMAntonio Morgado
Antonio Morgado
JMJoao Marques-Silva
Joao Marques-Silva

17 July 2019 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
AIAlexey Ignatiev
Alexey Ignatiev
NNNina Narodytska
Nina Narodytska
JMJoao Marques-Silva
Joao Marques-Silva
The growing range of applications of Machine Learning (ML) in a multitude of settings motivates the ability of computing small explanations for predictions made. Small explanations are generally accepted as easier for human decision makers to understand. Most earlier work on computing explanations is based on heuristic approaches, providing no guarantees of quality, in terms of how close such solutions are from cardinality- or subset-minimal explanations. This paper develops a constraint-agnostic solution for computing explanations for any ML model. The proposed solution exploits abductive reasoning, and imposes the requirement that the ML model can be represented as sets of constraints using some target constraint reasoning system for which the decision problem can be answered with some oracle. The experimental results, obtained on well-known datasets, validate the scalability of the proposed approach as well as the quality of the computed solutions.

10 January 2024 in International Journal of Approximate Reasoning
Verified
Journal Article
Closed access
XHXuanxiang Huang
Xuanxiang Huang
JMJoao Marques-Silva
Joao Marques-Silva

23 June 2011 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
LCLucas Cordeiro
Lucas Cordeiro
BFBernd Fischer
Bernd Fischer
JMJoao Marques-Silva
Joao Marques-Silva
Propositional bounded model checking has been applied successfully to verify embedded software, but remains limited by increasing propositional formula sizes and the loss of high-level information during the translation preventing potential optimizations to reduce the state space to be explored. These limitations can be overcome by encoding high-level information in theories richer than propositional logic and using SMT solvers for the generated verification conditions. Here, we propose the application of different background theories and SMT solvers to the verification of embedded software written in ANSI-C in order to improve scalability and precision in a completely automatic way. We have modified and extended the encodings from previous SMT-based bounded model checkers to provide more accurate support for variables of finite bit width, bit-vector operations, arrays, structures, unions, and pointers. We have integrated the CVC3, Boolector, and Z3 solvers with the CBMC front-end and evaluated them using both standard software model checking benchmarks and typical embedded software applications from telecommunications, control systems, and medical devices. The experiments show that our ESBMC model checker can analyze larger problems than existing tools and substantially reduce the verification time.

20 July 2013 in Constraints
Verified
Journal Article
Closed access
PDF file
AMAntonio Morgado
Antonio Morgado
FHFederico Heras
Federico Heras
MLMark Liffiton
Mark Liffiton
JPJordi Planes
Jordi Planes
JMJoao Marques-Silva
Joao Marques-Silva