Sciweavers

Share
29 search results - page 1 / 6
» Complete Lattices and Up-To Techniques
Sort
View
APLAS
2007
ACM
9 years 6 months ago
Complete Lattices and Up-To Techniques
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
Damien Pous
LICS
1997
IEEE
9 years 5 months ago
Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
David Janin
BMCBI
2008
211views more  BMCBI 2008»
9 years 2 months ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen
CORR
2008
Springer
130views Education» more  CORR 2008»
9 years 2 months ago
Standard Logics Are Valuation-Nonmonotonic
It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of nonorthomodular and thus non-distributive lattices that properly...
Mladen Pavicic, Norman D. Megill
SCN
2010
Springer
122views Communications» more  SCN 2010»
9 years 22 days ago
Recursive Lattice Reduction
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...
Thomas Plantard, Willy Susilo
books