Sciweavers

13306 search results - page 365 / 2662
» Theoretical Computer Science
Sort
View
TLCA
2005
Springer
16 years 8 days ago
Can Proofs Be Animated By Games?
Proof animation is a way of executing proofs to nd errors in the formalization of proofs. It is intended to be \testing in proof engineering". Although the realizability inter...
Susumu Hayashi
RELMICS
2009
Springer
16 years 1 months ago
Collagories for Relational Adhesive Rewriting
We define collagories essentially as “distributive allegories without zero morphisms”, and show that they are sufficient for accommodating the relation-algebraic approach to ...
Wolfram Kahl
SPIN
2000
Springer
15 years 10 months ago
Runtime Checking of Multithreaded Applications with Visual Threads
Multithreaded applications are notoriously difficult to design and build while avoiding defects. Many of Compaq's customers need to employ threads to implement high-performanc...
Jerry J. Harrow
CCA
2009
Springer
16 years 1 months ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
Martin Ziegler
CAD
1998
Springer
15 years 6 months ago
Solving geometric constraint systems. II. A symbolic approach and decision of Rc-constructibility
Abstract. This paper reports a geometric constraint solving approach based on symbolic computation. With this approach, we can compute robust numerical solutions for a set of equat...
Xiao-Shan Gao, Shang-Ching Chou