Sciweavers

349 search results - page 30 / 70
» The feature construct for SMV: Semantics
Sort
View
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
16 years 3 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
GFKL
2007
Springer
180views Data Mining» more  GFKL 2007»
16 years 22 days ago
Content-based Dimensionality Reduction for Recommender Systems
Recommender Systems are gaining widespread acceptance in e-commerce applications to confront the information overload problem. Collaborative Filtering (CF) is a successful recommen...
Panagiotis Symeonidis
RTA
2007
Springer
16 years 20 days ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...
PPDP
2009
Springer
15 years 11 months ago
Context-based proofs of termination for typed delimited-control operators
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
Malgorzata Biernacka, Dariusz Biernacki
IJAIT
2006
136views more  IJAIT 2006»
15 years 6 months ago
Model Checking for Multiagent Systems: the Mable Language and its Applications
We present MABLE, a fully implemented programming language for multiagent systems, which is intended to support the automatic verification of such systems via model checking. In a...
Michael Wooldridge, Marc-Philippe Huget, Michael F...