Sciweavers

1894 search results - page 301 / 379
» A TLA Proof System
Sort
View
IFM
2007
Springer
15 years 10 months ago
Qualitative Probabilistic Modelling in Event-B
Abstract. Event-B is a notation and method for discrete systems modelling by refinement. We introduce a small but very useful construction: qualitative probabilistic choice. It ex...
Stefan Hallerstede, Thai Son Hoang
TLCA
2007
Springer
15 years 10 months ago
Strong Normalization and Equi-(Co)Inductive Types
e type system for the l—m˜d—E™—l™ulus enri™hed with re™urE sive —nd ™ore™ursive fun™tions over equiEindu™tive —nd E™oindu™tive types is presented in whi™h —ll wel...
Andreas Abel
UCS
2007
Springer
15 years 10 months ago
Activity Recognition Based on Intra and Extra Manipulation of Everyday Objects
Recognizing activities based on an actor’s interaction with everyday objects is an important research approach within ubiquitous computing. We present a recognition approach whic...
Dipak Surie, Fabien Lagriffoul, Thomas Pederson, D...
CCGRID
2006
IEEE
15 years 10 months ago
Closing Cluster Attack Windows Through Server Redundancy and Rotations
— It is well-understood that increasing redundancy in a system generally improves the availability and dependability of the system. In server clusters, one important form of redu...
Yih Huang, David Arsenault, Arun Sood
PLDI
2006
ACM
15 years 9 months ago
Specifying distributed trust management in LolliMon
We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework...
Jeff Polakow, Christian Skalka