Sciweavers

384 search results - page 56 / 77
» On the Semantics of Markov Automata
Sort
View
ESOP
2001
Springer
15 years 6 months ago
What Are Polymorphically-Typed Ambients?
The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code [CG98]. We consider an Ambient Calculus where ambients...
Torben Amtoft, A. J. Kfoury, Santiago M. Peric&aac...
EMSOFT
2006
Springer
15 years 5 months ago
Mixing signals and modes in synchronous data-flow systems
Synchronous data-flow languages such as Scade/Lustre manage infinite sequences, or streams, as primitive values making them naturally adapted to the description of datadominated s...
Jean-Louis Colaço, Grégoire Hamon, M...
ITA
2007
153views Communications» more  ITA 2007»
15 years 1 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
CL
2002
Springer
15 years 1 months ago
Orderly communication in the Ambient Calculus
The Ambient Calculus (henceforth, AC) was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code [9]. We present a type system for AC ...
Torben Amtoft, A. J. Kfoury, Santiago M. Peric&aac...
153
Voted
TC
2010
14 years 8 months ago
Generating Reliable Code from Hybrid-Systems Models
Hybrid systems have emerged as an appropriate formalism to model embedded systems as they capture the theme of continuous dynamics with discrete control. Under this paradigm, distr...
Madhukar Anand, Sebastian Fischmeister, Yerang Hur...