Sciweavers

8486 search results - page 49 / 1698
» Ordered Enumeration Method
Sort
View
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
LICS
1999
IEEE
13 years 12 months ago
A Superposition Decision Procedure for the Guarded Fragment with Equality
We give a new decision procedure for the guarded fragment with equality. The procedure is based on resolution with superposition. We argue that this method will be more useful in ...
Harald Ganzinger, Hans de Nivelle
SP
1999
IEEE
194views Security Privacy» more  SP 1999»
13 years 12 months ago
Detecting Intrusions using System Calls: Alternative Data Models
Intrusion detection systems rely on a wide variety of observable data to distinguish between legitimate and illegitimate activities. In this paper we study one such observable-seq...
Christina Warrender, Stephanie Forrest, Barak A. P...
JSCIC
2006
72views more  JSCIC 2006»
13 years 7 months ago
Space-Time Adaptive Solution of First Order PDES
An explicit time-stepping method is developed for adaptive solution of time-dependent partial differential equations with first order derivatives. The space is partitioned into bl...
Lars Ferm, Per Lötstedt
DSD
2007
IEEE
116views Hardware» more  DSD 2007»
14 years 1 months ago
Design Method for Numerical Function Generators Based on Polynomial Approximation for FPGA Implementation
This paper focuses on numerical function generators (NFGs) based on k-th order polynomial approximations. We show that increasing the polynomial order k reduces significantly the...
Shinobu Nagayama, Tsutomu Sasao, Jon T. Butler