Sciweavers

525 search results - page 25 / 105
» Using Checkable Types in Automatic Protocol Analysis
Sort
View
FMOODS
2006
13 years 9 months ago
Bounded Analysis and Decomposition for Behavioural Descriptions of Components
Abstract. Explicit behavioural interfaces are now accepted as a mandatory feature of components to address architectural analysis. Behavioural interface description languages shoul...
Pascal Poizat, Jean-Claude Royer, Gwen Salaün
ATAL
2006
Springer
13 years 11 months ago
A novel method for automatic strategy acquisition in N-player non-zero-sum games
We present a novel method for automatically acquiring strategies for the double auction by combining evolutionary optimization together with a principled game-theoretic analysis. ...
Steve Phelps, Marek Marcinkiewicz, Simon Parsons
PLDI
2011
ACM
12 years 10 months ago
EnerJ: approximate data types for safe and general low-power computation
Energy is increasingly a first-order concern in computer systems. Exploiting energy-accuracy trade-offs is an attractive choice in applications that can tolerate inaccuracies. Re...
Adrian Sampson, Werner Dietl, Emily Fortuna, Danus...
POPL
2010
ACM
14 years 5 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
EMNLP
2008
13 years 9 months ago
A Japanese Predicate Argument Structure Analysis using Decision Lists
This paper describes a new automatic method for Japanese predicate argument structure analysis. The method learns relevant features to assign case roles to the argument of the tar...
Hirotoshi Taira, Sanae Fujita, Masaaki Nagata