Computer and information sciences topic list of research papers
-
A Rewriting Logic Approach to Operational Semantics (Extended Abstract)
Abstract This paper shows how rewriting logic semantics (RLS) can be used as a computational logic framework for operational semantic definitions of programming languages. Several operational semantics styles are addressed: big-step and small-step...
2007 / Traian Florin Şerbănuţă, Grigore Roşu, José Meseguer -
Hoare vs Milner: Comparing Synchronizations in a Graphical Framework With Mobility
Abstract We compare the expressive power of Hoare (i.e., CSP style) and Milner (i.e., CCS style) synchronizations for defining graph transformations in a framework where edges can perform actions on adjacent nodes to synchronize their evolutions....
2006 / Ivan Lanese, Ugo Montanari -
Preface2008 / Demis Ballis, Santiago Escobar, Massimo Marchiori
-
Slicing-based Reductions for Rebeca
Abstract Slicing is a program analysis technique which can be used for reducing the size of the model and avoid state explosion in model checking. In this work a static slicing technique is proposed for reducing Rebeca models with respect to a...
2009 / Hamideh Sabouri, Marjan Sirjani -
Preface2004 / Mario Bravetti, Roberto Gorrieri
-
Trust Evolution Policies for Security in Collaborative Ad Hoc Applications
Abstract The vision of pervasive computing has introduced the notion of a vast, networked infrastructure of heterogeneous entities interact through collaborative applications, e.g., playing a multi-player online game on the way to work. This will...
2006 / Elizabeth Gray, Christian Jensen, Paul O'Connell, Stefan Weber, Jean-Marc Seigneur, et al. -
The ARC Programming Model – Language Constructs for Coordination
Abstract The ARC (Actor, Role, Coordinator) model addresses the coordination requirements of open, distributed applications deployed in dynamic environments. This paper introduces the ARC programming model and the ARC-PL programming language,...
2009 / Kevin Marth, Shangping Ren -
Observational Equivalence for the Interaction Combinators and Internal Separation
Abstract We define an observational equivalence for Lafont's interaction combinators, which we prove to be the least discriminating non-trivial congruence on total nets (nets admitting a deadlock-free normal form) respecting reduction. More...
2007 / Damiano Mazza -
Modularity of Behaviours for Mathematical Operational Semantics
Abstract Some years ago, Turi and Plotkin gave a precise mathematical formulation of a notion of structural operational semantics: their formulation is equivalent to a distributive law of the free monad on a signature over the cofree copointed...
2004 / Marco Kick, John Power -
Simulations as Homotopies2004 / Kathryn Hess, Paul-Eugène Parent, Andrew Tonks, Krzysztof Worytkiewicz
-
Preface2009 / Theo Dimitrakos, Fabio Martinelli
-
A Static Analysis for Beta-Binders
Abstract We introduce a Control Flow Analysis, that statically approximates the dynamic behaviour of processes, expressed in the Beta-Binders calculus. Our analysis of a system is able to describe the essential behaviour of each box, tracking all...
2008 / Chiara Bodei -
PVS Embedding of cCSP Semantic Models and Their Relationship
Abstract This paper demonstrates an embedding of the semantic models of the cCSP process algebra in the general purpose theorem prover PVS. cCSP is a language designed to model long-running business transactions with constructs for orchestration of...
2009 / Shamim H. Ripon, Michael J. Butler -
An Alternative Direct Simulation of Minsky Machines into Classical Bunched Logics via Group Semantics
Abstract Recently, Brotherston & Kanovich, and independently Larchey-Wendling & Galmiche, proved the undecidability of the bunched implication logic BBI. Moreover, Brotherston & Kanovich also proved the undecidability of the related...
2010 / Dominique Larchey-Wendling -
Nested Semantics over Finite Trees are Equationally Hard
Abstract One of the criteria that has been put forward for studying the mathematical tractability of the behavioural equivalences in van Glabbeek's linear time- banching time spectrum is that they afford elegant, finite equational axiomatizations...
2004 / Luca Aceto -
The Conversion of Dynamic Fault Trees to Stochastic Petri Nets, as a case of Graph Transformation
Abstract A model-to-model transformation from Dynamic Fault Trees to Stochastic Petri Nets, by means of graph transformation rules, is presented in this paper. Dynamic Fault Trees (DFT) are used for the reliability analysis of complex and large...
2005 / Daniele Codetta-Raiteri -
Term-graph Rewriting in Tom Using Relative Positions
Abstract In this paper, we present the implementation in Tom of a de Bruijn indices generalization allowing the representation of term-graphs over an algebraic signature. By adding pattern matching and traversal controls to Java, Tom is a...
2008 / Emilie Balland, Paul Brauner -
Patterns for Timed Property Specifications
Abstract Patterns for property specification enable non-experts to write formal specifications that can be used for automatic model checking. The existing patterns identified in [Dwyer, M.B., G.S. Avrunin and J.C. Corbett, Property specification...
2006 / Volker Gruhn, Ralf Laue -
Towards Algebraic High-Level Systems as Weak Adhesive HLR Categories
Abstract Adhesive high-level replacement (HLR) systems have been recently established as a suitable categorical framework for double pushout transformations based on weak adhesive HLR categories. Among different types of graphs and graph-like...
2008 / Ulrike Prange -
A new comprehensive framework for enterprise information security risk management
Abstract With the wide spread use of e-transactions in enterprises, information security risk management (ISRM) is becoming essential for establishing a safe environment for their activities. This paper is concerned with presenting a comprehensive...
2011 / Mohamed S. Saleh, Abdulkader Alfantookh