Sciweavers

42 search results - page 6 / 9
» Beyond Soundness: On the Semantic Consistency of Executable ...
Sort
View
ZUM
2000
Springer
107views Formal Methods» more  ZUM 2000»
13 years 11 months ago
How to Drive a B Machine
The B-Method is a state-based formal method that describes behaviour in terms of MACHINES whose states change under OPERATIONS. The process algebra CSP is an event-based formalism ...
Helen Treharne, Steve Schneider
COORDINATION
2009
Springer
14 years 8 months ago
Assume-Guarantee Verification of Concurrent Systems
Process algebras are a set of mathematically rigourous languages with well defined semantics that permit modelling behaviour of concurrent and communicating systems. Verification o...
Liliana D'Errico, Michele Loreti
TPHOL
2009
IEEE
14 years 2 months ago
A Better x86 Memory Model: x86-TSO
Abstract. Real multiprocessors do not provide the sequentially consistent memory that is assumed by most work on semantics and verification. Instead, they have relaxed memory mode...
Scott Owens, Susmit Sarkar, Peter Sewell
ACSC
2004
IEEE
13 years 11 months ago
Towards the Completion of the Formal Semantics of OCL 2.0
The Object Constraint Language (OCL) is part of the Unified Modeling Language (UML) to specify restrictions on values of a given UML model. As part of the UML 2.0 standardization ...
Stephan Flake
PERCOM
2010
ACM
13 years 5 months ago
Towards ontology-driven development of applications for smart environments
—In the environments where heterogeneous devices need to share information, utilize services of each other, and participate as components in various smart applications, it is com...
Artem Katasonov, Marko Palviainen