Results 1  10
of
94
Model Checking of Probabilistic and Nondeterministic Systems
, 1995
"... . The temporal logics pCTL and pCTL* have been proposed as tools for the formal specification and verification of probabilistic systems: as they can express quantitative bounds on the probability of system evolutions, they can be used to specify system properties such as reliability and performance. ..."
Abstract

Cited by 291 (13 self)
 Add to MetaCart
. The temporal logics pCTL and pCTL* have been proposed as tools for the formal specification and verification of probabilistic systems: as they can express quantitative bounds on the probability of system evolutions, they can be used to specify system properties such as reliability and performance
Bounded verification of Ruby on Rails data models
 In Proc. ISSTA
, 2011
"... The use of scripting languages to build web applications has increased programmer productivity, but at the cost of degrading dependability. In this paper we focus on a class of bugs that appear in web applications that are built based on the ModelViewController architecture. Our goal is to automat ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
models in Ruby on Rails applications) as input and generates a data model in Alloy language as output. We then use bounded verification techniques implemented in the Alloy Analyzer to look for errors in these formal data model specifications. We applied our approach to two open source web applications
Parallel Program Verification Using BMC
 In: ECAI 2002 Workshop on Model Checking and Artificial Intelligence
, 2002
"... The paper describes a research tool for studying the applicability of bounded model checking techniques to verifying asynchronous software. A simple programming language, PROMELAb, is introduced and an operational semantics for it is defined. The language is basically a subset of PROMELA, the input ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
language of the SPIN model checker. The basic idea is to study techniques for improving the efficiency of bounded model checking techniques for parallel software by exploiting the potential concurrency in executing asynchronous programs. As a first step, a translation from a PROMELAb program
Timing Verification by Successive Approximation
 INFORMATION AND COMPUTATION
, 1995
"... We present an algorithm for verifying that a model M with timing constraints satisfies a given temporal property T . The model M is given as a parallel composition of !automata P i , where each automaton P i is constrained by bounds on delays. The property T is given as an !automaton as well, and ..."
Abstract

Cited by 46 (10 self)
 Add to MetaCart
We present an algorithm for verifying that a model M with timing constraints satisfies a given temporal property T . The model M is given as a parallel composition of !automata P i , where each automaton P i is constrained by bounds on delays. The property T is given as an !automaton as well
ParAlloy: Towards a Framework for Efficient Parallel Analysis of Alloy Models
"... Alloy [Jac02a] is a widely adopted relational modeling language. Its appealing syntax and the support provided by the Alloy Analyzer [Jac02b] tool make model analysis accessible to a public of nonspecialists. A model and property are translated to a propositional formula, which is fed to a SATsolv ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
not scale well enough to remain feasible as scopes grow. ParAlloy exploits the possibility of splitting the SAT formula, thus allowing for parallel SATsolving of Alloy models. Three of its important characteristics are: 1. Its core component is a parallel solver for arbitrary propositional formulas –not
Automatic Unbounded Verification of Alloy Specifications with Prover9
, 2011
"... Abstract. Alloy is an increasingly popular lightweight specification language based on relational logic. Alloy models can be automatically verified within a bounded scope using offtheshelf SAT solvers. Since false assertions can usually be disproved using small counterexamples, this approach su ..."
Abstract
 Add to MetaCart
Abstract. Alloy is an increasingly popular lightweight specification language based on relational logic. Alloy models can be automatically verified within a bounded scope using offtheshelf SAT solvers. Since false assertions can usually be disproved using small counterexamples, this approach
Verification, Languages
"... SATbased bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specification violations using a SATsolver. If a violation is found, an execution trace exposing the error is exhibited. Code inv ..."
Abstract
 Add to MetaCart
SATbased bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specification violations using a SATsolver. If a violation is found, an execution trace exposing the error is exhibited. Code
A Necessarily Parallel Attack
 In Workshop on Formal Methods and Security Protocols
, 1999
"... An artificial protocol called the "ffgg" protocol is constructed, with a parallel attack exposing a secret data item. It is proved that a parallel attack is necessary, because the protocol is shown to be secure under nonparallel attacks. We use an inductive approach in the PVS verification ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
verification environment. 1 Introduction Model checking has proved to be a successful way to find vulnerabilities in cryptographic protocols. See, for example, [2, 3, 6]. If a model checker fails to find an attack, however, it may only mean that there is no attack on the particular finite model of the system
On Symbolic Verification of Weakly Extended PAD
, 2006
"... We consider the verification problem of a class of infinitestate systems called wPAD. These systems can be used to model programs with (possibly recursive) procedure calls and dynamic creation of parallel processes. They correspond to PAD models extended with an acyclic finitestate control unit, w ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the verification problem of a class of infinitestate systems called wPAD. These systems can be used to model programs with (possibly recursive) procedure calls and dynamic creation of parallel processes. They correspond to PAD models extended with an acyclic finitestate control unit
Bounded model checking and feature omission diversity
 In Proc. CFV
, 2011
"... Abstract—In this paper we introduce a novel way to speed up the discovery of counterexamples in bounded model checking, based on parallel runs over versions of a system in which features have been randomly disabled. As shown in previous work, adding constraints to a bounded model checking problem ca ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—In this paper we introduce a novel way to speed up the discovery of counterexamples in bounded model checking, based on parallel runs over versions of a system in which features have been randomly disabled. As shown in previous work, adding constraints to a bounded model checking problem
Results 1  10
of
94