WADT 2012

WADT 2012 Accepted abstracts

The scientific program of the workshop will include presentations of recent results and ongoing research. The presentations will be selected on the basis of the submitted abstracts according to originality, significance, and general interest. The abstracts have to be submitted electronically according to the instructions published on the workshop homepage.

The final versions of the selected abstracts will be included in a flash drive for the workshop participants. Preliminary proceedings are available here in pdf format.

After the workshop, selected authors will be invited to submit full papers for the refereed proceedings, which will be published as a volume of Lecture Notes in Computer Science (LNCS 7841, Springer). Further information: Proceedings section.

• Irina Mariuca Asavoae: Systematic Design of Abstractions in K
• Irina Mariuca Asavoae, Frank de Boer, Marcello M. Bonsangue, Dorel Lucanu and Jurriaan Rot: Bounded Model Checking of Recursive Programs with Pointers in K
• Mihail Asavoae: A K-Based Methodology for Modular Design of Embedded Systems
• Lucian Bentea and Peter Olveczky: A History-Dependent Probabilistic Strategy Language for Probabilistic Rewrite Theories
• Mohamed Bettaz, Mourad Maouche and Mhamed Mosteghanemi: An Object-Z Institution for Specifying Dynamic Object Behavior
• Roberto Bruni, Andrea Corradini, Fabio Gadducci, Alberto Lluch Lafuente and Andrea Vandin: Adaptable Transition Systems
• Valentin Cassano, Carlos G. Lopez Pombo and Tom Maibaum: Entailment Systems for Default Reasoning
• Mihai Codescu, Fulya Horozal, Iulia Ignatov and Florian Rabe: Representing CASL in a Proof-Theoretical Logical Framework
• Mihai Codescu, Fulya Horozal, Till Mossakowski and Florian Rabe: Compiling Logics
• Andrea Corradini, Reiko Heckel, Frank Hermann, Susann Gottmann and Nico Nachtigall: On the Concurrent Semantics of Transformation Systems with Negative Application Conditions
• Antonina Danylenko and Welf Löwe: Decision Algebra: Parameterized Specification of Decision Models
• Razvan Diaconescu: A module algebra for behavioral specifications
• Zinovy Diskin and Tom Maibaum: Query Languages are Cartesian Monads
• Jonas Eckhardt, Tobias Mühlbauer, José Meseguer and Martin Wirsing: Statistical Model-Checking for Composite Actor Systems
• Ignacio Fábregas, David Frutos Escrig and Miguel Palomino: On Linear Contravariant Semantics
• Fabio Gadducci and Giacoma Monreale: Soft Constraints with Lexicographic Ordering
• Fabio Gadducci, Giacoma Monreale and Ugo Montanari: On Open Semantics for Reactive Systems
• Rolf Hennicker and Alexander Knapp: From Interface Theories to Assembly Theories
• Mark Hills: Streamlining Policy Creation in Policy Frameworks
• Fulya Horozal and Florian Rabe: Representing Categories of Theories in a Proof-Theoretical Logical Framework
• Phillip James, Till Mossakowski and Markus Roggenbach: Designing DSLs – A Craftsman’s Approach for the Railway Domain using OWL and CASL
• Carlos Gustavo Lopez Pombo, Pablo F. Castro, Nazareno M. Aguirre and Tomas S.E. Maibaum: Satisfiability calculi: the semantic counterpart of a proof calculus in general logics
• Carlos Gustavo Lopez Pombo and Marcelo Frias: Categorical Characterization of Structure Building Operations
• Alexandre Madeira, Manuel A. Martins and Luis Barbosa: Execution modes as local states — towards a formal semantics for reconfigurable systems
• Grzegorz Marczyński: Constructions - Models of Signatures with Dependency Structure
• Till Mossakowski, Oliver Kutz and Christoph: Lange Semantics of the distributed ontology language: Institutes and Institutions
• Pedro Nora: Dualities for modal algebras
• Isabel Pita and María Inés Fernandez Camacho: Formal specification of the Kademlia and the Kad routing tables in Maude
• Florian Rabe and Kristina Sojakova: Mechanically Verifying Logic Translations
• Adrian Riesco, Irina Mariuca Asavoae and Mihail Asavoae: Debugging Programs using the Language Definition
• David Romero Hernández and David Frutos Escrig: Distances Between Processes: a Pure Algebraic Approach
• Fernando Rosa-Velardo and María Martos-Salgado: Multiset Rewriting for the Verification of Depth-Bounded Processes with Name Binding
• Alejandro Sanchez, Luis S. Barbosa and Daniel Riesco: Deriving architectural reconfigurations
• Pierre-Yves Schobbens: Verifying Parallel Recursive Programs by Regular Approximations of Context-Free Languages
• Ionut Tutu: On the Instantiation of Parameterised Specifications
• Baltasar Trancón Y Widemann: From Bialgebraic Semantics to Universal Simulators of Cellular Automata