Sciweavers

1204 search results - page 180 / 241
» Termination of Polynomial Programs
Sort
View
DAGSTUHL
1998
14 years 11 months ago
Active-U-Datalog: Integrating Active Rules in a Logical Update Language
Deductive database technology represents an important step towards the goal of developing highly-declarative database programming languages. In order to make deductive databases a ...
Elisa Bertino, Barbara Catania, Vincenzo Gervasi, ...
WSC
1998
14 years 11 months ago
LABATCH.2: Software for Statistical Analysis of Simulation Sample Path Data
LABATCH.2 is a collection of computer programs available in C, FORTRAN, and SIMSCRIPT II.5 by anonymous ftp, at http://www.or.unc.edu/gfish/labatch.2.html. It performs statistical...
George S. Fishman
CCS
2010
ACM
14 years 10 months ago
Input generation via decomposition and re-stitching: finding bugs in Malware
Attackers often take advantage of vulnerabilities in benign software, and the authors of benign software must search their code for bugs in hopes of finding vulnerabilities before...
Juan Caballero, Pongsin Poosankam, Stephen McCaman...
CORR
2008
Springer
142views Education» more  CORR 2008»
14 years 10 months ago
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
Paul Tarau
IJCSA
2006
95views more  IJCSA 2006»
14 years 9 months ago
Modeling and Formal Verification of DHCP Using SPIN
The Dynamic Host Configuration Protocol (DHCP) is a widely used communication protocol. In this paper, a portion of the protocol is chosen for modeling and verification, namely th...
Syed M. S. Islam, Mohammed H. Sqalli, Sohel Khan