Sciweavers

2517 search results - page 92 / 504
» Specifying Weak Sets
Sort
View
ICALP
2009
Springer
15 years 10 months ago
On Observing Dynamic Prioritised Actions in SOC
We study the impact on observational semantics for SOC of priority mechanisms which combine dynamic priority with local pre-emption. We define manageable notions of strong and wea...
Rosario Pugliese, Francesco Tiezzi, Nobuko Yoshida
CHI
1996
ACM
15 years 9 months ago
A Usability Study of Workspace Awareness Widgets
Groupware systems that use large shared workspaces generally provide only limited awareness information about other collaborators in the workspace. We are designing a set of group...
Carl Gutwin, Mark Roseman
FOCS
1992
IEEE
15 years 9 months ago
Probabilistic Checking of Proofs; A New Characterization of NP
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
Sanjeev Arora, Shmuel Safra
ACSD
2004
IEEE
160views Hardware» more  ACSD 2004»
15 years 9 months ago
Concurrency in Synchronous Systems
In this paper we introduce the notion of weak endochrony, which extends to a synchronous setting the classical theory of Mazurkiewicz traces. The notion is useful in the synthesis ...
Dumitru Potop-Butucaru, Benoît Caillaud, Alb...
ICSE
2000
IEEE-ACM
15 years 9 months ago
Formal specification: a roadmap
Formal specifications have been a focus of software engineering research for many years and have been applied in a wide variety of settings. Their industrial use is still limited ...
Axel van Lamsweerde