Sciweavers

MPC
2010
Springer
164views Mathematics» more  MPC 2010»
13 years 9 months ago
On Automated Program Construction and Verification
Rudolf Berghammer, Georg Struth
MPC
2010
Springer
177views Mathematics» more  MPC 2010»
13 years 9 months ago
Adjoint Folds and Unfolds
Abstract. Folds and unfolds are at the heart of the algebra of programming. They allow the cognoscenti to derive and manipulate programs rigorously and effectively. Fundamental la...
Ralf Hinze
MPC
2010
Springer
159views Mathematics» more  MPC 2010»
13 years 9 months ago
Subtyping, Declaratively
Abstract. It is natural to present subtyping for recursive types coinductively. However, Gapeyev, Levin and Pierce have noted that there is a problem with coinductive definitions ...
Nils Anders Danielsson, Thorsten Altenkirch
MPC
2010
Springer
157views Mathematics» more  MPC 2010»
13 years 9 months ago
The Logic of Large Enough
Abstract. In this paper we explore the “for large enough” quantifier, also known as “all but finitely many”, which plays a central role in asymptotic reasoning, as used f...
Eerke A. Boiten, Dan Grundy
MPC
2010
Springer
172views Mathematics» more  MPC 2010»
13 years 9 months ago
Temporal Logic Verification of Lock-Freedom
Bogdan Tofan, Simon Bäumler, Gerhard Schellho...
MPC
2010
Springer
181views Mathematics» more  MPC 2010»
13 years 9 months ago
Process Algebras for Collective Dynamics
d Abstract) Jane Hillston Laboratory for Foundations of Computer Science, The University of Edinburgh, Scotland Quantitative Analysis Stochastic process algebras extend classical p...
Jane Hillston
MPC
2010
Springer
157views Mathematics» more  MPC 2010»
13 years 9 months ago
Formal Derivation of Concurrent Garbage Collectors
Concurrent garbage collectors are notoriously difficult to implement correctly. Previous approaches to the issue of producing correct collectors have mainly been based on posit-and...
Dusko Pavlovic, Peter Pepper, Douglas R. Smith