Sciweavers

3001 search results - page 200 / 601
» Recursive type generativity
Sort
View
179
Voted
ATVA
2009
Springer
172views Hardware» more  ATVA 2009»
16 years 1 months ago
Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation
Abstract. The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivate...
Yang Zhao, Gianfranco Ciardo
198
Voted
ICAS
2008
IEEE
181views Robotics» more  ICAS 2008»
16 years 1 months ago
Modeling User Interfaces to Workflow Information Systems
This paper addresses the need for designing user interfaces (UIs) to workflow information systems by adopting a model-centric approach. We introduce a conceptual workflow model to...
Josefina Guerrero García, Jean Vanderdonckt...
COLT
2006
Springer
15 years 10 months ago
Learning Rational Stochastic Languages
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
François Denis, Yann Esposito, Amaury Habra...
243
Voted
CSCLP
2008
Springer
15 years 8 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin
OSDI
1994
ACM
15 years 8 months ago
Distributed Filaments: Efficient Fine-Grain Parallelism on a Cluster of Workstations
A fine-grain parallel program is one in which processes are typically small, ranging from a few to a few hundred instructions. Fine-grain parallelism arises naturally in many situ...
Vincent W. Freeh, David K. Lowenthal, Gregory R. A...