Sciweavers

75 search results - page 10 / 15
» Abstract Interpretation of Proofs: Classical Propositional C...
Sort
View
135
Voted
VMCAI
2010
Springer
15 years 9 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...
PODC
1990
ACM
15 years 4 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
CORR
2011
Springer
194views Education» more  CORR 2011»
14 years 7 months ago
Polarized Montagovian Semantics for the Lambek-Grishin calculus
Grishin ([10]) proposed enriching the Lambek calculus with multiplicative disjunction (par) and coresiduals. Applications to linguistics were discussed by Moortgat ([15]), who spok...
Arno Bastenhof
ISCI
2006
136views more  ISCI 2006»
15 years 9 days ago
Computing with words for text processing: An approach to the text categorization
The use of the computing with words paradigm for the automatic text documents categorization problem is discussed. This specific problem of information retrieval (IR) becomes more...
Slawomir Zadrozny, Janusz Kacprzyk
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
15 years 7 months ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko