Sciweavers

367 search results - page 57 / 74
» A Rewriting Logic Sampler
Sort
View
POPL
2007
ACM
14 years 8 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
CADE
2004
Springer
14 years 8 months ago
TaMeD: A Tableau Method for Deduction Modulo
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
Richard Bonichon
OSDI
2006
ACM
14 years 8 months ago
BrowserShield: Vulnerability-Driven Filtering of Dynamic HTML
Vulnerability-driven filtering of network data can offer a fast and easy-to-deploy alternative or intermediary to software patching, as exemplified in Shield [43]. In this paper, ...
Charles Reis, John Dunagan, Helen J. Wang, Opher D...
VLDB
2001
ACM
168views Database» more  VLDB 2001»
14 years 8 months ago
Answering queries using views: A survey
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessin...
Alon Y. Halevy
APSEC
2005
IEEE
14 years 1 months ago
Analysis of the Suzuki-Kasami Algorithm with the Maude Model Checker
We report on a case study in which the Maude model checker has been used to analyze the Suzuki-Kasami distributed mutual exclusion algorithm with respect to the mutual exclusion p...
Kazuhiro Ogata, Kokichi Futatsugi