Sciweavers

564 search results - page 72 / 113
» Proof General: A Generic Tool for Proof Development
Sort
View
AML
2002
70views more  AML 2002»
13 years 7 months ago
On the formal points of the formal topology of the binary tree
Abstract Formal topology is today an established topic in the development of constructive mathematics and constructive proofs for many classical results of general topology have be...
Silvio Valentini
IANDC
2010
128views more  IANDC 2010»
13 years 6 months ago
A coinductive calculus of binary trees
We study the set TA of infinite binary trees with nodes labelled in a semiring A from a coalgebraic perspective. We present coinductive definition and proof principles based on ...
Alexandra Silva, Jan J. M. M. Rutten
SCP
2010
88views more  SCP 2010»
13 years 6 months ago
Incompleteness of relational simulations in the blocking paradigm
Refinement is the notion of development between formal specifications. For specifications given in a relational formalism, downward and upward simulations are the standard meth...
Eerke A. Boiten, John Derrick
GLVLSI
2007
IEEE
171views VLSI» more  GLVLSI 2007»
14 years 2 months ago
Combinational equivalence checking for threshold logic circuits
Threshold logic is gaining prominence as an alternative to Boolean logic. The main reason for this trend is the availability of devices that implement these circuits efficiently (...
Tejaswi Gowda, Sarma B. K. Vrudhula, Goran Konjevo...
BIRD
2008
Springer
109views Bioinformatics» more  BIRD 2008»
13 years 9 months ago
A Robust Class of Stable Proteins in the 2D HPC Model
The inverse protein folding problem is that of designing an amino acid sequence which has a prescribed native protein fold. This problem arises in drug design where a particular st...
Alireza Hadj Khodabakhshi, Ján Manuch, Aras...