✦ LIBER ✦

Constructing malware normalizers using term rewriting

✍ Scribed by Walenstein, Andrew ;Mathur, Rachit ;Chouchane, Mohamed R. ;Lakhotia, Arun

Book ID: 107343260
Publisher: Springer
Year: 2008
Tongue: English
Weight: 348 KB
Volume: 4
Category: Article
ISSN: 1772-9890
DOI: 10.1007/s11416-008-0081-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Term rewriting for normalization by eval

Term rewriting for normalization by evaluation

✍ Ulrich Berger; Matthias Eberl; Helmut Schwichtenberg 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Rule-based synthesis using ADTs and term

Rule-based synthesis using ADTs and term rewriting

✍ Harald-Reto Fonio; Adam Pawlak 📂 Article 📅 1992 🏛 Elsevier Science ⚖ 265 KB

Modeling Group Communication Protocols U

Modeling Group Communication Protocols Using Multiset Term Rewriting

✍ Grit Denker; Jon Millen 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 257 KB

Using term rewriting systems to design a

Using term rewriting systems to design and verify processors

✍ Arvind; Shen, X. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 121 KB

Proof theory of higher-order equations:

Proof theory of higher-order equations: conservativity, normal forms and term rewriting

✍ K. Meinke 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 393 KB

We introduce a necessary and sufficient condition for the o-extensionality rule of higher-order equational logic to be conservative over first-order many-sorted equational logic for ground first-order equations. This gives a precise condition under which computation in the higher-order initial model

A polynomial algorithm for uniqueness of

A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems

✍ Julian Zinn; Rakesh M. Verma 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 303 KB