Sciweavers

Share
NFM
2011
335views Formal Methods» more  NFM 2011»
8 years 1 months ago
CORAL: Solving Complex Constraints for Symbolic PathFinder
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
Matheus Souza, Mateus Borges, Marcelo d'Amorim, Co...
NFM
2011
303views Formal Methods» more  NFM 2011»
8 years 1 months ago
Instantiation-Based Invariant Discovery
Abstract. We present a general scheme for automated instantiation-based invariant discovery. Given a transition system, the scheme produces k-inductive invariants from templates re...
Temesghen Kahsai, Yeting Ge, Cesare Tinelli
NFM
2011
223views Formal Methods» more  NFM 2011»
8 years 2 months ago
opaal: A Lattice Model Checker
Abstract. We present a new open source model checker, opaal, for automatic verification of models using lattice automata. Lattice automata allow the users to incorporate abstracti...
Andreas Engelbredt Dalsgaard, René Rydhof H...
NFM
2011
242views Formal Methods» more  NFM 2011»
8 years 2 months ago
Model Checking Using SMT and Theory of Lists
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Aleksandar Milicevic, Hillel Kugler
NFM
2011
209views Formal Methods» more  NFM 2011»
8 years 2 months ago
Formalizing Probabilistic Safety Claims
A safety claim for a system is a statement that the system, which is subject to hazardous conditions, satisfies a given set of properties. Following work by John Rushby and Bev Li...
Heber Herencia-Zapana, George Hagen, Anthony Narka...
NFM
2011
252views Formal Methods» more  NFM 2011»
8 years 2 months ago
Call Invariants
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
Shuvendu K. Lahiri, Shaz Qadeer
NFM
2011
254views Formal Methods» more  NFM 2011»
8 years 2 months ago
A Tabular Expression Toolbox for Matlab/Simulink
Abstract. Tabular expressions have been successfully used in developing safety critical systems, however insufficient tool support has hampered their wider adoption. To address thi...
Colin Eles, Mark Lawford
NFM
2011
225views Formal Methods» more  NFM 2011»
8 years 2 months ago
Synthesis for PCTL in Parametric Markov Decision Processes
Abstract. In parametric Markov Decision Processes (PMDPs), transition probabilities are not fixed, but are given as functions over a set of parameters. A PMDP denotes a family of ...
Ernst Moritz Hahn, Tingting Han, Lijun Zhang
NFM
2011
264views Formal Methods» more  NFM 2011»
8 years 2 months ago
Applying Atomicity and Model Decomposition to a Space Craft System in Event-B
Abstract. Event-B is a formal method for modeling and verifying consistency of systems. In formal methods such as Event-B, refinement is the process of enriching or modifying an a...
Asieh Salehi Fathabadi, Abdolbaghi Rezazadeh, Mich...
books