3,468 research outputs found
HeteroGenius: A Framework for Hybrid Analysis of Heterogeneous Software Specifications
Nowadays, software artifacts are ubiquitous in our lives being an essential
part of home appliances, cars, cell phones, and even in more critical
activities like aeronautics and health sciences. In this context software
failures may produce enormous losses, either economical or, in the worst case,
in human lives. Software analysis is an area in software engineering concerned
with the application of diverse techniques in order to prove the absence of
errors in software pieces. In many cases different analysis techniques are
applied by following specific methodological combinations that ensure better
results. These interactions between tools are usually carried out at the user
level and it is not supported by the tools. In this work we present
HeteroGenius, a framework conceived to develop tools that allow users to
perform hybrid analysis of heterogeneous software specifications.
HeteroGenius was designed prioritising the possibility of adding new
specification languages and analysis tools and enabling a synergic relation of
the techniques under a graphical interface satisfying several well-known
usability enhancement criteria. As a case-study we implemented the
functionality of Dynamite on top of HeteroGenius.Comment: In Proceedings LAFM 2013, arXiv:1401.056
Algebraic Principles for Rely-Guarantee Style Concurrency Verification Tools
We provide simple equational principles for deriving rely-guarantee-style
inference rules and refinement laws based on idempotent semirings. We link the
algebraic layer with concrete models of programs based on languages and
execution traces. We have implemented the approach in Isabelle/HOL as a
lightweight concurrency verification tool that supports reasoning about the
control and data flow of concurrent programs with shared variables at different
levels of abstraction. This is illustrated on two simple verification examples
Abstract State Machines 1988-1998: Commented ASM Bibliography
An annotated bibliography of papers which deal with or use Abstract State
Machines (ASMs), as of January 1998.Comment: Also maintained as a BibTeX file at http://www.eecs.umich.edu/gasm
Bisimulation of Labeled State-to-Function Transition Systems of Stochastic Process Languages
Labeled state-to-function transition systems, FuTS for short, admit multiple
transition schemes from states to functions of finite support over general
semirings. As such they constitute a convenient modeling instrument to deal
with stochastic process languages. In this paper, the notion of bisimulation
induced by a FuTS is proposed and a correspondence result is proven stating
that FuTS-bisimulation coincides with the behavioral equivalence of the
associated functor. As generic examples, the concrete existing equivalences for
the core of the process algebras ACP, PEPA and IMC are related to the
bisimulation of specific FuTS, providing via the correspondence result
coalgebraic justification of the equivalences of these calculi.Comment: In Proceedings ACCAT 2012, arXiv:1208.430
- ā¦