Sciweavers

4099 search results - page 378 / 820
» A Framework for Interactive Proof
Sort
View
CONCUR
2006
Springer
15 years 10 months ago
Weak Bisimulation Up to Elaboration
Abstract We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields a...
Damien Pous
AGP
1998
IEEE
15 years 10 months ago
The Correctness of Set-Sharing
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
TABLEAUX
1995
Springer
15 years 10 months ago
Constraint Model Elimination and a PTTP-Implementation
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...
Peter Baumgartner, Frieder Stolzenburg
FSTTCS
1991
Springer
15 years 10 months ago
Randomizing Reductions of Search Problems
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
Andreas Blass, Yuri Gurevich
APBC
2003
138views Bioinformatics» more  APBC 2003»
15 years 8 months ago
A New Approach to Protein Structure and Function Analysis Using Semi-structured Databases
The development of high-throughput genome sequencing and protein structure determination techniques have provided researchers with a wealth of biological data. Integrated analysis...
William M. Shui, Raymond K. Wong, Stephen C. Graha...