Sciweavers

1173 search results - page 174 / 235
» Program Derivation Using Analogy
Sort
View
ISCAS
2005
IEEE
129views Hardware» more  ISCAS 2005»
15 years 8 months ago
A reconfigurable architecture for scanning biosequence databases
—Unknown protein sequences are often compared to a set of known sequences (a database scan) to detect functional similarities. Even though efficient dynamic programming algorithm...
Timothy F. Oliver, Bertil Schmidt, Douglas L. Mask...
129
Voted
TACAS
2004
Springer
139views Algorithms» more  TACAS 2004»
15 years 7 months ago
Error Explanation with Distance Metrics
Abstract In the event that a system does not satisfy a specification, a model checker will typically automatically produce a counterexample trace that shows a particular instance ...
Alex Groce
TYPES
2004
Springer
15 years 7 months ago
Exploring the Regular Tree Types
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
Peter Morris, Thorsten Altenkirch, Conor McBride
129
Voted
LICS
2002
IEEE
15 years 7 months ago
A Syntactic Approach to Foundational Proof-Carrying Code
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, S...
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 6 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...