1073 search results - page 89 / 215 » Formal Program Development with Approximations |
143
click to vote
SAS
2010
Springer
15 years 3 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
161
click to vote
ISSTA
2010
ACM
15 years 6 months ago
2010
ACM
Writing reliable software is difficult. It becomes even more difficult when writing scientific software involving floating-point numbers. Computers provide numbers with limite...
155
click to vote
EOR
2010
15 years 4 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
154
click to vote
RTA
2010
Springer
15 years 8 months ago
2010
Springer
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...
119
click to vote
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automate...