1458 search results - page 79 / 292 » Extended Term Rewriting Systems |
167
click to vote
ESORICS
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. Access control languages which support administrative controls, and thus allow the ordinary permissions of a system to change, have traditionally been constructed with ï¬...
176
Voted
ACTA
2006
15 years 6 months ago
2006
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
169
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
Self-adjusting programs respond automatically and efficiently to input changes by tracking the dynamic data dependences of the computation and incrementally updating the output as...
331
click to vote
CADE
2011
Springer
14 years 6 months ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
179
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...