@inproceedings{408, abstract = {{Verification of hardware and software usually proceeds separately, software analysis relying on the correctness of processors executing instructions. This assumption is valid as long as the software runs on standard CPUs that have been extensively validated and are in wide use. However, for processors exploiting custom instruction set extensions to meet performance and energy constraints the validation might be less extensive, challenging the correctness assumption.In this paper we present an approach for integrating software analyses with hardware verification, specifically targeting custom instruction set extensions. We propose three different techniques for deriving the properties to be proven for the hardware implementation of a custom instruction in order to support software analyses. The techniques are designed to explore the trade-off between generality and efficiency and span from proving functional equivalence over checking the rules of a particular analysis domain to verifying actual pre and post conditions resulting from program analysis. We demonstrate and compare the three techniques on example programs with custom instructions, using stateof-the-art software and hardware verification techniques.}}, author = {{Jakobs, Marie-Christine and Platzner, Marco and Wiersema, Tobias and Wehrheim, Heike}}, booktitle = {{Proceedings of the 11th International Conference on Integrated Formal Methods (iFM)}}, editor = {{Albert, Elvira and Sekerinski, Emil}}, pages = {{307--322}}, title = {{{Integrating Software and Hardware Verification}}}, doi = {{10.1007/978-3-319-10181-1_19}}, year = {{2014}}, } @inproceedings{417, abstract = {{Model transformation is a key concept in modeldrivensoftware engineering. The definition of model transformationsis usually based on meta-models describing the abstractsyntax of languages. While meta-models are thereby able to abstractfrom superfluous details of concrete syntax, they often loosestructural information inherent in languages, like information onmodel elements always occurring together in particular shapes.As a consequence, model transformations cannot naturally re-uselanguage structures, thus leading to unnecessary complexity intheir development as well as analysis.In this paper, we propose a new approach to model transformationdevelopment which allows to simplify and improve thequality of the developed transformations via the exploitation ofthe languages’ structures. The approach is based on context-freegrammars and transformations defined by pairing productions ofsource and target grammars. We show that such transformationsexhibit three important characteristics: they are sound, completeand deterministic.}}, author = {{Besova, Galina and Steenke, Dominik and Wehrheim, Heike}}, booktitle = {{Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)}}, pages = {{1601--1610}}, title = {{{Grammar-based model transformations}}}, doi = {{10.1016/j.cl.2015.05.003}}, year = {{2014}}, } @misc{418, author = {{Pauck, Felix}}, publisher = {{Universität Paderborn}}, title = {{{Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren}}}, year = {{2014}}, } @inproceedings{3176, author = {{Isenberg, Tobias and Steenken, Dominik and Wehrheim, Heike}}, booktitle = {{Formal Techniques for Distributed Systems - Joint {IFIP} {WG} 6.1 International Conference, {FMOODS/FORTE} 2013, Held as Part of the 8th International Federated Conference on Distributed Computing Techniques, DisCoTec 2013, Florence, Italy, June 3-5, 2013. Proceedings}}, editor = {{Beyer, Dirk and Boreale, Michele}}, pages = {{178----192}}, title = {{{Bounded Model Checking of Graph Transformation Systems via {SMT} Solving}}}, doi = {{10.1007/978-3-642-38592-6_13}}, year = {{2013}}, } @inproceedings{3177, author = {{Travkin, Oleg and Mütze, Annika and Wehrheim, Heike}}, booktitle = {{Hardware and Software: Verification and Testing - 9th International Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings}}, editor = {{Bertacco, Valeria and Legay, Axel}}, pages = {{311----326}}, title = {{{{SPIN} as a Linearizability Checker under Weak Memory Models}}}, doi = {{10.1007/978-3-319-03077-7_21}}, year = {{2013}}, } @inproceedings{3178, author = {{Dongol, Brijesh and Travkin, Oleg and Derrick, John and Wehrheim, Heike}}, booktitle = {{Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings}}, editor = {{Liu, Zhiming and Woodcock, Jim and Zhu, Huibiao}}, pages = {{177----194}}, title = {{{A High-Level Semantics for Program Execution under Total Store Order Memory}}}, doi = {{10.1007/978-3-642-39718-9_11}}, year = {{2013}}, } @inproceedings{3179, author = {{Ziegert, Steffen and Wehrheim, Heike}}, booktitle = {{Software Engineering 2013: Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\"{a}}rz 2013 in Aachen}}, editor = {{Kowalewski, Stefan and Rumpe, Bernhard}}, pages = {{271----284}}, title = {{{Temporal Reconfiguration Plans for Self-Adaptive Systems}}}, year = {{2013}}, } @inproceedings{469, abstract = {{Runtime monitoring aims at ensuring program safety by monitoring the program's behaviour during execution and taking appropriate action before a program violates some property.Runtime monitoring is in particular important when an exhaustive formal verification fails. While the approach allows for a safe execution of programs, it may impose a significant runtime overhead.In this paper, we propose a novel technique combining verification and monitoring which incurs no overhead during runtime at all. The technique proceeds by using the inconclusive result of a verification run as the basis for transforming the program into one where all potential points of failure are replaced by HALT statements. The new program is safe by construction, behaviourally equivalent to the original program (except for unsafe behaviour),and has the same performance characteristics.}}, author = {{Wonisch, Daniel and Schremmer, Alexander and Wehrheim, Heike}}, booktitle = {{Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)}}, pages = {{244--258}}, title = {{{Zero Overhead Runtime Monitoring}}}, doi = {{10.1007/978-3-642-40561-7_17}}, year = {{2013}}, } @phdthesis{478, abstract = {{Software systems are playing an increasing role in our everyday life, and as the amount of software applications grows, so does their complexity and the relevance of their computations. Software components can be found in many systems that are charged with safety-critical tasks, such as control systems for aviation or power plants. Hence, software verification techniques that are capable of proving the absence of critical errors are becoming more and more important in the field software engineering. A well-established approach to software verification is model checking. Applying this technique involves an exhaustive exploration of a state space model corresponding to the system under consideration. The major challenge in model checking is the so-called state explosion problem: The state space of a software system grows exponentially with its size. Thus, the straightforward modelling of real-life systems practically impossible. A common approach to this problem is the application of abstraction techniques, which reduce the original state space by mapping it on a significantly smaller abstract one. Abstraction inherently involves a loss of information, and thus, the resulting abstract model may be too imprecise for a definite result in verification. Therefore, abstraction is typically combined with abstraction refinement: An initially very coarse abstract model is iteratively refined, i.e. enriched with new details about the original system, until a level of abstraction is reached that is precise enough for a definite outcome. Abstraction refinement-based model checking is fully automatable and it is considered as one of the most promising approaches to the state explosion problem in verification. However, it is still faced with a number of challenges. There exist several types of abstraction techniques and not every type is equally well-suited for all kinds of systems and verification tasks. Moreover, the selection of adequate refinement steps is nontrivial and typically the most crucial part of the overall approach: Unfavourable refinement decisions can compromise the state space-reducing effect of abstraction, and as a consequence, can easily lead to the failure of verification. It is, however, hard to predict which refinement steps will eventually be expedient for verification – and which not.}}, author = {{Timm, Nils}}, publisher = {{Universität Paderborn}}, title = {{{Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems}}}, year = {{2013}}, } @inproceedings{498, abstract = {{Proof-carrying code approaches aim at safe execution of untrusted code by having the code producer attach a safety proof to the code which the code consumer only has to validate. Depending on the type of safety property, proofs can however become quite large and their validation - though faster than their construction - still time consuming. In this paper we introduce a new concept for safe execution of untrusted code. It keeps the idea of putting the time consuming part of proving on the side of the code producer, however, attaches no proofs to code anymore but instead uses the proof to transform the program into an equivalent but more efficiently verifiable program. Code consumers thus still do proving themselves, however, on a computationally inexpensive level only. Experimental results show that the proof effort can be reduced by several orders of magnitude, both with respect to time and space.}}, author = {{Wonisch, Daniel and Schremmer, Alexander and Wehrheim, Heike}}, booktitle = {{Proceedings of the 25th International Conference on Computer Aided Verification (CAV)}}, pages = {{912--927}}, title = {{{Programs from Proofs – A PCC Alternative}}}, doi = {{10.1007/978-3-642-39799-8_65}}, year = {{2013}}, } @inproceedings{517, abstract = {{In the Semantic (Web) Services area, services are considered black boxes with a semantic description of their interfaces as to allow for precise service selection and configuration. The semantic description is usually grounded on domain-specific concepts as modeled in ontologies. This accounts for types used in service signatures, but also predicates occurring in preconditions and effects of services. Ontologies, in particular those enhanced with rules, capture the knowledge of domain experts on properties of and relations between domain concepts. In this paper, we present a verification technique for service compositions which makes use of this domain knowledge. We consider a service composition to be an assembly of services of which we just know signatures, preconditions, and effects. We aim at proving that a composition satisfies a (user-defined) requirement, specified in terms of guaranteed preconditions and required postconditions. As an underlying verification engine we use an SMT solver. To take advantage of the domain knowledge (and often, to enable verification at all), the knowledge is fed into the solver in the form of sorts, uninterpreted functions and in particular assertions as to enhance the solver’s reasoning capabilities. Thereby, we allow for deductions within a domain previously unknown to the solver. We exemplify our technique on a case study from the area of water network optimization software.}}, author = {{Walther, Sven and Wehrheim, Heike}}, booktitle = {{Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)}}, pages = {{24 -- 32 }}, title = {{{Knowledge-Based Verification of Service Compositions - An SMT approach}}}, doi = {{10.1109/ICECCS.2013.14}}, year = {{2013}}, } @article{3180, author = {{Travkin, Oleg and Wehrheim, Heike and Schellhorn, Gerhard}}, journal = {{{ECEASST}}}, title = {{{Proving Linearizability of Multiset with Local Proof Obligations}}}, year = {{2012}}, } @article{3181, author = {{Ruhroth, Thomas and Wehrheim, Heike}}, journal = {{Sci. Comput. Program.}}, number = {{3}}, pages = {{270----289}}, title = {{{Model evolution and refinement}}}, doi = {{10.1016/j.scico.2011.04.007}}, year = {{2012}}, } @inproceedings{3182, author = {{Schellhorn, Gerhard and Wehrheim, Heike and Derrick, John}}, booktitle = {{Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings}}, editor = {{Madhusudan, P. and A. Seshia, Sanjit}}, pages = {{243----259}}, title = {{{How to Prove Algorithms Linearisable}}}, doi = {{10.1007/978-3-642-31424-7_21}}, year = {{2012}}, } @inproceedings{590, abstract = {{Predicate abstraction is an established technique for reducing the size of the state space during verification. In this paper, we extend predication abstraction with block-abstraction memoization (BAM), which exploits the fact that blocks are often executed several times in a program. The verification can thus benefit from caching the values of previous block analyses and reusing them upon next entry into a block. In addition to function bodies, BAM also performs well for nested loops. To further increase effectiveness, block memoization has been integrated with lazy abstraction adopting a lazy strategy for cache refinement. Together, this achieves significant performance increases: our tool (an implementation within the configurable program analysis framework CPAchecker) has won the Competition on Software Verification 2012 in the category “Overall”.}}, author = {{Wonisch, Daniel and Wehrheim, Heike}}, booktitle = {{Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)}}, pages = {{332--347}}, title = {{{Predicate Analysis with Block-Abstraction Memoization}}}, doi = {{10.1007/978-3-642-34281-3_24}}, year = {{2012}}, } @inproceedings{608, abstract = {{Predicate abstraction is an established technique in software verification. It inherently includes an abstraction refinement loop successively adding predicates until the right level of abstraction is found. For concurrent systems, predicate abstraction can be combined with spotlight abstraction, further reducing the state space by abstracting away certain processes. Refinement then has to decide whether to add a new predicate or a new process. Selecting the right predicates and processes is a crucial task: The positive effect of abstraction may be compromised by unfavourable refinement decisions. Here we present a heuristic approach to abstraction refinement. The basis for a decision is a set of refinement candidates, derived by multiple counterexample-generation. Candidates are evaluated with respect to their influence on other components in the system. Experimental results show that our technique can significantly speed up verification as compared to a naive abstraction refinement.}}, author = {{Timm, Nils and Wehrheim, Heike and Czech, Mike}}, booktitle = {{Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)}}, pages = {{348--363}}, title = {{{Heuristic-Guided Abstraction Refinement for Concurrent Systems}}}, doi = {{10.1007/978-3-642-34281-3_25}}, year = {{2012}}, } @inproceedings{627, abstract = {{Block Abstraction Memoization (ABM) is a technique in software model checking that exploits the modularity of programs during verification by caching. To this end, ABM records the results of block analyses and reuses them if possible when revisiting the same block again. In this paper we present an implementation of ABM into the predicate-analysis component of the software-verification framework CPAchecker. With our participation at the Competition on Software Verification we aim at providing evidence that ABM can not only substantially increase the efficiency of predicate analysis but also enables verification of a wider range of programs.}}, author = {{Wonisch, Daniel}}, booktitle = {{Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)}}, pages = {{531--533}}, title = {{{Block Abstraction Memoization for CPAchecker}}}, doi = {{10.1007/978-3-642-28756-5_41}}, year = {{2012}}, } @inproceedings{565, abstract = {{In model-driven development of multi-layer systems (e.g. application, platform and infrastructure), each layer is usually described by separate models. When generating analysis models or code, these separate models rst of all need to be linked. Hence, existing model transformations for single layers cannot be simply re-used. In this paper, we present a modular approach to the transformation of multi-layer systems. It employs model weaving to dene the interconnections between models of dierent layers. The weaving models themselves are subject to model transformations: The result of transforming a weaving model constitutes a conguration for the models obtained by transforming single layers, thereby allowing for a re-use of existing model transformations. We exemplify our approach by the generation of analysis models for component-based software.}}, author = {{Besova, Galina and Walther, Sven and Wehrheim, Heike and Becker, Steffen}}, booktitle = {{Proceedings of the 15th International Conference on Model Driven Engineering Languages & Systems (MoDELS)}}, pages = {{776--792}}, title = {{{Weaving-based configuration and modular transformation of multi-layer systems}}}, doi = {{10.1007/978-3-642-33666-9_49}}, year = {{2012}}, } @article{3183, author = {{Schneider, Steve and Treharne, Helen and Wehrheim, Heike}}, journal = {{Electr. Notes Theor. Comput. Sci.}}, pages = {{69----80}}, title = {{{Bounded Retransmission in Event-B{\(\parallel\)}CSP: a Case Study}}}, doi = {{10.1016/j.entcs.2011.11.019}}, year = {{2011}}, } @article{3184, author = {{Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}}, journal = {{{ACM} Trans. Program. Lang. Syst.}}, number = {{1}}, pages = {{4:1----4:43}}, title = {{{Mechanically verified proof obligations for linearizability}}}, doi = {{10.1145/1889997.1890001}}, year = {{2011}}, } @inproceedings{3185, author = {{Ruhroth, Thomas and Wehrheim, Heike and Ziegert, Steffen}}, booktitle = {{37th {EUROMICRO} Conference on Software Engineering and Advanced Applications, {SEAA} 2011, Oulu, Finland, August 30 - September 2, 2011}}, pages = {{83----90}}, title = {{{ReL: {A} Generic Refactoring Language for Specification and Execution}}}, doi = {{10.1109/SEAA.2011.22}}, year = {{2011}}, } @inproceedings{3186, author = {{Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}}, booktitle = {{{FM} 2011: Formal Methods - 17th International Symposium on Formal Methods, Limerick, Ireland, June 20-24, 2011. Proceedings}}, editor = {{J. Butler, Michael and Schulte, Wolfram}}, pages = {{323----337}}, title = {{{Verifying Linearisability with Potential Linearisation Points}}}, doi = {{10.1007/978-3-642-21437-0_25}}, year = {{2011}}, } @inproceedings{3187, author = {{Steenken, Dominik and Wehrheim, Heike and Wonisch, Daniel}}, booktitle = {{Formal Methods, Foundations and Applications - 14th Brazilian Symposium, {SBMF} 2011, S{\~{a}}o Paulo, Brazil, September 26-30, 2011, Revised Selected Papers}}, editor = {{da Silva Sim{\~{a}}o, Adenilso and Morgan, Carroll}}, pages = {{92----107}}, title = {{{Sound and Complete Abstract Graph Transformation}}}, doi = {{10.1007/978-3-642-25032-3_7}}, year = {{2011}}, } @inproceedings{3188, author = {{Schneider, Steve and Treharne, Helen and Wehrheim, Heike}}, booktitle = {{Proceedings 15th International Refinement Workshop, Refine@FM 2011, Limerick, Ireland, 20th June 2011.}}, editor = {{Derrick, John and A. Boiten, Eerke and Reeves, Steve}}, pages = {{139----154}}, title = {{{A {CSP} Account of Event-B Refinement}}}, doi = {{10.4204/EPTCS.55.9}}, year = {{2011}}, } @article{647, author = {{Leuschel, Michael and Wehrheim, Heike}}, journal = {{Science of Computer Programming}}, number = {{10}}, pages = {{835----836}}, publisher = {{Elsevier}}, title = {{{Selected papers on Integrated Formal Methods (iFM09)}}}, doi = {{10.1016/j.scico.2011.01.009}}, year = {{2011}}, } @article{649, abstract = {{Today, the concept of service oriented architectures provides a way of building integrated solutions out of existing services. To this end, services from different providers are composed using advanced orchestration and choreography techniques. However, while this principle allows for greater flexibility at a smaller cost, the use of third party services also includes a risk: Deployed services might not work as claimed by their providers. In this paper, we propose a technique for analyzing the expected reliability of service compositions based on ratings given by (previous) service users. Every service thereby comes with a reputation, and the analysis computes an overall reliability of a service composition from the reputations of its constituent services. The proposed model-driven approach proceeds by translating statechart models of service compositions into input for a probabilistic model checker (PRISM) using state-of-the-art model transformations techniques. The approach has been implemented as an Eclipse plug-in and is fully compliant with UML.}}, author = {{Besova, Galina and Wehrheim, Heike and Wagner, Annika}}, journal = {{Electronic Notes in Theoretical Computer Science}}, number = {{2}}, pages = {{3--16}}, publisher = {{Elsevier}}, title = {{{Reputation-based Reliability Prediction of Service Compositions}}}, doi = {{10.1016/j.entcs.2011.11.008}}, year = {{2011}}, } @misc{658, author = {{Schremmer, Alexander}}, publisher = {{Universität Paderborn}}, title = {{{Function Specification Inference Using Craig Interpolation}}}, year = {{2011}}, } @inproceedings{3195, author = {{Schneider, Steve and Treharne, Helen and Wehrheim, Heike}}, booktitle = {{Integrated Formal Methods - 8th International Conference, {IFM} 2010, Nancy, France, October 11-14, 2010. Proceedings}}, editor = {{M{\'{e}}ry, Dominique and Merz, Stephan}}, pages = {{260----274}}, title = {{{A {CSP} Approach to Control in Event-B}}}, doi = {{10.1007/978-3-642-16265-7_19}}, year = {{2010}}, } @inproceedings{3196, author = {{Dräger, Klaus and Kupriyanov, Andrey and Finkbeiner, Bernd and Wehrheim, Heike}}, booktitle = {{Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, {TACAS} 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings}}, editor = {{Esparza, Javier and Majumdar, Rupak}}, pages = {{271----274}}, title = {{{{SLAB:} {A} Certifying Model Checker for Infinite-State Concurrent Systems}}}, doi = {{10.1007/978-3-642-12002-2_22}}, year = {{2010}}, } @article{3198, author = {{Steenken, Dominik and Wehrheim, Heike and Wonisch, Daniel}}, journal = {{CoRR}}, title = {{{Towards {A} Shape Analysis for Graph Transformation Systems}}}, year = {{2010}}, } @article{3189, author = {{Derrick, John and Wehrheim, Heike}}, journal = {{Sci. Comput. Program.}}, number = {{3}}, pages = {{192----210}}, title = {{{Model transformations across views}}}, doi = {{10.1016/j.scico.2009.11.004}}, year = {{2010}}, } @inproceedings{3191, author = {{Schäfer, Wilhelm and Wehrheim, Heike}}, booktitle = {{Graph Transformations and Model-Driven Engineering - Essays Dedicated to Manfred Nagl on the Occasion of his 65th Birthday}}, editor = {{Engels, Gregor and Lewerentz, Claus and Sch{\"{a}}fer, Wilhelm and Sch{\"{u}}rr, Andy and Westfechtel, Bernhard}}, pages = {{533----554}}, title = {{{Model-Driven Development with Mechatronic {UML}}}}, doi = {{10.1007/978-3-642-17322-6_23}}, year = {{2010}}, } @inproceedings{3193, author = {{Timm, Nils and Wehrheim, Heike}}, booktitle = {{Formal Methods and Software Engineering - 12th International Conference on Formal Engineering Methods, {ICFEM} 2010, Shanghai, China, November 17-19, 2010. Proceedings}}, editor = {{Song Dong, Jin and Zhu, Huibiao}}, pages = {{534----548}}, title = {{{On Symmetries and Spotlights - Verifying Parameterised Systems}}}, doi = {{10.1007/978-3-642-16901-4_35}}, year = {{2010}}, } @inproceedings{3194, author = {{Hülsbusch, Mathias and König, Barbara and Rensink, Arend and Semenyak, Maria and Soltenborn, Christian and Wehrheim, Heike}}, booktitle = {{Integrated Formal Methods - 8th International Conference, {IFM} 2010, Nancy, France, October 11-14, 2010. Proceedings}}, editor = {{M{\'{e}}ry, Dominique and Merz, Stephan}}, pages = {{183----198}}, title = {{{Showing Full Semantics Preservation in Model Transformation - {A} Comparison of Techniques}}}, doi = {{10.1007/978-3-642-16265-7_14}}, year = {{2010}}, } @article{3199, author = {{Wehrheim, Heike and Wonisch, Daniel}}, journal = {{Electr. Notes Theor. Comput. Sci.}}, number = {{2}}, pages = {{135----151}}, title = {{{Compositional {CSP} Traces Refinement Checking}}}, doi = {{10.1016/j.entcs.2009.08.022}}, year = {{2009}}, } @article{3200, author = {{Ruhroth, Thomas and Wehrheim, Heike}}, journal = {{Electr. Notes Theor. Comput. Sci.}}, pages = {{193----205}}, title = {{{Static Class Elements for Object-Z}}}, doi = {{10.1016/j.entcs.2009.12.025}}, year = {{2009}}, } @inproceedings{3201, author = {{Ruhroth, Thomas and Voigt, Hendrik and Wehrheim, Heike}}, booktitle = {{35th Euromicro Conference on Software Engineering and Advanced Applications, {SEAA} 2009, Patras, Greece, August 27-29, 2009, Proceedings}}, pages = {{360----367}}, title = {{{Measure, Diagnose, Refactor: {A} Formal Quality Cycle for Software Models}}}, doi = {{10.1109/SEAA.2009.39}}, year = {{2009}}, } @proceedings{3202, editor = {{Leuschel, Michael and Wehrheim, Heike}}, isbn = {{978-3-642-00254-0}}, title = {{{Integrated Formal Methods, 7th International Conference, {IFM} 2009, D{\"{u}}sseldorf, Germany, February 16-19, 2009. Proceedings}}}, doi = {{10.1007/978-3-642-00255-7}}, year = {{2009}}, } @article{3203, author = {{Wehrheim, Heike}}, journal = {{Electr. Notes Theor. Comput. Sci.}}, pages = {{255----264}}, title = {{{Refinement in the Presence of Unknowns}}}, doi = {{10.1016/j.entcs.2008.02.023}}, year = {{2008}}, } @article{3204, author = {{Estler, H.{-}Christian and Wehrheim, Heike}}, journal = {{Electr. Notes Theor. Comput. Sci.}}, pages = {{331----357}}, title = {{{Alloy as a Refactoring Checker?}}}, doi = {{10.1016/j.entcs.2008.06.015}}, year = {{2008}}, } @article{3205, author = {{Möller, Michael and Olderog, Ernst-Rüdiger and Rasch, Holger and Wehrheim, Heike}}, journal = {{Formal Asp. Comput.}}, number = {{2}}, pages = {{161----204}}, title = {{{Integrating a formal method into a software engineering process with {UML} and Java}}}, doi = {{10.1007/s00165-007-0042-7}}, year = {{2008}}, } @article{3206, author = {{Brückner, Ingo and Dräger, Klaus and Finkbeiner, Bernd and Wehrheim, Heike}}, journal = {{Fundam. Inform.}}, number = {{4}}, pages = {{369----392}}, title = {{{Slicing Abstractions}}}, year = {{2008}}, } @inproceedings{3207, author = {{Engels, Gregor and Kleppe, Anneke and Rensink, Arend and Semenyak, Maria and Soltenborn, Christian and Wehrheim, Heike}}, booktitle = {{Model Driven Architecture - Foundations and Applications, 4th European Conference, {ECMDA-FA} 2008, Berlin, Germany, June 9-13, 2008. Proceedings}}, editor = {{Schieferdecker, Ina and Hartman, Alan}}, pages = {{94----109}}, title = {{{From {UML} Activities to {TAAL} - Towards Behaviour-Preserving Model Transformations}}}, doi = {{10.1007/978-3-540-69100-6_7}}, year = {{2008}}, } @inproceedings{3208, author = {{Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}}, booktitle = {{Formal Methods for Open Object-Based Distributed Systems, 10th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2008, Oslo, Norway, June 4-6, 2008, Proceedings}}, editor = {{Barthe, Gilles and S. de Boer, Frank}}, pages = {{78----95}}, title = {{{Mechanizing a Correctness Proof for a Lock-Free Concurrent Stack}}}, doi = {{10.1007/978-3-540-68863-1_6}}, year = {{2008}}, } @inproceedings{3209, author = {{Metzler, Björn and Wehrheim, Heike and Wonisch, Daniel}}, booktitle = {{Formal Methods and Software Engineering, 10th International Conference on Formal Engineering Methods, {ICFEM} 2008, Kitakyushu-City, Japan, October 27-31, 2008. Proceedings}}, editor = {{Liu, Shaoying and S. E. Maibaum, T. and Araki, Keijiro}}, pages = {{105----125}}, title = {{{Decomposition for Compositional Verification}}}, doi = {{10.1007/978-3-540-88194-0_9}}, year = {{2008}}, } @inproceedings{3210, author = {{Wehrheim, Heike}}, booktitle = {{Theoretical Aspects of Computing - {ICTAC} 2008, 5th International Colloquium, Istanbul, Turkey, September 1-3, 2008. Proceedings}}, editor = {{S. Fitzgerald, John and Elisabeth Haxthausen, Anne and Yenig{\"{u}}n, H{\"{u}}sn{\"{u}}}}, pages = {{380----394}}, title = {{{Bounded Model Checking for Partial Kripke Structures}}}, doi = {{10.1007/978-3-540-85762-4_26}}, year = {{2008}}, } @article{3211, author = {{Derrick, John and Wehrheim, Heike}}, journal = {{Acta Inf.}}, number = {{1}}, pages = {{41----71}}, title = {{{On using data abstractions for model checking refinements}}}, doi = {{10.1007/s00236-007-0042-3}}, year = {{2007}}, } @article{3212, author = {{Metzler, Björn and Wehrheim, Heike}}, journal = {{Electr. Notes Theor. Comput. Sci.}}, number = {{2}}, pages = {{47----67}}, title = {{{Extending a Component Specification Language with Time}}}, doi = {{10.1016/j.entcs.2006.02.031}}, year = {{2007}}, } @article{3213, author = {{Estler, H.{-}Christian and Ruhroth, Thomas and Wehrheim, Heike}}, journal = {{Electr. Notes Theor. Comput. Sci.}}, pages = {{3----17}}, title = {{{Modelchecking Correctness of Refactorings - Some Experiments}}}, doi = {{10.1016/j.entcs.2006.08.041}}, year = {{2007}}, } @inproceedings{3214, author = {{Engels, Gregor and Güldali, Baris and Soltenborn, Christian and Wehrheim, Heike}}, booktitle = {{Applications of Graph Transformations with Industrial Relevance, Third International Symposium, {AGTIVE} 2007, Kassel, Germany, October 10-12, 2007, Revised Selected and Invited Papers}}, editor = {{Sch{\"{u}}rr, Andy and Nagl, Manfred and Z{\"{u}}ndorf, Albert}}, pages = {{17----31}}, title = {{{Assuring Consistency of Business Process Models and Web Services Using Visual Contracts}}}, doi = {{10.1007/978-3-540-89020-1_2}}, year = {{2007}}, } @inproceedings{3215, author = {{Engels, Gregor and Soltenborn, Christian and Wehrheim, Heike}}, booktitle = {{Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings}}, editor = {{M. Bonsangue, Marcello and Broch Johnsen, Einar}}, pages = {{76----90}}, title = {{{Analysis of {UML} Activities Using Dynamic Meta Modeling}}}, doi = {{10.1007/978-3-540-72952-5_5}}, year = {{2007}}, } @inproceedings{3216, author = {{Ruhroth, Thomas and Wehrheim, Heike}}, booktitle = {{Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings}}, editor = {{M. Bonsangue, Marcello and Broch Johnsen, Einar}}, pages = {{236----251}}, title = {{{Refactoring Object-Oriented Specifications with Data and Processes}}}, doi = {{10.1007/978-3-540-72952-5_15}}, year = {{2007}}, } @inproceedings{3221, author = {{Schäfer, Wilhelm and Wehrheim, Heike}}, booktitle = {{International Conference on Software Engineering, {ISCE} 2007, Workshop on the Future of Software Engineering, {FOSE} 2007, May 23-25, 2007, Minneapolis, MN, {USA}}}, editor = {{C. Briand, Lionel and L. Wolf, Alexander}}, pages = {{72----84}}, title = {{{The Challenges of Building Advanced Mechatronic Systems}}}, doi = {{10.1109/FOSE.2007.28}}, year = {{2007}}, } @inproceedings{3222, author = {{Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}}, booktitle = {{Integrated Formal Methods, 6th International Conference, {IFM} 2007, Oxford, UK, July 2-5, 2007, Proceedings}}, editor = {{Davies, Jim and Gibbons, Jeremy}}, pages = {{195----214}}, title = {{{Proving Linearizability Via Non-atomic Refinement}}}, doi = {{10.1007/978-3-540-73210-5_11}}, year = {{2007}}, } @article{3223, author = {{Brückner, Ingo and Metzler, Björn and Wehrheim, Heike}}, journal = {{Nord. J. Comput.}}, number = {{1-2}}, pages = {{22----45}}, title = {{{Optimizing Slicing of Formal Specifications by Deductive Verification}}}, year = {{2006}}, } @inproceedings{3224, author = {{Derrick, John and Wehrheim, Heike}}, booktitle = {{Algebraic Methodology and Software Technology, 11th International Conference, {AMAST} 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings}}, editor = {{Johnson, Michael and Vene, Varmo}}, pages = {{111----126}}, title = {{{Model Transformations Incorporating Multiple Views}}}, doi = {{10.1007/11784180_11}}, year = {{2006}}, } @inproceedings{3225, author = {{Wehrheim, Heike}}, booktitle = {{Formal Methods and Software Engineering, 8th International Conference on Formal Engineering Methods, {ICFEM} 2006, Macao, China, November 1-3, 2006, Proceedings}}, editor = {{Liu, Zhiming and He, Jifeng}}, pages = {{514----528}}, title = {{{Incremental Slicing}}}, doi = {{10.1007/11901433_28}}, year = {{2006}}, } @proceedings{3226, editor = {{Gorrieri, Roberto and Wehrheim, Heike}}, isbn = {{3-540-34893-X}}, title = {{{Formal Methods for Open Object-Based Distributed Systems, 8th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2006, Bologna, Italy, June 14-16, 2006, Proceedings}}}, doi = {{10.1007/11768869}}, year = {{2006}}, } @article{3227, author = {{Olderog, Ernst-Rüdiger and Wehrheim, Heike}}, journal = {{Sci. Comput. Program.}}, number = {{1-3}}, pages = {{227----257}}, title = {{{Specification and (property) inheritance in {CSP-OZ}}}}, doi = {{10.1016/j.scico.2004.05.017}}, year = {{2005}}, } @article{3228, author = {{Wehrheim, Heike}}, journal = {{Theor. Comput. Sci.}}, number = {{3}}, pages = {{509----528}}, title = {{{Slicing techniques for verification re-use}}}, doi = {{10.1016/j.tcs.2005.06.020}}, year = {{2005}}, } @inproceedings{3229, author = {{Rasch, Holger and Wehrheim, Heike}}, booktitle = {{Formal Methods for Open Object-Based Distributed Systems, 7th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2005, Athens, Greece, June 15-17, 2005, Proceedings}}, editor = {{Steffen, Martin and Zavattaro, Gianluigi}}, pages = {{67----82}}, title = {{{Checking the Validity of Scenarios in {UML} Models}}}, doi = {{10.1007/11494881_5}}, year = {{2005}}, } @inproceedings{3230, author = {{Brückner, Ingo and Wehrheim, Heike}}, booktitle = {{Formal Methods and Software Engineering, 7th International Conference on Formal Engineering Methods, {ICFEM} 2005, Manchester, UK, November 1-4, 2005, Proceedings}}, editor = {{Lau, Kung{-}Kiu and Banach, Richard}}, pages = {{360----374}}, title = {{{Slicing an Integrated Formal Method for Verification}}}, doi = {{10.1007/11576280_25}}, year = {{2005}}, } @inproceedings{3231, author = {{Derrick, John and Wehrheim, Heike}}, booktitle = {{{ZB} 2005: Formal Specification and Development in {Z} and B, 4th International Conference of {B} and {Z} Users, Guildford, UK, April 13-15, 2005, Proceedings}}, editor = {{Treharne, Helen and King, Steve and C. Henson, Martin and A. Schneider, Steve}}, pages = {{24----44}}, title = {{{Non-atomic Refinement in {Z} and {CSP}}}}, doi = {{10.1007/11415787_3}}, year = {{2005}}, } @inproceedings{3232, author = {{Brückner, Ingo and Wehrheim, Heike}}, booktitle = {{{ZB} 2005: Formal Specification and Development in {Z} and B, 4th International Conference of {B} and {Z} Users, Guildford, UK, April 13-15, 2005, Proceedings}}, editor = {{Treharne, Helen and King, Steve and C. Henson, Martin and A. Schneider, Steve}}, pages = {{414----433}}, title = {{{Slicing Object-Z Specifications for Verification}}}, doi = {{10.1007/11415787_24}}, year = {{2005}}, } @inproceedings{3233, author = {{Wehrheim, Heike}}, booktitle = {{Architecting Systems with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers}}, editor = {{H. Reussner, Ralf and A. Stafford, Judith and A. Szyperski, Clemens}}, pages = {{84----102}}, title = {{{Refinement and Consistency in Component Models with Multiple Views}}}, doi = {{10.1007/11786160_5}}, year = {{2004}}, } @inproceedings{3234, author = {{Möller, Michael and Olderog, Ernst-Rüdiger and Rasch, Holger and Wehrheim, Heike}}, booktitle = {{Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April 4-7, 2004, Proceedings}}, editor = {{A. Boiten, Eerke and Derrick, John and Smith, Graeme}}, pages = {{267----286}}, title = {{{Linking {CSP-OZ} with {UML} and Java: {A} Case Study}}}, doi = {{10.1007/978-3-540-24756-2_15}}, year = {{2004}}, } @inproceedings{3235, author = {{Wehrheim, Heike}}, booktitle = {{Language Engineering for Model-Driven Software Development, 29. February - 5. March 2004}}, editor = {{B{\'{e}}zivin, Jean and Heckel, Reiko}}, title = {{{Refinement and Consistency in Multiview Models}}}, year = {{2004}}, } @article{3236, author = {{Wehrheim, Heike}}, journal = {{Formal Methods in System Design}}, number = {{2}}, pages = {{143----170}}, title = {{{Behavioral Subtyping Relations for Active Objects}}}, doi = {{10.1023/A:1024764232069}}, year = {{2003}}, } @inproceedings{3237, author = {{Wehrheim, Heike}}, booktitle = {{Formal Methods for Components and Objects, Second International Symposium, {FMCO} 2003, Leiden, The Netherlands, November 4-7, 2003, Revised Lectures}}, editor = {{S. de Boer, Frank and M. Bonsangue, Marcello and Graf, Susanne and P. de Roever, Willem}}, pages = {{330----343}}, title = {{{Preserving Properties Under Change}}}, doi = {{10.1007/978-3-540-30101-1_16}}, year = {{2003}}, } @inproceedings{3238, author = {{Wehrheim, Heike}}, booktitle = {{Formal Methods for Open Object-Based Distributed Systems, 6th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2003, Paris, France, November 19.21, 2003, Proceedings}}, editor = {{Najm, Elie and Nestmann, Uwe and Stevens, Perdita}}, pages = {{79----93}}, title = {{{Inheritance of Temporal Logic Properties}}}, doi = {{10.1007/978-3-540-39958-2_6}}, year = {{2003}}, } @inproceedings{3239, author = {{Rasch, Holger and Wehrheim, Heike}}, booktitle = {{Formal Methods for Open Object-Based Distributed Systems, 6th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2003, Paris, France, November 19.21, 2003, Proceedings}}, editor = {{Najm, Elie and Nestmann, Uwe and Stevens, Perdita}}, pages = {{229----243}}, title = {{{Checking Consistency in {UML} Diagramms: Classes and State Machines}}}, doi = {{10.1007/978-3-540-39958-2_16}}, year = {{2003}}, } @inproceedings{3240, author = {{Derrick, John and Wehrheim, Heike}}, booktitle = {{{ZB} 2003: Formal Specification and Development in {Z} and B, Third International Conference of {B} and {Z} Users, Turku, Finland, June 4-6, 2003, Proceedings}}, editor = {{Bert, Didier and P. Bowen, Jonathan and King, Steve and A. Wald{\'{e}}n, Marina}}, pages = {{127----147}}, title = {{{Using Coupled Simulations in Non-atomic Refinement}}}, doi = {{10.1007/3-540-44880-2_10}}, year = {{2003}}, } @article{3241, author = {{Wehrheim, Heike}}, journal = {{Nord. J. Comput.}}, number = {{4}}, pages = {{405----435}}, title = {{{Relating State-based and Behaviour-oriented Subtyping}}}, year = {{2002}}, } @inproceedings{3242, author = {{Olderog, Ernst-Rüdiger and Wehrheim, Heike}}, booktitle = {{Formal Methods for Components and Objects, First International Symposium, {FMCO} 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures}}, editor = {{S. de Boer, Frank and M. Bonsangue, Marcello and Graf, Susanne and P. de Roever, Willem}}, pages = {{361----379}}, title = {{{Specification and Inheritance in {CSP-OZ}}}}, doi = {{10.1007/978-3-540-39656-7_15}}, year = {{2002}}, } @inproceedings{3243, author = {{Wehrheim, Heike}}, booktitle = {{Formal Methods for Open Object-Based Distributed Systems V, {IFIP} {TC6/WG6.1} Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems {(FMOODS} 2002), March 20-22, 2002, Enschede, The Netherlands}}, editor = {{Jacobs, Bart and Rensink, Arend}}, pages = {{79----93}}, title = {{{Checking Behavioural Subtypes via Refinement}}}, year = {{2002}}, } @article{3244, author = {{Rensink, Arend and Wehrheim, Heike}}, journal = {{Acta Inf.}}, number = {{3}}, pages = {{155----234}}, title = {{{Process algebra with action dependencies}}}, doi = {{10.1007/s002360100070}}, year = {{2001}}, } @article{3245, author = {{Bartetzko, Detlef and Fischer, Clemens and Möller, Michael and Wehrheim, Heike}}, journal = {{Electr. Notes Theor. Comput. Sci.}}, number = {{2}}, pages = {{103----117}}, title = {{{Jass - Java with Assertions}}}, doi = {{10.1016/S1571-0661(04)00247-6}}, year = {{2001}}, } @inproceedings{3246, author = {{Fischer, Clemens and Olderog, Ernst-Rüdiger and Wehrheim, Heike}}, booktitle = {{Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings}}, editor = {{Hu{\ss}mann, Heinrich}}, pages = {{91----108}}, title = {{{A {CSP} View on {UML-RT} Structure Diagrams}}}, doi = {{10.1007/3-540-45314-8_8}}, year = {{2001}}, } @article{3247, author = {{Fischer, Clemens and Wehrheim, Heike}}, journal = {{Bulletin of the {EATCS}}}, pages = {{92----101}}, title = {{{Failure-Divergence Semantics as a Formal Basis for an Object-Oriented Integrated Formal Method}}}, year = {{2000}}, } @article{3248, author = {{Wehrheim, Heike}}, journal = {{Formal Asp. Comput.}}, number = {{3}}, pages = {{147----164}}, title = {{{Data Abstraction Techniques in the Validation of {CSP-OZ} Specifications}}}, doi = {{10.1007/s001650070026}}, year = {{2000}}, } @inproceedings{3249, author = {{Fischer, Clemens and Wehrheim, Heike}}, booktitle = {{Algebraic Methodology and Software Technology. 8th International Conference, {AMAST} 2000, Iowa City, Iowa, USA, May 20-27, 2000, Proceedings}}, editor = {{Rus, Teodor}}, pages = {{469----483}}, title = {{{Behavioural Subtyping Relations for Object-Oriented Formalisms}}}, doi = {{10.1007/3-540-45499-3_33}}, year = {{2000}}, } @inproceedings{3250, author = {{Wehrheim, Heike}}, booktitle = {{Fundamental Approaches to Software Engineering, Third Internationsl Conference, {FASE} 2000, Held as Part of the European Joint Conferences on the Theory and Practice of Software, {ETAPS} 2000, Berlin, Germany, March 25 - April 2, 2000, Proceedings}}, editor = {{S. E. Maibaum, T.}}, pages = {{334----348}}, title = {{{Specification of an Automatic Manufacturing System: {A} Case Study in Using Integrated Formal Methods}}}, doi = {{10.1007/3-540-46428-X_23}}, year = {{2000}}, } @inproceedings{3251, author = {{Wehrheim, Heike}}, booktitle = {{Formal Methods for Open Object-Based Distributed Systems IV, {IFIF} {TC6/WG6.1} Fourth International Conference on Formal Methods for Open Object-Based Distributed Systems {(FMOODS} 2000), September 6-8, 2000, Stanford, California, {USA}}}, editor = {{F. Smith, Scott and L. Talcott, Carolyn}}, pages = {{213----231}}, title = {{{Behavioural Subtyping and Property Preservation}}}, doi = {{10.1007/978-0-387-35520-7_11}}, year = {{2000}}, } @article{3252, author = {{Wehrheim, Heike}}, journal = {{Electr. Notes Theor. Comput. Sci.}}, pages = {{71----84}}, title = {{{Partial order reductions for failures refinement}}}, doi = {{10.1016/S1571-0661(05)80296-8}}, year = {{1999}}, } @inproceedings{3253, author = {{Wehrheim, Heike}}, booktitle = {{FM'99 - Formal Methods, World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999, Proceedings, Volume {II}}}, editor = {{M. Wing, Jeannette and Woodcock, Jim and Davies, Jim}}, pages = {{1028----1047}}, title = {{{Data Abstraction for {CSP-OZ}}}}, doi = {{10.1007/3-540-48118-4_5}}, year = {{1999}}, } @inproceedings{3254, author = {{Fischer, Clemens and Wehrheim, Heike}}, booktitle = {{Integrated Formal Methods, Proceedings of the 1st International Conference on Integrated Formal Methods, {IFM} 99, York, UK, 28-29 June 1999}}, editor = {{Araki, Keijiro and Galloway, Andy and Taguchi, Kenji}}, pages = {{315----334}}, title = {{{Model-Checking {CSP-OZ} Specifications with {FDR}}}}, year = {{1999}}, } @inproceedings{3255, author = {{Gehrke, Thomas and Huhn, Michaela and Niebert, Peter and Rensink, Arend and Wehrheim, Heike}}, booktitle = {{Formale Beschreibungstechniken f{\"{u}}r verteilte Systeme, 8. GI/ITG-Fachgespr{\"{a}}ch, Cottbus, 4. und 5. Juni 1998}}, editor = {{K{\"{o}}nig, Hartmut and Langend{\"{o}}rfer, Peter}}, pages = {{185----196}}, title = {{{A Process Algebra Semantics for {MSC} Including Conditions}}}, year = {{1998}}, } @inproceedings{3256, author = {{Gehrke, Thomas and Huhn, Michaela and Rensink, Arend and Wehrheim, Heike}}, booktitle = {{Formal Description Techniques and Protocol Specification, Testing and Verification, {FORTE} {XI} / {PSTV} XVIII'98, {IFIP} {TC6} {WG6.1} Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols {(FORTE} {XI)} and Protocol Specification, Testing and Verification {(PSTV} XVIII), 3-6 November, 1998, Paris, France}}, editor = {{Budkowski, Stanislaw and R. Cavalli, Ana and Najm, Elie}}, pages = {{3----18}}, title = {{{An Algebraic Semantics for Message Sequence Chart Documents}}}, year = {{1998}}, } @inproceedings{3257, author = {{Huhn, Michaela and Niebert, Peter and Wehrheim, Heike}}, booktitle = {{Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings}}, editor = {{Arvind, Vikraman and Ramanujam, Ramaswamy}}, pages = {{271----282}}, title = {{{Partial Order Reductions for Bisimulation Checking}}}, doi = {{10.1007/978-3-540-49382-2_26}}, year = {{1998}}, } @inproceedings{3258, author = {{Rensink, Arend and Wehrheim, Heike}}, booktitle = {{Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings}}, editor = {{Pr{\'{\i}}vara, Igor and Ruzicka, Peter}}, pages = {{468----477}}, title = {{{Dependency-Based Action Refinement}}}, doi = {{10.1007/BFb0029990}}, year = {{1997}}, } @inproceedings{3259, author = {{Rensink, Arend and Wehrheim, Heike}}, booktitle = {{Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings}}, editor = {{Pr{\'{\i}}vara, Igor and Ruzicka, Peter}}, pages = {{468----477}}, title = {{{Dependency-Based Action Refinement}}}, doi = {{10.1007/BFb0029990}}, year = {{1997}}, } @phdthesis{3260, author = {{Wehrheim, Heike}}, publisher = {{University of Hildesheim, Germany}}, title = {{{Specifying reactive systems with action dependencies: modelling and hierarchical design}}}, year = {{1996}}, } @article{3261, author = {{Goltz, Ursula and Wehrheim, Heike}}, journal = {{Inf. Process. Lett.}}, number = {{4}}, pages = {{179----184}}, title = {{{Modelling Causality via Action Dependencies in Branching Time Semantics}}}, doi = {{10.1016/0020-0190(96)00111-1}}, year = {{1996}}, } @inproceedings{3262, author = {{Goltz, Ursula and Wehrheim, Heike}}, booktitle = {{Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings}}, editor = {{Penczek, Wojciech and Szalas, Andrzej}}, pages = {{394----406}}, title = {{{Causal Testing}}}, doi = {{10.1007/3-540-61550-4_165}}, year = {{1996}}, } @inproceedings{3263, author = {{Rensink, Arend and Wehrheim, Heike}}, booktitle = {{{CONCUR} '94, Concurrency Theory, 5th International Conference, Uppsala, Sweden, August 22-25, 1994, Proceedings}}, editor = {{Jonsson, Bengt and Parrow, Joachim}}, pages = {{226----241}}, title = {{{Weak Sequential Composition in Process Algebras}}}, doi = {{10.1007/978-3-540-48654-1_20}}, year = {{1994}}, } @inproceedings{3264, author = {{Wehrheim, Heike}}, booktitle = {{Programming Concepts, Methods and Calculi, Proceedings of the {IFIP} {TC2/WG2.1/WG2.2/WG2.3} Working Conference on Programming Concepts, Methods and Calculi {(PROCOMET} '94) San Miniato, Italy, 6-10 June, 1994}}, editor = {{Olderog, Ernst{-}R{\"{u}}diger}}, pages = {{247----266}}, title = {{{Parametric Action Refinement}}}, year = {{1994}}, }