Sciweavers

348 search results - page 54 / 70
» Verification of Language Based Fault-Tolerance
Sort
View
73
Voted
ASM
2008
ASM
14 years 11 months ago
Model Checking Event-B by Encoding into Alloy
As systems become ever more complex, verification becomes more main stream. Event-B and Alloy are two formal specification languages based on fairly different methodologies. While...
Paulo J. Matos, João Marques-Silva
IWFM
1998
14 years 11 months ago
Formal Engineering of the Bitonic Sort using PVS
In this paper, we present a proof that the bitonic sort is sound using PVS, a powerful specification and verification environment. First, we briefly introduce this well-known para...
Raphaël Couturier
SP
2008
IEEE
134views Security Privacy» more  SP 2008»
14 years 9 months ago
Expressive Declassification Policies and Modular Static Enforcement
This paper provides a way to specify expressive declassification policies, in particular, when, what, and where policies that include conditions under which downgrading is allowed...
Anindya Banerjee, David A. Naumann, Stan Rosenberg
85
Voted
IJAOSE
2010
126views more  IJAOSE 2010»
14 years 7 months ago
Automated analysis of compositional multi-agent systems
An approach for handling the complex dynamics of a multi-agent system is based on distinguishing aggregation levels. The behaviour at a given aggregation level is specified by a se...
Alexei Sharpanskykh, Jan Treur
COMPSAC
2007
IEEE
15 years 4 months ago
Specifying Pointcuts in AspectJ
Program verification is a promising approach to improving program quality. To formally verify aspectoriented programs, we have to find a way to formally specify programs written i...
Yi Wang, Jianjun Zhao