2585 search results - page 357 / 517 » Automating Coherent Logic |
206
click to vote
LICS
2006
IEEE
16 years 1 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
167
click to vote
SAC
2006
ACM
16 years 1 months ago
2006
ACM
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...
184
click to vote
LICS
2005
IEEE
16 years 20 days ago
2005
IEEE
This paper describes an assembly-language type system capable of ensuring memory safety in the presence of both heap and stack allocation. The type system uses linear logic and a ...
161
click to vote
TIME
2005
IEEE
16 years 19 days ago
2005
IEEE
— We provide a novel trace semantics for positive core XPath that exposes all intermediate nodes visited by the query engine. This enables a detailed analysis of all information ...
173
Voted
TPHOL
2005
IEEE
16 years 19 days ago
2005
IEEE
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...