Sciweavers

140 search results - page 4 / 28
» Orderings and Constraints: Theory and Practice of Proving Te...
Sort
View
ANCS
2006
ACM
14 years 2 months ago
WormTerminator: an effective containment of unknown and polymorphic fast spreading worms
The fast spreading worm is becoming one of the most serious threats to today’s networked information systems. A fast spreading worm could infect hundreds of thousands of hosts w...
Songqing Chen, Xinyuan Wang, Lei Liu, Xinwen Zhang
CAV
2012
Springer
270views Hardware» more  CAV 2012»
11 years 11 months ago
Automated Termination Proofs for Java Programs with Cyclic Data
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
Marc Brockschmidt, Richard Musiol, Carsten Otto, J...
PPCP
1993
14 years 18 days ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
Spiro Michaylov, Frank Pfenning
CADE
2006
Springer
14 years 8 months ago
Tree Automata with Equality Constraints Modulo Equational Theories
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
Florent Jacquemard, Laurent Vigneron, Michaël...
IPL
2006
109views more  IPL 2006»
13 years 8 months ago
Knuth-Bendix completion of theories of commuting group endomorphisms
Knuth-Bendix completions of the equational theories of k 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This impro...
Aaron Stump, Bernd Löchner