Sciweavers

1710 search results - page 181 / 342
» High-Level Programs and Program Conditions
Sort
View
CP
2009
Springer
14 years 9 months ago
SOGgy Constraints: Soft Open Global Constraints
We investigate soft open constraints. We generalize and unify classes of soft constraints and adapt them to the open setting. We give sufficient conditions for generalized classes ...
Michael J. Maher
ICALP
2009
Springer
14 years 8 months ago
Weak Alternating Timed Automata
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
Pawel Parys, Igor Walukiewicz
TLDI
2003
ACM
121views Formal Methods» more  TLDI 2003»
14 years 1 months ago
Types for atomicity
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected and nondeterministic interactions between threads. Previous work has addresse...
Cormac Flanagan, Shaz Qadeer
ISCAS
1999
IEEE
66views Hardware» more  ISCAS 1999»
14 years 19 days ago
Low energy register allocation beyond basic blocks
An approach of doing register allocation beyond basic blocks for low energy is presented in this paper. With careful analysis of boundary conditions between consecutive blocks, ou...
Yumin Zhang, Xiaobo Hu, Danny Z. Chen
IANDC
2006
99views more  IANDC 2006»
13 years 8 months ago
Recursive coalgebras from comonads
We discuss Osius's [22] concept of a recursive coalgebra of a functor from the perspective of programming semantics and give some new sufficient conditions for the recursiven...
Venanzio Capretta, Tarmo Uustalu, Varmo Vene