Sciweavers

1916 search results - page 131 / 384
» Reasoning with class algebra
Sort
View
CSL
2004
Springer
15 years 6 months ago
Predicate Transformers and Linear Logic: Yet Another Denotational Model
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...
Pierre Hyvernat
104
Voted
ICS
1999
Tsinghua U.
15 years 5 months ago
High-level semantic optimization of numerical codes
This paper presents a mathematical framework to exploit the semantic properties of matrix operations in loop-based numerical codes. The heart of this framework is an algebraic lan...
Vijay Menon, Keshav Pingali
93
Voted
APSEC
2003
IEEE
15 years 4 months ago
Modular refinement in novel schema calculi
Using the language Z for more than specification is hindered by the fact that its algebra of schemas is not monotonic with respect to refinement; so specification is modular, but ...
Moshe Deutsch, Martin C. Henson, Besnik Kajtazi
ENTCS
2008
102views more  ENTCS 2008»
15 years 26 days ago
A Monotonicity Principle for Information Theory
We establish a monotonicity principle for convex functions that enables high-level reasoning about capacity in information theory. Despite its simplicity, this single idea is rema...
Konstantinos Chatzikokolakis, Keye Martin
127
Voted
AAAI
2011
14 years 24 days ago
Controlling Selection Bias in Causal Inference
Selection bias, caused by preferential exclusion of samples from the data, is a major obstacle to valid causal and statistical inferences; it cannot be removed by randomized exper...
Elias Bareinboim, Judea Pearl