Sciweavers

882 search results - page 153 / 177
» A Taste of Rewrite Systems
Sort
View
SIGMOD
2007
ACM
157views Database» more  SIGMOD 2007»
14 years 8 months ago
Compiling mappings to bridge applications and databases
Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the...
Sergey Melnik, Atul Adya, Philip A. Bernstein
CC
2010
Springer
172views System Software» more  CC 2010»
14 years 3 months ago
Verifying Local Transformations on Relaxed Memory Models
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
Sebastian Burckhardt, Madanlal Musuvathi, Vasu Sin...
FOSSACS
2009
Springer
14 years 3 months ago
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
Christopher Broadbent, C.-H. Luke Ong
RTA
2009
Springer
14 years 3 months ago
YAPA: A Generic Tool for Computing Intruder Knowledge
Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages...
Mathieu Baudet, Véronique Cortier, St&eacut...
EDOC
2007
IEEE
14 years 3 months ago
Incorporating Security Behaviour into Business Models Using a Model Driven Approach
There has, in recent years, been growing interest in Model Driven Engineering (MDE), in which models are the primary design artifacts and transformations are applied to these mode...
Peter F. Linington, Pulitha Liyanagama