Sciweavers

8132 search results - page 112 / 1627
» Dependability, Abstraction, and Programming
Sort
View
ICALP
2011
Springer
14 years 10 months ago
Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
act Interpretation SILVIA CRAFA FRANCESCO RANZATO University of Padova, Italy We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the...
Silvia Crafa, Francesco Ranzato
FOSSACS
2009
Springer
16 years 1 months ago
Full Abstraction for Reduced ML
traction for Reduced ML Andrzej S. Murawski and Nikos Tzevelekos Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, UK We present the first effe...
Andrzej S. Murawski, Nikos Tzevelekos
ICALP
2011
Springer
14 years 10 months ago
Liveness-Preserving Atomicity Abstraction
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
Alexey Gotsman, Hongseok Yang
TYPES
2007
Springer
16 years 16 days ago
Dependently Sorted Logic
Abstract. We propose syntax and semantics for systems of intuitionistic and classical first order dependently sorted logic, with and withlity, retaining type dependency, but other...
João Filipe Belo
FPCA
1995
15 years 10 months ago
Abstract Models of Memory Management
Models of Memory Management Greg Morrisett Matthias Felleisen Robert Harper January 1995 CMU{CS{95{110 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Al...
J. Gregory Morrisett, Matthias Felleisen, Robert H...