Sciweavers

1472 search results - page 243 / 295
» On Model Checking Infinite-State Systems
Sort
View
131
Voted
AAAI
2006
15 years 3 months ago
Fast SAT-based Answer Set Solver
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
Zhijun Lin, Yuanlin Zhang, Hector Hernandez
DAGSTUHL
1997
15 years 3 months ago
Fast and Accurate Collision Detection for Virtual Environments
A realistic simulation system, which couples geometry and physics, can provide a useful toolkit for virtual environments. Interactions among moving objects in the virtual worlds a...
Ming C. Lin
PLDI
2012
ACM
13 years 4 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
TACAS
1998
Springer
81views Algorithms» more  TACAS 1998»
15 years 5 months ago
Formal Design and Analysis of a Gear Controller
In this paper, we report on an application of the validation and veri cation tool kit Uppaal in the design and analysis of a prototype gear controller, carried out in a joint proje...
Magnus Lindahl, Paul Pettersson, Wang Yi
ECOOP
2010
Springer
15 years 6 months ago
Capabilities for Uniqueness and Borrowing
Abstract. An important application of unique object references is safe and efficient message passing in concurrent object-oriented programming. However, to prevent the ill effects...
Philipp Haller, Martin Odersky