28,943 Hits in 5.4 sec

Page 2888 of Mathematical Reviews Vol. , Issue 2003d [page]

2003 Mathematical Reviews  
2003d:68164 total correctness semantics as abstract interpretations of the max- imal trace semantics.  ...  In this well-known framework the denota- tional semantics of concurrency is derived via power-domains from that of non-deterministic choice and interleaving to the effect that the denotational semantics  ... 

Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra [chapter]

Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Mogens Nielsen, Glynn Winskel
2008 Lecture Notes in Computer Science  
The project was initiated and effectively animated by Ugo Montanari, a passionate and long-time advocate of both these approaches to the semantics of concurrency.  ...  We recall some memories of the Esprit Basic Research Action CEDISYS, a small, well-focussed and fruitful project which brought together researchers at the meeting point of true concurrency and process  ...  Acknowledgements We would like to thank Luca Aceto, Rocco De Nicola and the anonymous reviewer for helpful comments.  ... 
doi:10.1007/978-3-540-68679-8_47 fatcat:4f2okdimfnfbfk2j6mdrq5lk3m

The origins of structural operational semantics

Gordon D Plotkin
2004 The Journal of Logic and Algebraic Programming  
semantics.  ...  Tetsuya Saito who, encouraged by Professor Tatsuya Hagino at Keio University, produced the original Latex version of the SOS notes in 1993; this was no mean task.  ...  The lesson I took from this was that abstract interpreting machines do not scale up well when used as a human-oriented method of specification for real languages (but see below for further comment).  ... 
doi:10.1016/j.jlap.2004.03.009 fatcat:vdx7e5gj5betpnxl7yxgd3zily

The origins of structural operational semantics

2004 The Journal of Logic and Algebraic Programming  
The lesson I took from this was that abstract interpreting machines do not scale up well when used as a human-oriented method of specification for real languages (but see below for further comment).  ...  The IBM Vienna school [42, 41] were interested in specifying real programming languages, and, in particular, worked on an abstract interpreting machine for PL/I using VDL, their Vienna Definition Language  ...  semantics.  ... 
doi:10.1016/s1567-8326(04)00026-8 fatcat:s5lg5fdb7nfobp4yl3iiecoz2a

On the Design Rationale of ACP Style Process Algebras

Jan A. Bergstra
2006 Electronical Notes in Theoretical Computer Science  
These connections and references are in fact easy to find for anyone who makes an attempt to do so.  ...  The design of ACP (1984) as an equational presentation of process algebras emerged from several sources and technically stands in the tradition of the algebraic specification of abstract data types as  ...  This projective limit construction provides the simplest semantic model for most of the ACP style process algebra specifications.  ... 
doi:10.1016/j.entcs.2005.12.105 fatcat:p7rkzof2wzfgnbom4l4eaooh7e

Mapping UML 2.0 Activities to Zero-Safe Nets

Sabine Boufenara, Faiza Belala, Kamel Barkaoui
2010 Journal of Software Engineering and Applications  
Therefore, zero-safe nets are adopted in this work as semantic framework for UML 2.0 activity diagrams.  ...  Unfortunately, their place/transition operational semantics is unable to capture and preserve semantics of the newly defined high-level activities constructs such as Interruptible Activity Region.  ...  Many attempts are currently led to give UML 2.0 ADs an operational semantics via some well known formal models such as high-level Petri nets [4] , Abstract State Machine [5] and so on, for eventual  ... 
doi:10.4236/jsea.2010.35048 fatcat:z6jgz64kc5hkvgdo4zsdltpqbu

Implementation of TTCN Operational Semantics in Estelle [chapter]

Luoming Hou, Jean-Philippe Favreau, Debra Tang
1995 Protocol Test Systems  
(MOT) for communication protocols.  ...  With an upgraded version of the Tree and Tabular Combined Notation (TTCN) that encompasses concurrency, it is now possible to foresee a new generation of Abstract Test Suites (ATSs) and Means Of Testing  ...  TECHNICAL APPROACH Rather than to develop a specific test engine for a specific ATS and for a specific protocol, the goal is to develop a generic test engine for any test suite described in IS TTCN (including  ... 
doi:10.1007/978-0-387-34883-4_21 fatcat:tvkruuu6mzhyzei2japqmg526m

Concurrent constraint programming

Alessandra Di Pierro, Herbert Wiklicky
2000 Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '00  
We present a method for approximating the semantics of probabilistic programs to the purpose of constructing semantics-based analyses of such programs.  ...  The method resembles the one based on Galois connection as developed in the Cousot framework for abstract interpretation.  ...  Completeness means for an abstract interpretation that in the above relations for correctness the equality holds, so that the abstraction results in no loss of information.  ... 
doi:10.1145/351268.351284 dblp:conf/ppdp/PierroW00 fatcat:lzlm4l5qzjclvc5czqxw2bynca

The failure of failures in a paradigm for asynchronous communication [chapter]

F. S. Boer, J. N. Kok, C. Palamidessi, J. J. M. M. Rutten
1991 Lecture Notes in Computer Science  
We study some cases, for which we give a fully abstract semantics.  ...  In particular, we show that our model is more abstract than the standard failure set semantics (that is known to be fully abstract for the classical synchronous paradigms).  ...  We thank the members of the Amsterdam Concurrency Group, including Jaco de Bakker, Franck van Breughel, Arie de Bruin, Peter Knijnenburg, Erik de Vink and Jeroen Warmerdarn for helpful comments and stimulating  ... 
doi:10.1007/3-540-54430-5_84 fatcat:clsjuzby4nbonar65cm3nnaqi4

Towards a formally based component description language [chapter]

J. Cramer, W. Fey, M. Goedicke, M. Große-Rhode
1991 Lecture Notes in Computer Science  
The H-language was developed primarily for the specification of distributed modular systems, where the notions of data abstraction and concurrency play an equally important role.  ...  After describing the underlying concepts and the syntax of the R-language we outline an attempt to define its formal semantics by means of algebraic module specifications.  ...  Each of them gets their algebraic semantic via a module specification constructed by "flattening" the structure. 1.  ... 
doi:10.1007/3540539816_76 fatcat:iyjb6lxwwjdwzbnuu32tjiatyu

An Overview of FORCES: An INRIA Project on Declarative Formalisms for Emergent Systems [chapter]

Jesús Aranda, Gerard Assayag, Carlos Olarte, Jorge A. Pérez, Camilo Rueda, Mauricio Toro, Frank D. Valencia
2009 Lecture Notes in Computer Science  
The FORCES project aims at providing robust and declarative formalisms for analyzing systems in the emerging areas of Security Protocols, Biological Systems and Multimedia Semantic Interaction.  ...  Finally, we expect to develop static and abstract interpretation techniques to extract representative information from system specifications.  ...  This calculus has constructs for modeling strong preemption and for defining delays within the same time unit. The operational semantics of rtcc supports resources, limited time and true concurrency.  ... 
doi:10.1007/978-3-642-02846-5_44 fatcat:p5icbugmf5cilciphhqle7rhci

Prototyping Framework for SDL with Evolving Semantics [chapter]

Peter Csurgay
1999 IFIP Advances in Information and Communication Technology  
The framework includes automatic parser generation and abstract grammar definition from Z.l 00-style EBNF descriptions, and an easily extensible object-oriented formal definition of the semantic interpretation  ...  This paper introduces a prototyping framework that supports traditional and new tool functions for specifications in SDL with evolving semantics, thus eases the evolution process as well.  ...  Thanks to Professor Finn Arve Aagesen for commenting the paper and for the supervision throughout the years at the Department of Telematics, Norwegian University of Science and Technology. 7.  ... 
doi:10.1007/978-0-387-35578-8_5 fatcat:3x6yhbbqifhmdhwlh64jbltney

Semantic Properties for Lightweight Specification in Knowledgeable Development Environments [article]

Joseph R. Kiniry
2002 arXiv   pre-print
Semantic properties are domain-specific specification constructs used to augment an existing language with richer semantics.  ...  The refinement relationships between these specification levels, as well as between a semantic property's use and its realization in program code via tools, is specified with a new formal method for reuse  ...  Basic examples of such properties are require and ensure tags for preconditions and postconditions, modifies tags for side-effect semantics, and the concurrency and generate tags for concurrency semantics  ... 
arXiv:cs/0204035v1 fatcat:n66yvvxy7rca3hhex4dp4dgpqu

PhD Abstracts

2019 Journal of functional programming  
As a service to the community, twice per year the Journal of Functional Programming publishes the abstracts from PhD dissertations completed during the previous year.  ...  Haskell programs using a typeclass abstraction of concurrency, which we give a formal semantics.  ...  operational semantic specifications written in CBS (the meta-language developed by the PLanCompS project), an interpreter for an intermediate meta-language (IML) based on MRBS, and a translation from  ... 
doi:10.1017/s0956796819000078 fatcat:nqlt4e66r5ea5ibvngbewqpvs4

Concurrency for Graph Grammars in a Petri net shell

P Baldan
2004 Electronical Notes in Theoretical Computer Science  
Inspired by this correspondence we develop truly concurrent semantics for dpo graph grammars based on (deterministic) processes and on a Winskel's style unfolding construction, and we show that the two  ...  Graph grammars are a powerful model of concurrent and distributed systems which can be seen as a proper extension of Petri nets.  ...  The truly concurrent semantics for graph grammars (and generalized nets) is intended to represent the basis for defining more abstract observational semantics to be used for the analysis and verification  ... 
doi:10.1016/s1571-0661(04)00192-6 fatcat:wrvdeitwenf43ltcatn5oqkp2q
« Previous Showing results 1 — 15 out of 28,943 results