145 search results - page 12 / 29 » Parameterized Complexity Classes under Logical Reductions |
VMCAI
2004
Springer
14 years 1 months ago
2004
Springer
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
DAC
2006
ACM
14 years 9 months ago
2006
ACM
Transistor leakage is poised to become the dominant source of power dissipation in digital systems, and reconfigurable devices are not immune to this problem. Modern FPGAs already...
IANDC
2007
13 years 8 months ago
2007
In many cases, the addition of metric operators to qualitative temporal logics (TLs) increases the complexity of satisfiability by at least one exponential: while common qualitat...
ICCAD
2005
IEEE
14 years 5 months ago
2005
IEEE
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...