2086 search results - page 163 / 418 » Mathematical Theory Exploration |
139
click to vote
ICFP
2008
ACM
16 years 3 months ago
2008
ACM
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
131
Voted
SAC
2009
ACM
15 years 10 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
151
Voted
SAC
2009
ACM
15 years 10 months ago
2009
ACM
A wide range of web service choreography constraints on the content and sequentiality of messages can be translated into Linear Temporal Logic (LTL). Although they can be statical...
134
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
122
Voted
ISSAC
2009
Springer
15 years 10 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...