367 search results - page 46 / 74 » A Rewriting Logic Sampler |
SOFSEM
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
AMAST
2004
Springer
14 years 1 months ago
2004
Springer
JavaFAN uses a Maude rewriting logic specification of the JVM semantics as the basis of a software analysis tool with competitive performance. It supports formal analysis of concu...
FSTTCS
1993
Springer
14 years 11 hour ago
1993
Springer
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...
CALCO
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. CIRC is an automated circular coinductive prover implemented as an extension of Maude. The circular coinductive technique that forms the core of CIRC is discussed, togeth...
CCS
2005
ACM
14 years 1 months ago
2005
ACM
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...