12 citations · 40 across the 7 of their papers we have counts for
7 papers
New Eliahou Semigroups and Verification of the Wilf Conjecture for Genus up to 65
Maria Bras-Amorós, César Marín-Rodríguez
We give a graphical reinterpretation of the seeds algorithm to explore the tree of numerical semigroups. We then exploit the seeds algorithm to find all the Eliahou semigroups of g…
Symbolic Partial-Order Execution for Testing Multi-Threaded Programs
Daniel Schemmel, Julian Büning, César Rodríguez +2
We describe a technique for systematic testing of multi-threaded programs. We combine Quasi-Optimal Partial-Order Reduction, a state-of-the-art technique that tackles path explosio…
Quasi-Optimal Partial Order Reduction
Huyen T. T Nguyen, César Rodríguez, Marcelo Sousa +2
A dynamic partial order reduction (DPOR) algorithm is optimal when it always explores at most one representative per Mazurkiewicz trace. Existing literature suggests that the reduc…
Abstract Interpretation with Unfoldings
Marcelo Sousa, César Rodríguez, Vijay D'Silva +1
We present and evaluate a technique for computing path-sensitive interference conditions during abstract interpretation of concurrent programs. In lieu of fixed point computation,…
Unfolding-Based Process Discovery
Hernán Ponce-de-León, César Rodríguez, Josep Carmona +2
This paper presents a novel technique for process discovery. In contrast to the current trend, which only considers an event log for discovering a process model, we assume two addi…
Unfolding-based Partial Order Reduction
César Rodríguez, Marcelo Sousa, Subodh Sharma +1
Partial order reduction (POR) and net unfoldings are two alternative methods to tackle state-space explosion caused by concurrency. In this paper, we propose the combination of bot…