1005 search results - page 121 / 201 » Operational Semantics and Program Equivalence |
285
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
173
click to vote
IFM
2007
Springer
16 years 10 days ago
2007
Springer
We present an approach to modelling Abadi–Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operatio...
247
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
152
click to vote
PPDP
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we design a language and runtime support for isolation-only, multithreaded transactions (called tasks). Tasks allow isolation to be declared instead of having to be ...
166
click to vote
LOGCOM
2007
15 years 6 months ago
2007
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...