Sciweavers

783 search results - page 91 / 157
» Compositional Reasoning in Model Checking
Sort
View
DEON
2010
Springer
15 years 7 months ago
Privacy Policies with Modal Logic: The Dynamic Turn
Abstract. Privacy policies are often defined in terms of permitted messages. Instead, in this paper we derive dynamically the permitted messages from static privacy policies defi...
Guillaume Aucher, Guido Boella, Leendert van der T...
FMICS
2006
Springer
15 years 6 months ago
SAT-Based Verification of LTL Formulas
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
Wenhui Zhang
TPHOL
1998
IEEE
15 years 6 months ago
Co-inductive Axiomatization of a Synchronous Language
Abstract. Over the last decade, the increasing demand for the validation of safety critical systems lead to the development of domain-specific programming languages (e.g. synchrono...
David Nowak, Jean-René Beauvais, Jean-Pierr...
ICFEM
2007
Springer
15 years 6 months ago
Testing for Refinement in CSP
Abstract. CSP is a well-established formalism for modelling and verification of concurrent reactive systems based on refinement. Consolidated denotational models and an effective t...
Ana Cavalcanti, Marie-Claude Gaudel
DSOM
2004
Springer
15 years 7 months ago
A Formal Validation Model for the Netconf Protocol
Netconf is a protocol proposed by the IETF that defines a set of operations for network configuration. One of the main issues of Netconf is to define operations such as validate...
Sylvain Hallé, Rudy Deca, Omar Cherkaoui, R...