Sciweavers

788 search results - page 76 / 158
» Symbolic Equivalence Checking
Sort
View
CAV
2006
Springer
132views Hardware» more  CAV 2006»
13 years 11 months ago
Symmetry Reduction for Probabilistic Model Checking
We present an approach for applying symmetry reduction techniques to probabilistic model checking, a formal verification method for the quantitative analysis of systems with stocha...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
13 years 9 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter
TSE
2010
161views more  TSE 2010»
13 years 6 months ago
Finding Bugs in Web Applications Using Dynamic Test Generation and Explicit-State Model Checking
— Web script crashes and malformed dynamically-generated web pages are common errors, and they seriously impact the usability of web applications. Current tools for web-page vali...
Shay Artzi, Adam Kiezun, Julian Dolby, Frank Tip, ...
UC
2005
Springer
14 years 1 months ago
On Model-Checking of P Systems
Abstract. Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computin...
Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie
FMCAD
2004
Springer
14 years 1 months ago
Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
Mohammad Awedh, Fabio Somenzi