Sciweavers

144 search results - page 13 / 29
» How Expressions Can Code for Automata
Sort
View
SAS
1993
Springer
139views Formal Methods» more  SAS 1993»
15 years 4 months ago
Compiling FX on the CM-2
Type and effect systems provide a safe and effective means of programming high-performance parallel computers with a high-level language that integrates both functional and impe...
Jean-Pierre Talpin, Pierre Jouvelot
RTSS
2008
IEEE
15 years 6 months ago
A Multi-mode Real-Time Calculus
The Real-Time Calculus (RTC) framework proposed in [Chakraborty et al., DATE 2003] and subsequently extended in [Wandeler et al., Real-Time Systems 29(2-3), 2005] and a number of ...
Linh T. X. Phan, Samarjit Chakraborty, P. S. Thiag...
PLDI
2005
ACM
15 years 6 months ago
Jungloid mining: helping to navigate the API jungle
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We obser...
David Mandelin, Lin Xu, Rastislav Bodík, Do...
91
Voted
ICIP
2005
IEEE
16 years 2 months ago
Correlation estimation for distributed source coding under information exchange constraints
Distributed source coding (DSC) depends strongly on accurate knowledge of correlation between sources. Previous works have reported capacity-approaching code constructions when ex...
Ngai-Man Cheung, Huisheng Wang, Antonio Ortega
76
Voted
CONCUR
2007
Springer
15 years 6 months ago
Making Random Choices Invisible to the Scheduler
Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to res...
Konstantinos Chatzikokolakis, Catuscia Palamidessi