Sciweavers

1209 search results - page 157 / 242
» Universal Algebra and Computer Science
Sort
View
FM
1994
Springer
113views Formal Methods» more  FM 1994»
15 years 6 months ago
Abstract Model Checking of Infinite Specifications
Model Checking of Infinite Specifications Daniel Jackson School of Computer Science Carnegie Mellon University Pittsburgh, PA A new method for analyzing specifications in languages...
Daniel Jackson
101
Voted
PODS
1994
ACM
131views Database» more  PODS 1994»
15 years 6 months ago
Constraint Checking with Partial Information
Abstract Appears in Proceedings of the Thirteenth Symposium on Principles of Database Systems, 1994 Ashish Gupta Yehoshua Sagivy Je rey D. Ullman Jennifer Widom Dept. of Computer S...
Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman, J...
135
Voted
APLAS
2007
ACM
15 years 6 months ago
A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
: An Extended Abstract Alwen Tiu Computer Sciences Laboratory Australian National University Abstract. A notion of open bisimulation is formulated for the spi calculus, an extensio...
Alwen Tiu
106
Voted
SIGMOD
1991
ACM
81views Database» more  SIGMOD 1991»
15 years 6 months ago
Multi-Disk B-trees
In this paper, Dept. of Computer Science, University of Waterloo Waterloo, Ontario, Canada, N2L 3G1 we consider how to exploit multiple disks to improve the performance of B-tree ...
Bernhard Seeger, Per-Åke Larson
140
Voted
AISB
2008
Springer
15 years 4 months ago
Substitution for Fraenkel-Mostowski foundations
Abstract. A fundamental and unanalysed logical concept is substitution. This seemingly innocuous operation -- substituting a variable for a term or valuating a variable to an eleme...
Murdoch Gabbay, Michael Gabbay