168 search results - page 16 / 34 » Imperative Program Transformation by Rewriting |
FSTTCS
2008
Springer
13 years 9 months ago
2008
Springer
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...
VIROLOGY
2008
13 years 8 months ago
2008
A malware mutation engine is able to transform a malicious program to create a different version of the program. Such mutation engines are used at distribution sites or in self-pro...
HASKELL
2006
ACM
14 years 2 months ago
2006
ACM
We introduce the new, improved version of the Haskell Equational Reasoning Assistant, which consists of an Ajax application for rewriting Haskell fragments in their context, and a...
LICS
1994
IEEE
14 years 22 days ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
ASE
2005
13 years 8 months ago
2005
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...