Results 1 - 10
of
12
A Logic for Abstract State Machines
, 2001
"... We introduce a logic for non distributed, deterministic Abstract State Machines with parallel function updates. Unlike other logics for ASMs which are based on dynamic logic, our logic is based on an atomic predicate for function updates and on a definedness predicate for the termination of the ev ..."
Abstract
-
Cited by 63 (5 self)
- Add to MetaCart
We introduce a logic for non distributed, deterministic Abstract State Machines with parallel function updates. Unlike other logics for ASMs which are based on dynamic logic, our logic is based on an atomic predicate for function updates and on a definedness predicate for the termination of the evaluation of transition rules. We do not assume that the transition rules of ASMs are in normal form, for example, that they concern distinct cases. Instead we allow structuring concepts of ASM rules including sequential composition and possibly recursive submachine calls. We show that several axioms that have been proposed for reasoning about ASMs are derivable in our system. We provide also an extension of the logic with explicit step information which allows to eliminate modal operators in certain cases. The main technical result is that the logic is complete for hierarchical (non-recursive) ASMs. We show that, for hierarchical ASMs, the logic is a definitional extension of first-order predicate logic.
Interfacing ASM with the MDG Tool
, 2003
"... In this paper we describe an approach to interface Abstract State Machines (ASM) with Multiway Decision Graphs (MDG) to enable tool support for the formal veri cation of ASM descriptions. ASM is a speci cation method for software and hardware providing a powerful means of modeling various kind ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
In this paper we describe an approach to interface Abstract State Machines (ASM) with Multiway Decision Graphs (MDG) to enable tool support for the formal veri cation of ASM descriptions. ASM is a speci cation method for software and hardware providing a powerful means of modeling various kinds of systems. MDGs are decision diagrams based on abstract representation of data and are used primarily for modeling hardware systems. The notions of ASM and MDG are hence closely related to each other, making it appealing to link these two concepts. The proposed interface between ASM and MDG uses two steps: rst, the ASM model is transformed into a at, simple transition system as an intermediate model. Second, this intermediate model is transformed into the syntax of the input language of the MDG tool, MDG-HDL. We have successfully applied this transformation scheme on a case study, the Island Tunnel Controller, where we automatically generated the corresponding MDG-HDL models from ASM speci cations.
Modular Abstractions of Reactive Nodes using Disjunctive Invariants ∗
, 2011
"... We wish to abstract nodes in a reactive programming language, such as Lustre, into nodes with a simpler control structure, with a bound on the number of control states. In order to do so, we compute disjunctive invariants in predicate abstraction, with a bounded number of disjuncts, then we abstract ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
(Show Context)
We wish to abstract nodes in a reactive programming language, such as Lustre, into nodes with a simpler control structure, with a bound on the number of control states. In order to do so, we compute disjunctive invariants in predicate abstraction, with a bounded number of disjuncts, then we abstract the node, each disjunct representing an abstract state. The computation of the disjunctive invariant is performed by a form of quantifier elimination expressed using SMT-solving. The same method can also be used to obtain disjunctive loop invariants. 1
Formal Verification of ASM Designs Using the MDG Tool
- Software Engineering and Formal Methods, IEEE Computer Society
, 2003
"... State Machine) is a state based language for describing transition systems. MDG (Multiway Decision Graphs) provides symbolic representation of transition systems with support of abstract sorts and functions. We implemented a transformation tool that automatically generates MDG models from ASM specif ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
(Show Context)
State Machine) is a state based language for describing transition systems. MDG (Multiway Decision Graphs) provides symbolic representation of transition systems with support of abstract sorts and functions. We implemented a transformation tool that automatically generates MDG models from ASM specifications, then formal verification techniques provided by the MDG tool, such as model checking or equivalence checking, can be applied on the generated models. We support this work with a case study of an Island Tunnel Controller, which behavior and structure were specified in ASM then using our ASM-MDG tool successfully verified within the MDG tool.
Rapid prototyping applications of formal reasoning tools to biological cellular signalling networks
, 2005
"... that the substance of this thesis has not already been submitted for any degree and is not currently being submitted for any other degree. I certify that to the best of my knowledge, any help received in preparing this thesis, and all sources used, have been acknowledged in this thesis. ii Acknowled ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
that the substance of this thesis has not already been submitted for any degree and is not currently being submitted for any other degree. I certify that to the best of my knowledge, any help received in preparing this thesis, and all sources used, have been acknowledged in this thesis. ii Acknowledgements I would like to thank my supervisor Ian Mason for his invaluable help, patience and guidance during this Honours project. The many afternoons spent solving my programs’ bugs are highly appreciated. I would like to thank Carolyn Talcott for her generosity, enthusiasm and constant support during the development of this work. I would also like to thank Merrill Knapp for the useful explanations. Last but not least I would like to thank my family for their support and encouragment. In this thesis biological cellular signalling networks are modelled and interrogated. We make use of two state-of-the-art formal reasoning tools: Symbolic Analysis Laboratory
From Simulation To Verification (and Back)
, 2003
"... Symbolic evaluation is the execution of software and software designs on inputs given as symbolic or explicit constants along with constraints on these inputs. Efficient symbolic evaluation is now feasible due to recent advances in efficient decision procedures and symbolic model checking. Symbolic ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Symbolic evaluation is the execution of software and software designs on inputs given as symbolic or explicit constants along with constraints on these inputs. Efficient symbolic evaluation is now feasible due to recent advances in efficient decision procedures and symbolic model checking. Symbolic evaluation can be applied to partially implemented descriptions and provides wider coverage and greater assurance than testing and traditional simulation alone. Unlike full formal verification, symbolic evaluation can be used in a partial manner that is more likely to succeed and yield some degree of assurance. Its main advantage is that it can be used within a smooth spectrum of analyses ranging from refutation based on explicit-state simulation to full-blown verification.
Validating Human-device Interfaces with Model Checking and Temporal Logic Properties Automatically Generated from Task Analytic Models
"... ABSTRACT: When evaluating designs of human-device interfaces for safety critical systems, it is very important that they be valid: support the goal-directed tasks they were designed to facilitate. Model checking is a type of formal analysis that is used to mathematically prove whether or not a mode ..."
Abstract
- Add to MetaCart
(Show Context)
ABSTRACT: When evaluating designs of human-device interfaces for safety critical systems, it is very important that they be valid: support the goal-directed tasks they were designed to facilitate. Model checking is a type of formal analysis that is used to mathematically prove whether or not a model of a system does or does not satisfy a set of specification properties, usually written in a temporal logic. In the analysis of human-automation interaction, model checkers have been used to formally verify that human-device interface models are valid with respect to goal-directed tasks encoded in temporal logic properties. All of the previous work in this area has required that analysts manually specify these properties. Given the semantics of temporal logic and the complexity of task analytic behavior models, this can be very difficult. This paper describes a method that allows temporal logic properties to be automatically generated from task analytic models created early in the system design process. This allows analysts to use model checkers to validate that modeled human-device interfaces will allow human operators to successfully perform the necessary tasks with the system. The use of the method is illustrated with a patient controlled analgesia pump programming example. The method is discussed and avenues for future work are described.
Sensoria Results Applied to the Case Studies
"... Abstract. In this chapter we provide an overview of the application of the results obtained in Sensoria (i.e., techniques, methods and languages developed in the technical work packages WP1-WP7) to case studies from the Automotive, eUniversity, Finance and Telecommunication domains (developed in wo ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. In this chapter we provide an overview of the application of the results obtained in Sensoria (i.e., techniques, methods and languages developed in the technical work packages WP1-WP7) to case studies from the Automotive, eUniversity, Finance and Telecommunication domains (developed in work package WP8).
SRI International
"... Abstract. Pathway Logic (PL) is an approach to modeling and analysis of bio-logical processes based on rewriting logic. This tutorial describes the use of PL to model signal transduction processes. It begins with a general discussion of Symbolic Systems Biology, followed by some background on rewrit ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. Pathway Logic (PL) is an approach to modeling and analysis of bio-logical processes based on rewriting logic. This tutorial describes the use of PL to model signal transduction processes. It begins with a general discussion of Symbolic Systems Biology, followed by some background on rewriting logic and signal transduction. The representation and analysis of a small model of Ras and Raf activation is presented in some detail. This is followed by discussion of a curated model of early signaling events in response to Epidermal Growth Factor stimulation.
Visualization of Traceability Models with Domain-specific Layouting
"... Abstract: Traceability models are often used to describe the correspondence between source and target models of model transformations. Although the visual representa-tion of such models are important for transformation development and application, mostly ad-hoc solutions are present in industrial en ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract: Traceability models are often used to describe the correspondence between source and target models of model transformations. Although the visual representa-tion of such models are important for transformation development and application, mostly ad-hoc solutions are present in industrial environments. In this paper we present a user interface component for visualizing traceability models inside trans-formation frameworks. As generic graph visualization methods fail to emphasize the underlying logical structure of our model, we used domain-specific layouts by customizing generic graph layout algorithms with data from the metamodels used during the transformation. This approach was evaluated, among others, with the traceability models generated by a BPEL verification transformation, which serves as our running example.
