Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Carlos A. González

dblp:118/8297 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2019
0000-0003-1836-4876ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 5 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Program verification · 50% Requirements engineering and software design · 50%
Theoretical computer science
1 paper
Computational complexity · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program verification
bounded verification
0.412019
Smart Bound Selection for the Verification of UML/OCL Class Diagrams · IEEE Trans. Software Eng. 2019
Requirements engineering and software design
model-driven engineering
0.412019
Smart Bound Selection for the Verification of UML/OCL Class Diagrams · IEEE Trans. Software Eng. 2019
Computational complexity
constraint satisfaction
0.112019
Smart Bound Selection for the Verification of UML/OCL Class Diagrams · IEEE Trans. Software Eng. 2019

Methods — techniques the papers use, named apart from their topics

constraint programming · 0.8SAT solving · 0.8
YearPublicationVenuePosition
2019 Smart Bound Selection for the Verification of UML/OCL Class Diagrams
abstract
Correctness of UML class diagrams annotated with OCL constraints can be checked using bounded verification techniques, e.g., SAT or constraint programming (CP) solvers. Bounded verification detects faults efficiently but, on the other hand, the absence of faults does not guarantee a correct behavior outside the bounded domain. Hence, choosing suitable bounds is a non-trivial process as there is a trade-off between the verification time (faster for smaller domains) and the confidence in the result (better for larger domains). Unfortunately, bounded verification tools provide little support in the bound selection process. In this paper, we present a technique that can be used to (i) automatically infer verification bounds whenever possible, (ii) tighten a set of bounds proposed by the user and (iii) guide the user in the bound selection process. This approach may increase the usability of UML/OCL bounded verification tools and improve the efficiency of the verification process.
Robert Clarisó, Carlos A. González, Jordi Cabot
IEEE Trans. Software Eng.2
2018 Enabling Model Testing of Cyber-Physical Systems
abstract
Applying traditional testing techniques to Cyber-Physical Systems (CPS) is challenging due to the deep intertwining of software and hardware, and the complex, continuous interactions between the system and its environment. To alleviate these challenges we propose to conduct testing at early stages and over executable models of the system and its environment. Model testing of CPSs is however not without difficulties. The complexity and heterogeneity of CPSs renders necessary the combination of different modeling formalisms to build faithful models of their different components. The execution of CPS models thus requires an execution framework supporting the cosimulation of different types of models, including models of the software (e.g., SysML), hardware (e.g., SysML or Simulink), and physical environment (e.g., Simulink). Furthermore, to enable testing in realistic conditions, the cosimulation process must be (1) fast, so that thousands of simulations can be conducted in practical time, (2) controllable, to precisely emulate the expected runtime behavior of the system and, (3) observable, by producing simulation data enabling the detection of failures. To tackle these challenges, we propose a SysML-based modeling methodology for model testing of CPSs, and an efficient SysML-Simulink cosimulation framework. Our approach was validated on a case study from the satellite domain.
Carlos A. González, Mojtaba Varmazyar, Shiva Nejati 0001, Lionel C. Briand, Yago Isasi
MoDELS1
2015 Towards Domain Refinement for UML/OCL Bounded Verification
Robert Clarisó, Carlos A. González, Jordi Cabot
SEFM2
2014 Formal verification of static software models in MDE: A systematic review
Carlos A. González, Jordi Cabot
Inf. Softw. Technol.1
2012 ATLTest: A White-Box Test Generation Approach for ATL Transformations
Carlos A. González, Jordi Cabot
MoDELS1