Sciweavers

1018 search results - page 164 / 204
» Abstraction and Refinement in Model Checking
Sort
View
DEON
2010
Springer
14 years 13 days 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...
CONCUR
2009
Springer
14 years 8 days ago
Concurrent Kleene Algebra
Abstract. A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and concurrent composition, related by an inequational form of the exchange la...
C. A. R. Hoare, Bernhard Möller, Georg Struth...
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
14 years 5 days ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...
FSTTCS
2001
Springer
14 years 4 days ago
Computability and Complexity Results for a Spatial Assertion Language for Data Structures
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
Cristiano Calcagno, Hongseok Yang, Peter W. O'Hear...
ATVA
2009
Springer
141views Hardware» more  ATVA 2009»
13 years 11 months ago
Formal Verification for High-Assurance Behavioral Synthesis
We present a framework for certifying hardware designs generated through behavioral synthesis, by using formal verification to certify the associated synthesis transformations. We ...
Sandip Ray, Kecheng Hao, Yan Chen, Fei Xie, Jin Ya...