Sciweavers

1796 search results - page 266 / 360
» An Approach to Compositional Model Checking
Sort
View
POPL
2011
ACM
12 years 11 months ago
Safe nondeterminism in a deterministic-by-default parallel language
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
Robert L. Bocchino Jr., Stephen Heumann, Nima Hona...
HASE
2008
IEEE
14 years 2 months ago
On the Integrity of Lightweight Checkpoints
This paper proposes a lightweight checkpointing scheme for real-time embedded systems. The goal is to separate concerns by allowing applications to take checkpoints independently ...
Raul Barbosa, Johan Karlsson
ACSD
2006
IEEE
80views Hardware» more  ACSD 2006»
14 years 2 months ago
Schedulability Analysis of Petri Nets Based on Structural Properties
A schedule of a Petri Net (PN) represents a set of firing sequences that can be infinitely repeated within a bounded state space, regardless of the outcomes of the nondeterminis...
Cong Liu, Alex Kondratyev, Yosinori Watanabe, Albe...
CIA
2003
Springer
14 years 1 months ago
Organisational Change: Deliberation and Modification
Abstract For an information-agent-based system to support virtual (Internet-supported) organisations, changes in environmental conditions often demand changes in organisational beh...
Catholijn M. Jonker, Martijn C. Schut, Jan Treur
ICALP
2001
Springer
14 years 19 days ago
Symbolic Trace Analysis of Cryptographic Protocols
A cryptographic protocol can be described as a system of concurrent processes, and analysis of the traces generated by this system can be used to verify authentication and secrecy ...
Michele Boreale