Sciweavers

949 search results - page 158 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
146
Voted
POPL
2012
ACM
13 years 10 months ago
Deciding choreography realizability
Since software systems are becoming increasingly more concurrent and distributed, modeling and analysis of interactions among their components is a crucial problem. In several app...
Samik Basu, Tevfik Bultan, Meriem Ouederni
GECCO
2010
Springer
153views Optimization» more  GECCO 2010»
15 years 5 months ago
Multi-task evolutionary shaping without pre-specified representations
Shaping functions can be used in multi-task reinforcement learning (RL) to incorporate knowledge from previously experienced tasks to speed up learning on a new task. So far, rese...
Matthijs Snel, Shimon Whiteson
VLSID
2002
IEEE
152views VLSI» more  VLSID 2002»
16 years 2 months ago
Verification of an Industrial CC-NUMA Server
Directed test program-based verification or formal verification methods are usually quite ineffective on large cachecoherent, non-uniform memory access (CC-NUMA) multiprocessors b...
Rajarshi Mukherjee, Yozo Nakayama, Toshiya Mima
LICS
2008
IEEE
15 years 8 months ago
Structural Logical Relations
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...
Carsten Schürmann, Jeffrey Sarnat
TASE
2009
IEEE
15 years 9 months ago
Fault-Based Test Case Generation for Component Connectors
The complex interactions appearing in service-oriented computing make coordination a key concern in serviceoriented systems. In this paper, we present a fault-based method to gene...
Bernhard K. Aichernig, Farhad Arbab, Lacramioara A...