423 search results - page 33 / 85 » On Term Rewriting Systems Having a Rational Derivation |
ICSE
2008
IEEE-ACM
15 years 10 months ago
2008
IEEE-ACM
Nowadays, large-scale industrial software systems may involve hundreds of developers working on hundreds of different but related models representing parts of the same system spec...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter that describes how ties in head-to-head contests...
132
click to vote
ESORICS
2009
Springer
15 years 10 months ago
2009
Springer
Current techniques for the formal modeling analysis of DoS attacks do not adequately deal with amplification attacks that may target a complex distributed system as a whole rather ...
CADE
2004
Springer
15 years 3 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
PODS
2010
ACM
15 years 2 months ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...