Sciweavers

13383 search results - page 311 / 2677
» Abstractions from proofs
Sort
View
CAV
2003
Springer
140views Hardware» more  CAV 2003»
15 years 12 months ago
Certifying Optimality of State Estimation Programs
Abstract. The theme of this paper is certifying software for state estimation of dynamic systems, which is an important problem found in spacecraft, aircraft, geophysical, and in m...
Grigore Rosu, Ram Prasad Venkatesan, Jon Whittle, ...
ICTCS
2003
Springer
15 years 12 months ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
CSL
2001
Springer
15 years 11 months ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
Frédéric Koriche
TLCA
1993
Springer
15 years 10 months ago
Recursive Types Are not Conservative over F
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...
Giorgio Ghelli
219
Voted
PODC
1990
ACM
15 years 10 months ago
Half-Order Modal Logic: How to Prove Real-Time Properties
Abstract. We introduce a novel extension of propositional modal logic that is interpreted over Kripke structures in which a value is associated with every possible world. These val...
Thomas A. Henzinger