SAMIR
GENAIM
Profesor contratado doctor
Universidad Politécnica de Madrid
Madrid, EspañaPublicacións en colaboración con investigadores/as de Universidad Politécnica de Madrid (42)
2022
-
When COSTA Met KeY: Verified Cost Bounds
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer Science and Business Media Deutschland GmbH), pp. 19-37
2016
-
A formal verification framework for static analysis: As well as its instantiation to the resource analyzer COSTA and formal verification tool KeY
Software and Systems Modeling, Vol. 15, Núm. 4, pp. 987-1012
2015
-
A practical comparator of cost functions and its applications
Science of Computer Programming, Vol. 111, Núm. P3, pp. 483-504
-
Object-sensitive cost analysis for concurrent objects
Software Testing Verification and Reliability, Vol. 25, Núm. 3, pp. 218-271
-
Resource analysis: From sequential to concurrent and distributed programs
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2014
-
Conditional termination of loops over heap-allocated data
Science of Computer Programming, Vol. 92, Núm. PART A, pp. 2-24
-
Inference of field-sensitive reachability and cyclicity
ACM Transactions on Computational Logic, Vol. 15, Núm. 4
-
SACO: Static analyzer for concurrent objects
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2013
-
Automatic inference of bounds on resource consumption
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
-
Erratum: Reachability-based acyclicity analysis by abstract interpretation (Theoretical Computer Science (2013) 474 (60-79))
Theoretical Computer Science
-
On the inference of resource usage upper and lower bounds
ACM Transactions on Computational Logic, Vol. 14, Núm. 3
-
Reachability-based acyclicity analysis by Abstract Interpretation
Theoretical Computer Science, Vol. 474, pp. 60-79
2012
-
Automatic inference of resource consumption bounds
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
-
COSTABS: A cost and termination analyzer for ABS
Conference Record of the Annual ACM Symposium on Principles of Programming Languages
-
Cost analysis of object-oriented bytecode programs
Theoretical Computer Science
-
On the termination of integer loops
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
-
On the termination of integer loops
ACM Transactions on Programming Languages and Systems, Vol. 34, Núm. 4
-
Verified resource guarantees for heap manipulating programs
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2011
-
Closed-form upper bounds in static cost analysis
Journal of Automated Reasoning, Vol. 46, Núm. 2, pp. 161-203
-
Cost analysis of concurrent OO programs
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)