![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Formal Aspects of Computing, Volume 24
Volume 24, Number 1, January 2012
- Eerke A. Boiten
, John Derrick
, Jin Song Dong, Steve Reeves
:
Editorial. 1 - Carroll Morgan:
Compositional noninterference from first principles. 3-26 - Wim H. Hesselink
, Muhammad Ikram Ullah Lali:
Formalizing a hierarchical file system. 27-44 - Jeff W. Sanders, Graeme Smith
:
Emergence and refinement. 45-65 - Viorel Preoteasa, Ralph-Johan Back:
Invariant diagrams with data refinement. 67-95 - Stefan Hallerstede, Michael Leuschel:
Experiments in program verification using Event-B. 97-125 - Frank Zeyda, Marcel Oliveira
, Ana Cavalcanti
:
Mechanised support for sound refinement tactics. 127-160
Volume 24, Number 2, March 2012
- José Luiz Fiadeiro:
Editorial. 161-162 - Antonio Filieri
, Carlo Ghezzi, Giordano Tamburrelli:
A formal approach to adaptive software: continuous assurance of non-functional requirements. 163-186 - Natallia Kokash
, Christian Krause, Erik P. de Vink:
Reo + mCRL2: A framework for model-checking dataflow in service compositions. 187-216 - José Bernardo Barros
, Daniela Carneiro da Cruz, Pedro Rangel Henriques
, Jorge Sousa Pinto
:
Assertion-based slicing and slice graphs. 217-248 - Peter A. Lindsay
, Nisansala Yatapanage
, Kirsten Winter:
Cut Set Analysis using Behavior Trees and model checking. 249-266 - Mieke Massink
, Diego Latella
, Andrea Bracciali
, Michael D. Harrison
, Jane Hillston:
Scalable context-dependent analysis of emergency egress models. 267-302
Volume 24, Number 3, May 2012
- Jim Woodcock
:
Editorial. 303 - Cliff B. Jones:
John McCarthy (1927-2011). 305-306 - Michele Risi, Giuseppe Scanniello
, Genoveffa Tortora:
Using fold-in and fold-out in the architecture recovery of software systems. 307-330 - Wilkerson de L. Andrade
, Patrícia D. L. Machado:
Testing interruptions in reactive systems. 331-353 - Moonzoo Kim, Yunho Kim, Yunja Choi:
Concolic testing of the multi-sector read operation for flash storage platform software. 355-374 - Jan Tobias Mühlberg
, Gerald Lüttgen:
Verifying compiled file system code. 375-391 - John Derrick
, Graeme Smith
:
Temporal-logic property preservation under Z refinement. 393-416
Volume 24, Numbers 4-6, July 2012
- Peter Höfner:
Preface. 417-422 - Tony Hoare, Stephan van Staden:
In praise of algebra. 423-431 - José Nuno Oliveira
:
Towards a linear algebra of programming. 433-458 - Peter Höfner, Bernhard Möller:
Dijkstra, Floyd and Warshall meet Kleene. 459-476 - Mani Swaminathan, Joost-Pieter Katoen
, Ernst-Rüdiger Olderog:
Layered reasoning for randomized distributed algorithms. 477-496 - Jasen Markovski, Pedro R. D'Argenio
, Jos C. M. Baeten, Erik P. de Vink:
Reconciling real and stochastic time: the need for probabilistic refinement. 497-518 - K. Rustan M. Leino, Kuat Yessenov:
Stepwise refinement of heap-manipulating code in Chalice. 519-535 - Bengt Jonsson:
Using refinement calculus techniques to prove linearizability. 537-554 - Michael J. Butler
:
External and internal choice with event groups in Event-B. 555-567 - Alberto Pettorossi
, Maurizio Proietti
, Valerio Senni
:
Constraint-based correctness proofs for logic program transformations. 569-594 - Patricia Bouyer, Nicolas Markey
, Joël Ouaknine
, Philippe Schnoebelen, James Worrell
:
On termination and invariance for faulty channel machines. 595-607 - Richard S. Bird:
On building cyclic and shared structures in Haskell. 609-621 - Kento Emoto, Sebastian Fischer, Zhenjiang Hu:
Filter-embedding semiring fusion for programming with MapReduce. 623-645 - Glynn Winskel:
Deterministic concurrent strategies. 647-660 - Marta Z. Kwiatkowska, Gethin Norman
, David Parker
:
Probabilistic verification of Herman's self-stabilisation algorithm. 661-670 - Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine
, Björn Wachter, James Worrell
:
Three tokens in Herman's algorithm. 671-678 - Robert M. Hierons
, Manuel Núñez
:
Using schedulers to test probabilistic distributed systems. 679-699 - Yuxin Deng
, Alwen Tiu:
Characterisations of testing preorders for a finite probabilistic π-calculus. 701-726 - Sonja Georgievska, Suzana Andova:
Probabilistic may/must testing: retaining probabilities by restricted schedulers. 727-748 - Matthew Hennessy:
Exploring probabilistic bisimulations, part I. 749-768 - Ron van der Meyden
:
Architectural refinement and notions of intransitive noninterference. 769-792 - Jayadev Misra:
A secure voting scheme based on rational self-interest. 793-805
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.