Sciweavers

4480 search results - page 43 / 896
» Prototyping Completion with Constraints Using Computational ...
Sort
View
146
Voted
CORR
2011
Springer
115views Education» more  CORR 2011»
14 years 7 months ago
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amra...
121
Voted
WMCSA
2002
IEEE
15 years 8 months ago
The Event Heap: A Coordination Infrastructure for Interactive Workspaces
Coordinating the interactions of applications running on the diversity of both mobile and embedded devices that will be common in ubiquitous computing environments is still a diff...
Brad Johanson, Armando Fox
126
Voted
CHI
2005
ACM
16 years 3 months ago
Sketch-based rapid prototyping platform for hardware-software integrated interactive products
This paper presents a platform in which interaction designers can effectively and rapidly develop tangible interactive prototypes by sketching. The study aims to build a platform ...
Tek-Jin Nam
143
Voted
ENTCS
2007
158views more  ENTCS 2007»
15 years 3 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
104
Voted
CP
2006
Springer
15 years 7 months ago
The ROOTS Constraint
A wide range of counting and occurrence constraints can be specified with just two global primitives: the Range constraint, which computes the range of values used by a sequence of...
Christian Bessière, Emmanuel Hebrard, Brahi...