Sciweavers

275 search results - page 27 / 55
» A Family of Defeasible Reasoning Logics and its Implementati...
Sort
View
ISSTA
2009
ACM
14 years 1 months ago
Precise pointer reasoning for dynamic test generation
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...
Bassem Elkarablieh, Patrice Godefroid, Michael Y. ...
ICIP
2002
IEEE
14 years 9 months ago
JANIS: Just Another n-order Side-Informed Watermarking Scheme
This paper deals with some detection issues of watermark signals. We propose an easy way to implement an informed watermarking embedder whatever the detection function. This metho...
Teddy Furon, Benoit M. Macq, Neil J. Hurley, Gueno...
MAM
2007
157views more  MAM 2007»
13 years 7 months ago
Executing large algorithms on low-capacity FPGAs using flowpath partitioning and runtime reconfiguration
This paper describes a new method of executing a software program on an FPGA for embedded systems. Rather than combine reconfigurable logic with a microprocessor core, this method...
Darrin M. Hanna, Michael DuChene
CADE
2008
Springer
14 years 7 months ago
randoCoP: Randomizing the Proof Search Order in the Connection Calculus
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
Thomas Raths, Jens Otten
CADE
1998
Springer
13 years 11 months ago
System Description: leanK 2.0
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
Bernhard Beckert, Rajeev Goré