20 search results - page 3 / 4 » Formalizing Rewriting in the ACL2 Theorem Prover |
JAR
2008
13 years 9 months ago
2008
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...
SOFSEM
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
RAID
2004
Springer
14 years 3 months ago
2004
Springer
We present a formal framework for the analysis of intrusion detection systems (IDS) that employ declarative rules for attack recognition, e.g. specification-based intrusion detect...
FMCAD
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
ENTCS
2002
13 years 9 months ago
2002
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...