Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
... par Rémi Bastide Spécification comportementale par réseaux de Petri : ... J'ai défini dans ma thèse [Bastide, 92] le formalisme des Objets Coopératifs, que l'on peut présenter comme une unification des paradigmes « Objets... more
... par Rémi Bastide Spécification comportementale par réseaux de Petri : ... J'ai défini dans ma thèse [Bastide, 92] le formalisme des Objets Coopératifs, que l'on peut présenter comme une unification des paradigmes « Objets dans les RdP » et « RdP dans les Objets ». ...
Page 1. xvi Reviewers Gul Agha Tamio Arai Doo-Hwan Bae Farokh B. Bastani Elisa Bertino Marion Ceruti Ing-Ray Chen Jackie CY Chen Randy Chow P. Chuang Jen-Yao Chung P. Ciancarini B. Cukic Klaus-Peter Eckert S. Eisenbach Domenico Ferrari M.... more
Page 1. xvi Reviewers Gul Agha Tamio Arai Doo-Hwan Bae Farokh B. Bastani Elisa Bertino Marion Ceruti Ing-Ray Chen Jackie CY Chen Randy Chow P. Chuang Jen-Yao Chung P. Ciancarini B. Cukic Klaus-Peter Eckert S. Eisenbach Domenico Ferrari M. Fisher Masahiro Fujita Akira Fukuda V. Garg Arif Ghafoor A. Ghose Sumit Ghosh Michel Gien V. Gobel Teruo Higashino David Hislop Ichiro Iida Makoto Imase Yoshihide Ishiguro Koji Ito Yoshiaki Kakuda Kane Kim Hermann Kopetz Jeff Kramer L. LeLann Chung-Shyan Liu Michael Lyu ...
Physical devices are increasingly regulated by embedded computers rather than analog controllers. Embedded computers are essentially computational engines capable of sensing the environment, actuating physical devices, carrying out data... more
Physical devices are increasingly regulated by embedded computers rather than analog controllers. Embedded computers are essentially computational engines capable of sensing the environment, actuating physical devices, carrying out data analysis and planning actions. Embedded computers can thus enable machines to become intelligent and autonomous. The next technological revolution will follow from the ability of intelligent machines to network with other
Research Interests:
We present a theory of may testing for asynchronous calculi with locality and no name matching. Locality is a non-interference property that is common in systems based on object-paradigm. Concurrent languages such as Join and Pict... more
We present a theory of may testing for asynchronous calculi with locality and no name matching. Locality is a non-interference property that is common in systems based on object-paradigm. Concurrent languages such as Join and Pict disallow name matching, which is akin to pointer comparison in imperative languages, to provide for an abstract semantics that would allow useful program transformations.
Page 1. -5s An Overview of Actor Languages Gul Agha ... As in other object-oriented languages, actors en-capsulate procedural and declarative information into a single entity. Primitive actor languages are based on a pure message-passing... more
Page 1. -5s An Overview of Actor Languages Gul Agha ... As in other object-oriented languages, actors en-capsulate procedural and declarative information into a single entity. Primitive actor languages are based on a pure message-passing semantics. ...
Part 1 Language issues: abstraction and modularity mechanisms for concurrent computing, Gul Agha et al trade-offs between reasoning and modelling, Peter Wegner a survey of logic programming-based object-oriented languages, Andrew Davison... more
Part 1 Language issues: abstraction and modularity mechanisms for concurrent computing, Gul Agha et al trade-offs between reasoning and modelling, Peter Wegner a survey of logic programming-based object-oriented languages, Andrew Davison analysis of inheritance anomaly in object-oriented concurrent programming languages, Satoshi Matsuoka and Akinori Yonezawa composing active objects, Oscar Nierstrasz. Part 2 Programming constructs: supporting modularity in highly-parallel programs, Andrew A. Chien multiple-concurrency control policies in an object-oriented programming system, Gail E. Kaiser et al ports for objects in concurrent logic programs, Sverker Janson et al. Part 3 Language design: specifying concurrent languages and systems with "delta"-grammars, Simon M. Kaplan et al interaction abstract machines, Jean-Marc Andreoli et al CC++ - a declarative concurrent object-oriented programming notation, K. Mani Chandy and Carl Kesselman a logical theory of concurrent objects a...
... V. Kumar, 2 G. Agha, 3 and C. Tomlinson 4 ... 1. t~ (where e stands for essential), which is the time spent on com-putations that would also be performed by an optimal sequential algorithm; and, 2. t~ (where o stands for overhead),... more
... V. Kumar, 2 G. Agha, 3 and C. Tomlinson 4 ... 1. t~ (where e stands for essential), which is the time spent on com-putations that would also be performed by an optimal sequential algorithm; and, 2. t~ (where o stands for overhead), which is the sum of time spent on communication ...
ABSTRACT Without Abstract
ABSTRACT
ABSTRACT

And 135 more