Sciweavers

1472 search results - page 276 / 295
» On Model Checking Infinite-State Systems
Sort
View
102
Voted
HIPC
2007
Springer
15 years 1 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
FASE
2006
Springer
15 years 1 months ago
Formal Simulation and Analysis of the CASH Scheduling Algorithm in Real-Time Maude
This paper describes the application of the Real-Time Maude tool to the formal specification and analysis of the CASH scheduling algorithm and its suggested modifications. The CASH...
Peter Csaba Ölveczky, Marco Caccamo
ERLANG
2008
ACM
14 years 11 months ago
Testing Erlang data types with quviq quickcheck
When creating software, data types are the basic bricks. Most of the time a programmer will use data types defined in library modules, therefore being tested by many users over ma...
Thomas Arts, Laura M. Castro, John Hughes
78
Voted
IJCAI
2007
14 years 11 months ago
Tractable Temporal Reasoning
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
Clare Dixon, Michael Fisher, Boris Konev
WSCG
2004
282views more  WSCG 2004»
14 years 10 months ago
High-Quality Silhouette Illustration for Texture-Based Volume Rendering
We present an accurate, interactive silhouette extraction mechanism for texture-based volume rendering. Compared to previous approaches, our system guarantees silhouettes of a use...
Zoltán Nagy, Reinhard Klein