2989 search results - page 388 / 598 » Using Domain-Independent Problems for Introducing Formal Met... |
112
click to vote
PLDI
1996
ACM
15 years 6 months ago
1996
ACM
Many important classes of bugs result from invalid assumptions about the results of functions and the values of parameters and global variables. Using traditional methods, these b...
106
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...
103
click to vote
ISPAN
2005
IEEE
15 years 8 months ago
2005
IEEE
Within the parallel computing domain, field programmable gate arrays (FPGA) are no longer restricted to their traditional role as substitutes for application-specific integrated...
126
Voted
SAS
2010
Springer
15 years 1 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
109
Voted
MICAI
2000
Springer
15 years 6 months ago
2000
Springer
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...