Sciweavers

13383 search results - page 231 / 2677
» Abstractions from proofs
Sort
View
AGP
1995
IEEE
15 years 10 months ago
A Prolog Implementation of Kem
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
Alberto Artosi, Paola Cattabriga, Guido Governator...
BMCBI
2008
111views more  BMCBI 2008»
15 years 6 months ago
SciDBMaker: new software for computer-aided design of specialized biological databases
Background: The exponential growth of research in molecular biology has brought concomitant proliferation of databases for stocking its findings. A variety of protein sequence dat...
Riadh Hammami, Abdelmajid Zouhir, Karim Naghmouchi...
PADL
2007
Springer
16 years 23 days ago
Aspect-Oriented Programming in Higher-Order and Linear Logic
Essential elements of aspect-oriented programming can be formulated as forms of logic programming. Extensions of Horn Clause rovide richer abstraction and control mechanisms. Defi...
Chuck C. Liang
ESOP
2004
Springer
16 years 11 hour ago
Static Analysis of Digital Filters
We present an Abstract Interpretation-based framework for automatically analyzing programs containing digital filters. Our framework allows refining existing analyses so that the...
Jérôme Feret
165
Voted
FSTTCS
2001
Springer
15 years 11 months ago
Rewrite Closure for Ground and Cancellative AC Theories
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
Ashish Tiwari