50 search results - page 7 / 10 » A Theoretical Foundation of Program Synthesis by Equivalent ... |
TCS
2010
13 years 6 months ago
2010
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
We lay a foundation for modeling and validation of asynchronous designs in a multi-clock synchronous programming model. This allows us to study properties of globally asynchronous...
PODS
2005
ACM
14 years 7 months ago
2005
ACM
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
JMLR
2012
11 years 10 months ago
2012
Metric and kernel learning arise in several machine learning applications. However, most existing metric learning algorithms are limited to learning metrics over low-dimensional d...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...