Sciweavers

TABLEAUX
2007
Springer
14 years 5 months ago
Bounded Model Checking with Description Logic Reasoning
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
SPIN
2007
Springer
14 years 5 months ago
Generating Counter-Examples Through Randomized Guided Search
Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these res...
Neha Rungta, Eric G. Mercer
SPIN
2007
Springer
14 years 5 months ago
SAT-Based Summarization for Boolean Programs
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...
Gérard Basler, Daniel Kroening, Georg Weiss...
SAFECOMP
2007
Springer
14 years 5 months ago
Modeling and Automatic Failure Analysis of Safety-Critical Systems Using Extended Safecharts
With the rapid progress in science and technology, we find ubiquitous use of safety-critical systems in avionics, consumer electronics, and medical instruments. In such systems, u...
Yean-Ru Chen, Pao-Ann Hsiung, Sao-Jie Chen
LFCS
2007
Springer
14 years 5 months ago
Model Checking Knowledge and Linear Time: PSPACE Cases
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
Kai Engelhardt, Peter Gammie, Ron van der Meyden
ICSOC
2007
Springer
14 years 5 months ago
Verifying Temporal and Epistemic Properties of Web Service Compositions
Model checking Web service behaviour has remained limited to checking safety and liveness properties. However when viewed as a multi agent system, the system composition can be ana...
Alessio Lomuscio, Hongyang Qu, Marek J. Sergot, Mo...
FORMATS
2007
Springer
14 years 5 months ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio
FMCAD
2007
Springer
14 years 5 months ago
Induction in CEGAR for Detecting Counterexamples
— Induction has been studied in model checking for proving the validity of safety properties, i.e., showing the absence of counterexamples. To our knowledge, induction has not be...
Chao Wang, Aarti Gupta, Franjo Ivancic
FMCAD
2007
Springer
14 years 5 months ago
Automated Extraction of Inductive Invariants to Aid Model Checking
Abstract— Model checking can be aided by inductive invariants, small local properties that can be proved by simple induction. We present a way to automatically extract inductive ...
Michael L. Case, Alan Mishchenko, Robert K. Brayto...
EUROGP
2007
Springer
116views Optimization» more  EUROGP 2007»
14 years 5 months ago
Genetic Programming with Fitness Based on Model Checking
Abstract. Model checking is a way of analysing programs and programlike structures to decide whether they satisfy a list of temporal logic statements describing desired behaviour. ...
Colin G. Johnson