Sistemas Informáticos y Computación
Departamento
Monash University
Melbourne, AustraliaPublicaciones en colaboración con investigadores/as de Monash University (6)
2024
-
SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-Based, and SAT Techniques
Proceedings of the ACM on Programming Languages, Vol. 8
2023
-
Optimal dynamic partial order reduction with context-sensitive independence and observers
Journal of Systems and Software, Vol. 202
2019
-
Optimal context-sensitive dynamic partial order reduction with observers
ISSTA 2019 - Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis
2017
-
Context-sensitive dynamic partial order reduction
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2013
-
A CLP heap solver for test case generation
Theory and Practice of Logic Programming
2004
-
A generic framework for context-sensitive analysis of modular programs
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 3049, pp. 233-260