150 search results - page 19 / 30 » A Functorial Framework for Constraint Normal Logic Programmi... |
WWW
2006
ACM
14 years 8 months ago
2006
ACM
The need of formal verification is a problem that involves all the fields in which sensible data are managed. In this context the verification of data streams became a fundamental...
EPIA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The two puzzles are the Lottery Paradox and the Amalgamation Paradox, which both point out difficulties for aggregating uncertain information. A generalization of the lot...
PPDP
2007
Springer
14 years 1 months ago
2007
Springer
Static analyses provide the semantic foundation for tools ranging from optimizing compilers to refactoring browsers and advanced debuggers. Unfortunately, developing new analysis ...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
ISMVL
2000
IEEE
13 years 12 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...