Sciweavers

62 search results - page 9 / 13
» EPR-Based Bounded Model Checking at Word Level
Sort
View
VISUALIZATION
1997
IEEE
13 years 11 months ago
Simplifying polygonal models using successive mappings
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...
Jonathan D. Cohen, Dinesh Manocha, Marc Olano
WRLA
2010
13 years 5 months ago
The Linear Temporal Logic of Rewriting Maude Model Checker
Abstract. This paper presents the foundation, design, and implementation of the Linear Temporal Logic of Rewriting model checker as an extension of the Maude system. The Linear Tem...
Kyungmin Bae, José Meseguer
AAAI
2008
13 years 9 months ago
Unknown Rewards in Finite-Horizon Domains
"Human computation" is a recent approach that extracts information from large numbers of Web users. reCAPTCHA is a human computation project that improves the process of...
Colin McMillen, Manuela M. Veloso
IANDC
2007
107views more  IANDC 2007»
13 years 7 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
ENTCS
2007
140views more  ENTCS 2007»
13 years 7 months ago
Secured Information Flow for Asynchronous Sequential Processes
We present in this article a precise security model for data confidentiality in the framework of ASP (Asynchronous Sequential Processes). ASP is based on active objects, asynchro...
Isabelle Attali, Denis Caromel, Ludovic Henrio, Fe...