27 citations · 27 across the 3 of their papers we have counts for
3 papers
Dependency Solving Is Still Hard, but We Are Getting Better at It
Pietro Abate, Roberto Di Cosmo, Georgios Gousios +1
Dependency solving is a hard (NP-complete) problem in all non-trivial component models due to either mutually incompatible versions of the same packages or explicitly declared pack…
Strong Dependencies between Software Components
Pietro Abate, Jaap Boender, Roberto Di Cosmo +1
Component-based systems often describe context requirements in terms of explicit inter-component dependencies. Studying large instances of such systems?such as free and open source…
An On-the-fly Tableau-based Decision Procedure for PDL-Satisfiability
Pietro Abate, Rajeev Goré, Florian Widmann
We present a tableau-based algorithm for deciding satisfiability for propositional dynamic logic (PDL) which builds a finite rooted tree with ancestor loops and passes extra inform…