Sciweavers

2944 search results - page 273 / 589
» Robust Semantic Construction
Sort
View
FAC
2010
259views more  FAC 2010»
15 years 5 months ago
An algebraic approach to the design of compilers for object-oriented languages
Here we describe an algebraic approach to constructing a provably correct compiler for an object-oriented language called ROOL. We tackle the problem of compiler correctness by red...
Adolfo Duran, Ana Cavalcanti, Augusto Sampaio
SPIN
2010
Springer
15 years 5 months ago
Nevertrace Claims for Model Checking
In this paper, we propose the nevertrace claim, which is a new construct for specifying the correctness properties that either finite or infinite execution traces (i.e., sequence...
Zhe Chen, Gilles Motet
TCS
2010
15 years 5 months ago
Comparing free algebras in Topological and Classical Domain Theory
We compare how computational effects are modelled in Classical Domain Theory and Topological Domain Theory. Both of these theories provide powerful toolkits for denotational sema...
Ingo Battenfeld
ICFP
2008
ACM
16 years 6 months ago
Transactional events for ML
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows ...
Laura Effinger-Dean, Matthew Kehrt, Dan Grossman
WSDM
2010
ACM
227views Data Mining» more  WSDM 2010»
16 years 4 months ago
Folks in folksonomies: Social link prediction from shared metadata
Web 2.0 applications have attracted a considerable amount of attention because their open-ended nature allows users to create lightweight semantic scaffolding to organize and shar...
Rossano Schifanella, Alain Barrat, Ciro Cattuto, B...