default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11. AMAST 2006: Kuressaare, Estonia
- Michael Johnson
, Varmo Vene:
Algebraic Methodology and Software Technology, 11th International Conference, AMAST 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings. Lecture Notes in Computer Science 4019, Springer 2006, ISBN 3-540-35633-9
Invited Talks
- Ralph-Johan Back:
Incremental Software Construction with Refinement Diagrams. 1 - Lawrence S. Moss:
Recursive Program Schemes: Past, Present, and Future. 2 - Till Mossakowski:
Monad-Based Logics for Computational Effects. 3-4
Contributed Papers
- Irem Aktug, Dilian Gurov:
State Space Representation for Verification of Open Systems. 5-20 - Brad Alexander, Andrew L. Wendelborn:
Data Movement Optimisation in Point-Free Form. 21-35 - Benjamin Aziz:
Measuring the Speed of Information Leakage in Mobile Processes. 36-50 - Emilie Balland, Claude Kirchner, Pierre-Etienne Moreau:
Formal Islands. 51-65 - Guillaume Bonfante:
Some Programming Languages for Logspace and Ptime. 66-80 - Mila Dalla Preda, Matias Madou, Koen De Bosschere, Roberto Giacobazzi:
Opaque Predicates Detection by Abstract Interpretation. 81-95 - Matteo Dell'Amico, Maura Cerioli:
DO-Casl: An Observer-Based Casl Extension for Dynamic Specifications. 96-110 - John Derrick, Heike Wehrheim:
Model Transformations Incorporating Multiple Views. 111-126 - Ernst-Erich Doberkat:
Hyperfinite Approximations to Labeled Markov Transition Systems. 127-141 - Azadeh Farzan, José Meseguer:
State Space Reduction of Rewrite Theories Using Invisible Transitions. 142-157 - William L. Harrison:
The Essence of Multitasking. 158-172 - Armin Kühnemann, Andreas Maletti:
The Substitution Vanishes. 173-188 - Juliana Küster Filipe:
Decomposing Interactions. 189-203 - Tristan Le Gall, Bertrand Jeannet, Thierry Jéron:
Verification of Communication Protocols Using Abstract Interpretation of FIFO Queues. 204-219 - Natalia López, Manuel Núñez, Ismael Rodríguez:
Assessing the Expressivity of Formal Specification Languages. 220-234 - Carlos López Pombo, Marcelo F. Frias:
Fork Algebras as a Sufficiently Rich Universal Institution. 235-247 - Arjan J. Mooij, Judi Romijn, Wieger Wesselink:
Realizability Criteria for Compositional MSC. 248-262 - Bernhard Möller, Peter Höfner, Georg Struth:
Quantales and Temporal Logics. 263-277 - Härmel Nestra:
Fractional Semantics. 278-292 - Susumu Nishimura:
Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic. 293-307 - Dusko Pavlovic, Michael W. Mislove, James Worrell:
Testing Semantics: Connecting Processes and Process Logics. 308-322 - Georg Struth:
Tableaux for Lattices. 323-337 - Miguel Valero Espada, Jaco van de Pol:
Accelerated Modal Abstractions of Labelled Transition Systems. 338-352 - M. Birna van Riemsdijk, John-Jules Ch. Meyer:
A Compositional Semantics of Plan Revision in Intelligent Agents. 353-367
System Descriptions
- Manuel Clavel, Marina Egea:
ITP/OCL: A Rewriting-Based Validation Tool for UML+OCL Static Class Diagrams. 368-373 - Alastair F. Donaldson, Alice Miller:
A Computational Group Theoretic Symmetry Reduction Package for the Spin Model Checker. 374-380 - Paul-Christophe Varoutas, Philippe Rizand, Alain Livartowski:
Using Category Theory as a Basis for a Heterogeneous Data Source Search Meta-engine: The Prométhée Framework. 381-387
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.
last updated on 2024-11-15 19:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
