Sciweavers

310 search results - page 6 / 62
» Sound and complete models of contracts
Sort
View
CONCUR
2006
Springer
13 years 11 months ago
A Complete Axiomatic Semantics for the CSP Stable-Failures Model
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been gi...
Yoshinao Isobe, Markus Roggenbach
UML
2004
Springer
14 years 1 months ago
SoftContract: Model-Based Design of Error-Checking Code and Property Monitors
This paper discusses a model-based design flow for requirements in distributed embedded software development. Such requirements are specified using a language similar to Linear T...
Luciano Lavagno, Marco Di Natale, Alberto Ferrari,...
AMAI
2002
Springer
13 years 7 months ago
A Complete Axiomatization for Blocks World
Blocks World (BW) has been one of the most popular model domains in AI history. However, there has not been serious work on axiomatizing the state constraints of BW and giving jus...
Stephen A. Cook, Yongmei Liu
SP
1998
IEEE
162views Security Privacy» more  SP 1998»
13 years 12 months ago
Complete, Safe Information Flow with Decentralized Labels
The growing use of mobile code in downloaded applications and servlets has increased interest in robust mechanisms for ensuring privacy and secrecy. Information flow control is in...
Andrew C. Myers, Barbara Liskov
ECOWS
2008
Springer
13 years 9 months ago
Beyond Soundness: On the Semantic Consistency of Executable Process Models
Executable business process models build on the specification of process activities, their implemented business functions (e.g., Web services) and the control flow between these a...
Ingo Weber, Jörg Hoffmann, Jan Mendling