Sciweavers

3513 search results - page 612 / 703
» Super Logic Programs
Sort
View
81
Voted
ICALP
2010
Springer
15 years 2 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
101
Voted
CODES
2008
IEEE
15 years 2 months ago
Specification-based compaction of directed tests for functional validation of pipelined processors
Functional validation is a major bottleneck in microprocessor design methodology. Simulation is the widely used method for functional validation using billions of random and biase...
Heon-Mo Koo, Prabhat Mishra
94
Voted
ECOOP
2008
Springer
15 years 2 months ago
A Case Study for Aspect Based Updating
Rather than upgrading a software system to the next version by installing a new binary, software systems could be updated "on-thefly" during their execution. We are devel...
Susanne Cech Previtali, Thomas R. Gross
FLOPS
2008
Springer
15 years 2 months ago
Rewriting and Call-Time Choice: The HO Case
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
Francisco Javier López-Fraguas, Juan Rodr&i...
112
Voted
VAMOS
2008
Springer
15 years 1 months ago
How complex is my Product Line? The case for Variation Point Metrics
Software Product Lines aim at capturing the variability and commonality of a family of related programs that share a common set of assets. Variation points capture variability on ...
Roberto E. Lopez-Herrejon, Salvador Trujillo