Filters








366 Hits in 4.0 sec

A Hoare logic for dynamic networks of asynchronously communicating deterministic processes

F.S. de Boer
2002 Theoretical Computer Science  
This paper introduces a compositional Hoare logic for reasoning about the partial correctness and absence of deadlock of a certain class of programs.  ...  The Hoare logic formalizes reasoning about such dynamic networks on an abstraction level that is at least as high as that of the programming language.  ...  Acknowledgements I thank an anonymous referee for his or hers comments and for suggesting an alternative axiomatization of process creation which describes the newly created process as distinct from all  ... 
doi:10.1016/s0304-3975(00)00304-2 fatcat:4olt7jbgsrbrnguc7ifq4jocny

Page 2064 of Mathematical Reviews Vol. , Issue 2003C [page]

2003 Mathematical Reviews  
(NL-UTRE-C; Utrecht) A Hoare logic for dynamic networks of asynchronously communicating deterministic processes. (English summary) Concurrency theory (Nice, 1998). Theoret. Comput.  ...  This characterization generalizes the com- positional semantics of deterministic Kahn (data-flow) networks (where the number of processes and communication structure is fixed).”  ... 

A Compositional Model for Confluent Dynamic Data-Flow Networks [chapter]

Frank S. de Boer, Marcello M. Bonsangue
2000 Lecture Notes in Computer Science  
We introduce a state-based language for programming dynamically changing networks which consist of processes that communicate asynchronously.  ...  Our main result is a compositional characterization of this notion of observable for a confluent sub-language.  ...  MaC is an imperative programming language for describing the behavior of dynamic networks of asynchronously communicating processes.  ... 
doi:10.1007/3-540-44612-5_17 fatcat:zwhn5wqzm5bhxm6gw2fxiddvle

Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness

Nobuko Yoshida
2006 Electronical Notes in Theoretical Computer Science  
This paper sketches an idea on how to challenge the three security issues concentrating on code mobility, by the development of a general theory of types of the π-calculus and the higher-order π-calculus  ...  ; and how to apply it for designing secure concurrent and distributed programming languages.  ...  Recently from Hennessy-Milner Logic [16] of linearly typed processes [19] , we established Hoare Logic for imperative higher-order functions with general aliasing [28, 5, 31] , solving an open problem  ... 
doi:10.1016/j.entcs.2005.12.115 fatcat:nuyji5iylbgeli36wjrmm6g35a

SHIM: a deterministic model for heterogeneous embedded systems

S.A. Edwards, O. Tardieu
2006 IEEE Transactions on Very Large Scale Integration (vlsi) Systems  
Our SHIM (software/hardware integration medium) model, effectively Kahn networks with rendezvous communication, provides deterministic concurrency.  ...  By providing a powerful, deterministic formalism for expressing systems, designing systems and verifying their correctness will become easier.  ...  Like Hoare, we use a rendezvous model of communication in which two communicating processes can only advance when they synchronize, which has the advantage of simple semantics yet can easily model more  ... 
doi:10.1109/tvlsi.2006.878473 fatcat:ogrb3aauyvd6dgybwr4e7wqmce

Evolution in architectures and programming methodologies of coarse-grained reconfigurable computing

Zain-ul-Abdin, Bertil Svensson
2009 Microprocessors and microsystems  
In order to meet the increased computational demands of, e.g., multimedia applications, such as video processing in HDTV, and communication applications, such as baseband processing in telecommunication  ...  In this survey we explore the field of coarse-grained reconfigurable computing on the basis of the hardware aspects of granularity, reconfigurability, and interconnection networks, and discuss the effects  ...  Dan Hammerstrom) for their valuable feedback during the internal review of the paper.  ... 
doi:10.1016/j.micpro.2008.10.003 fatcat:k4c63f4k2zbc5a4mfr3vfwqkfe

Observable behavior of distributed systems: Component reasoning for concurrent objects

Crystal Chang Din, Johan Dovland, Einar Broch Johnsen, Olaf Owe
2012 The Journal of Logic and Algebraic Programming  
In this paper, a proof system for partial correctness reasoning is established based on communication histories and class invariants.  ...  The soundness and relative completeness of this proof system are shown using a transformational approach from a sequential language with a non-deterministic assignment operator.  ...  A Hoare Logic for concurrent processes (objects) is presented in [13] . The Hoare Logic is compositional, and soundness and relative completeness are proven.  ... 
doi:10.1016/j.jlap.2012.01.003 fatcat:wbgg34uasbag3gx4k527oagf4y

Verifying Service Continuity in a Dynamic Reconfiguration Procedure: Application to a Satellite System

L. Apvrille, P. de Saqui-Sannes, P. Sénac, C. Lohr
2004 Automated Software Engineering : An International Journal  
The paper demonstrates the benefits of using TURTLE to prove service continuity for dynamic reconfiguration of embedded software.  ...  The paper discusses the use of the TURTLE UML profile to model and verify service continuity during dynamic reconfiguration of embedded software, and space-based telecommunication software in particular  ...  Rose RT, TAU, ACCORD and TURTLE share in common the support of asynchronous communication.  ... 
doi:10.1023/b:ause.0000017742.47984.6c fatcat:csks3tv6ufbwflfgwfny3ixp7y

Tools for specifying real-time systems

Giacomo Bucci, Maurizio Campanai, Paolo Nesi
1995 Real-time systems  
The analysis is carried out in a comparative manner; a synthetic comparison is presented in the final discussion where the trend of teclmology improvement is also analyzed.  ...  In this paper, the evolution and the state of the art of tools for real-time software specification is reported, by analyzing their development over the last 20 years.  ...  In addition, they wish to thank also A. Corgiatini, R. Mattolini, O. Morales, M. Traversi, and E. Vicario, for their help.  ... 
doi:10.1007/bf01094341 fatcat:wmjlzjkegbb2bgi7twtlxffqnq

Model Testing Asynchronously Communicating Objects using Modulo AC Rewriting

Olaf Owe, Martin Steffen, Arild B. Torjusen
2010 Electronical Notes in Theoretical Computer Science  
Due to the asynchronous nature of communication, testing should be done up-to observational equivalence. This leads to a large increase in the reachable state space for the test cases.  ...  Testing and verification of asynchronously communicating objects in open environments are challenging due to non-determinism.  ...  Acknowledgement We thank Rudolf Schlatte for insight into application testing with Creol, and the anonymous referees for constructive criticism and hints to related work.  ... 
doi:10.1016/j.entcs.2010.12.015 fatcat:bcm7pid7wjclzkcuc4uwxpjmi4

Partial orders for parallel debugging

C. J. Fidge
1989 SIGPLAN notices  
To achieve this each process maintains a clock consisting of a vector of integers, one element for each process in the network.  ...  value of the logical clock vector.  ... 
doi:10.1145/69215.69233 fatcat:rwyxzftkhjfsdfaikai5prhaum

Partial orders for parallel debugging

C. J. Fidge
1988 Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging - PADD '88  
To achieve this each process maintains a clock consisting of a vector of integers, one element for each process in the network.  ...  value of the logical clock vector.  ... 
doi:10.1145/68210.69233 dblp:conf/pdd/Fidge88 fatcat:wbul7k7urbcrfkuynqnu25b7u4

Cumulative index volumes 1–100

1992 Theoretical Computer Science  
Francez, A weakest precondition semantics for communicating processes 29 (3 ) (1984)231-250 Emerson, E.A., Alternative semantics for temporal logics 26 (l-2) (1983) 121-130 Engeler, E., Generalized Galois  ...  Zuo, Lower bounds on communication overlap of networks (Note) 47 , J., A necessary condition for the rationality of the zeta function of a regular language (Note) 66 (3) (1989) 341-347 Honkala, J., On  ... 
doi:10.1016/0304-3975(92)90292-n fatcat:ekwes6owtrco3lkfkiqagnketq

Cspcons: A Communicating Sequential Prolog with Constraints [chapter]

Ioannis P. Vlahavas, Ilias Sakellariou, Ivan Futo, Zoltan Pasztor, Janos Szeredi
2002 Lecture Notes in Computer Science  
The language is an extended version of Csp-ii, a version of Prolog that supports, among other features, channel-based communicating processes and TCP/IP communication and is based on the CSP model introduced  ...  by Hoare.  ...  Currently Csp-ii supports an ASCII mediator for plain text communication and one for communication with a specific network management platform (HNMS).  ... 
doi:10.1007/3-540-46014-4_8 fatcat:mtheaaxa4jandfj3e6yll2fpga

Programming languages for distributed computing systems

Henri E. Bal, Jennifer G. Steiner, Andrew S. Tanenbaum
1989 ACM Computing Surveys  
When distributed systems first appeared, they were programmed in traditional sequential languages, usually with the addition of a few library procedures for sending and receiving messages.  ...  We begin by giving our view of what a distributed system is, illustrating with examples to avoid confusion on this important and controversial point.  ...  A NIL system consists of a network of dynamically created processes that communicate only by message passing over communication channels.  ... 
doi:10.1145/72551.72552 fatcat:y2afbdzlpbdgrhutfhgfuhfjmq
« Previous Showing results 1 — 15 out of 366 results