Sciweavers

NFM
2011
335views Formal Methods» more  NFM 2011»
12 years 10 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
306views Formal Methods» more  NFM 2011»
12 years 10 months ago
Generalized Rabin(1) Synthesis with Applications to Robust System Synthesis
Synthesis of finite-state machines from linear-time temporal logic (LTL) formulas is an important formal specification debugging technique for reactive systems and can quickly ge...
Rüdiger Ehlers
NFM
2011
303views Formal Methods» more  NFM 2011»
12 years 10 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
264views Formal Methods» more  NFM 2011»
12 years 10 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...
Formal Methods
Top of PageReset Settings