Sciweavers

608 search results - page 20 / 122
» Tests, Proofs and Refinements
Sort
View
FSTTCS
2005
Springer
14 years 1 months ago
Testing Concurrent Systems: An Interpretation of Intuitionistic Logic
Abstract. We present a natural confluence of higher-order hereditary Harrop formulas (HH formulas), Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programmi...
Radha Jagadeesan, Gopalan Nadathur, Vijay A. Saras...
AC
2000
Springer
13 years 7 months ago
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Abstract. In the late 80's Blum, Luby, Rubinfeld, Kannan et al. pioneered the theory of self
Marcos A. Kiwi, Frédéric Magniez, Mi...
ALIFE
2007
13 years 7 months ago
Computational Realizations of Living Systems
Robert Rosen’s central theorem states that organisms are fundamentally different to machines, mainly because they are ‘‘closed with respect to effcient causation.’’ The p...
Dominique Chu, Weng Kin Ho
COMBINATORICS
2006
116views more  COMBINATORICS 2006»
13 years 7 months ago
Classifying Descents According to Equivalence mod k
In [5] the authors refine the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers. In this paper, we generalize the results o...
Sergey Kitaev, Jeffrey B. Remmel
CAV
2010
Springer
168views Hardware» more  CAV 2010»
13 years 5 months ago
A Dash of Fairness for Compositional Reasoning
Abstract. Proofs of progress properties often require fairness assumptions. Incorporating global fairness assumptions in a compositional method is a challenge, however, given the l...
Ariel Cohen 0002, Kedar S. Namjoshi, Yaniv Sa'ar