Sciweavers

367 search results - page 24 / 74
» A Rewriting Logic Sampler
Sort
View
CSFW
2003
IEEE
15 years 5 months ago
Understanding SPKI/SDSI Using First-Order Logic
SPKI/SDSI is a language for expressing distributed access control policy, derived from SPKI and SDSI. We provide a first-order logic (FOL) semantics for SDSI, and show that it ha...
Ninghui Li, John C. Mitchell
94
Voted
ENTCS
2007
120views more  ENTCS 2007»
15 years 11 days ago
Local Reasoning about Data Update
We present local Hoare reasoning about data update, using Context Logic for analysing structured data. We apply our reasoning to tree update, heap update which is analogous to loc...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
97
Voted
PPDP
2007
Springer
15 years 6 months ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel
93
Voted
CADE
2001
Springer
16 years 22 days ago
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
Xavier Urbain
119
Voted
ASE
2005
137views more  ASE 2005»
15 years 10 days ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund