Sciweavers

1401 search results - page 162 / 281
» Randomness in Interactive Proofs
Sort
View
TCS
2002
14 years 9 months ago
A formal approach to object-oriented software engineering
We show how formal specifications can be integrated into one of the current pragmatic object-oriented software development methods. Jacobson's "Object-Oriented Software ...
Martin Wirsing, Alexander Knapp
LPAR
2010
Springer
14 years 7 months ago
Dafny: An Automatic Program Verifier for Functional Correctness
Traditionally, the full verification of a program's functional correctness has been obtained with pen and paper or with interactive proof assistants, whereas only reduced ver...
K. Rustan M. Leino
COMMA
2010
14 years 5 months ago
Expanding Argumentation Frameworks: Enforcing and Monotonicity Results
This paper addresses the problem of revising a Dung-style argumentation framework by adding finitely many new arguments which may interact with old ones. We study the behavior of t...
Ringo Baumann, Gerhard Brewka
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
15 years 10 months ago
High-throughput Protein Interactome Data: Minable or Not?
There is an emerging trend in post-genome biology to study the collection of thousands of protein interaction pairs (protein interactome) derived from high-throughput experiments....
Jake Yue Chen, Andrey Y. Sivachenko, Lang Li
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 4 months ago
Takeover times on scale-free topologies
The topological properties of a network directly impact the flow of information through a system. In evolving populations, the topology of inter-individual interactions affects th...
Joshua L. Payne, Margaret J. Eppstein