Sciweavers

503 search results - page 38 / 101
» Interpolative Boolean Logic
Sort
View
128
Voted
CONCUR
2005
Springer
15 years 6 months ago
A New Modality for Almost Everywhere Properties in Timed Automata
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
Houda Bel Mokadem, Béatrice Bérard, ...
120
Voted
FCT
2005
Springer
15 years 6 months ago
A Self-dependency Constraint in the Simply Typed Lambda Calculus
We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which inc...
Aleksy Schubert
90
Voted
CIE
2010
Springer
15 years 5 months ago
Haskell before Haskell: Curry's Contribution to Programming (1946-1950)
This paper discusses Curry’s work on how to implement the problem of inverse interpolation on the ENIAC (1946) and his subsequent work on developing a theory of program compositi...
Liesbeth De Mol, Maarten Bullynck, Martin Carl&eac...
109
Voted
VMCAI
2004
Springer
15 years 6 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
129
Voted
ATAL
2009
Springer
15 years 7 months ago
Boolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
Piotr Faliszewski, Edith Elkind, Michael Wooldridg...