Sciweavers

1058 search results - page 75 / 212
» It's Doomed; We Can Prove It
Sort
View
JSYML
2008
105views more  JSYML 2008»
14 years 9 months ago
Finite state automata and monadic definability of singular cardinals
We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formu...
Itay Neeman
ENTCS
2007
81views more  ENTCS 2007»
14 years 9 months ago
Self-assembling Trees
RCCS is a variant of Milner’s CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in t...
Vincent Danos, Jean Krivine, Fabien Tarissan
IJRR
2002
85views more  IJRR 2002»
14 years 9 months ago
On Motion Planning for Robotic Manipulation with Permanent Rolling Contacts
We address the motion planning problem (open-loop trajectory design) for manipulating rigid bodies with permanent rolling contact without slipping. This problem is related in part...
Bálint Kiss, Jean Lévine, Bél...
IFM
2010
Springer
124views Formal Methods» more  IFM 2010»
14 years 8 months ago
Safe Commits for Transactional Featherweight Java
Abstract. Transactions are a high-level alternative for low-level concurrencycontrol mechanisms such as locks, semaphores, monitors. A recent proposal for integrating transactional...
Thi Mai Thuong Tran, Martin Steffen
JCS
2010
124views more  JCS 2010»
14 years 8 months ago
Verifying resource access control on mobile interactive devices
A model of resource access control is presented in which the access control to resources can employ user interaction to obtain the necessary permissions. This model is inspired by...
Frédéric Besson, Guillaume Dufay, Th...