Sciweavers

417 search results - page 7 / 84
» Orderings for Innermost Termination
Sort
View
FROCOS
2007
Springer
14 years 1 months ago
Proving Termination Using Recursive Path Orders and SAT Solving
We introduce a propositional encoding of the recursive path order with status (RPO). RPO is a combination of a multiset path order and a lexicographic path order which considers pe...
Peter Schneider-Kamp, René Thiemann, Elena ...
HICSS
2002
IEEE
132views Biometrics» more  HICSS 2002»
14 years 13 days ago
Secure Transmission of the Prescription Order Communication System Based on the Internet and the Public-Key Infrastructure Using
This research paper presents a new system's design and development of the prescription order communication system (POCS) based on the Internet between the hospital and the ph...
Won Jay Song, Byung-Ha Ahn
FSEN
2009
Springer
14 years 2 months ago
Termination in Higher-Order Concurrent Calculi
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
TPHOL
2007
IEEE
14 years 1 months ago
Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...
Lukas Bulwahn, Alexander Krauss, Tobias Nipkow
CTRS
1992
13 years 11 months ago
Path Orderings for Termination of Associative-Commutative Rewriting
We show that a simple, and easily implementable, restriction on the recursive path ordering, which we call the "binary path condition," sufficesfor establishing terminat...
Nachum Dershowitz, Subrata Mitra