608 search results - page 74 / 122 » Tests, Proofs and Refinements |
FUIN
2007
13 years 7 months ago
2007
Abstract. Josephs and Udding’s DI-Algebra offers a convenient way of specifying and verifying designs that must rely upon delay-insensitive signalling between modules (asynchrono...
BMCBI
2005
13 years 7 months ago
2005
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
APSEC
2009
IEEE
13 years 5 months ago
2009
IEEE
Abstract--Formal methods are very useful in software industry and are becoming of paramount importance in practical engineering techniques. They involve the design and the modeling...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
POPL
2010
ACM
13 years 10 months ago
2010
ACM
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...