Filters








33,240 Hits in 4.8 sec

A linear-history semantics for languages for distributed programming

N. Francez, D. Lehmann, A. Pnueli
1984 Theoretical Computer Science  
A Lienotational semantics is given for a language for distributed programming based on ctilnmunication (CSP).  ...  For any well-formed program segment the semantics is a relation between attainable states and the communication sequences needed to attain these states.  ...  Lehmann, A. Pnueli We would like to thank Rachel Jacobi for critical reading of the manuscript and making constructive remarks.  ... 
doi:10.1016/0304-3975(84)90022-7 fatcat:ubsq326b4nbm7kd2h4tdpzk734

Page 3224 of Mathematical Reviews Vol. , Issue 86g [page]

1986 Mathematical Reviews  
(IL-HEBR); Pnueli, A. (IL-WEIZ) A linear-history semantics for languages for distributed programming. Theoret. Comput. Sci. 32 (1984), no. 1-2, 25-46.  ...  Author summary: “A denotational semantics is given for a language for distributed programming based on communication (CSP).  ... 

Foreword: programming language interference and dependence

DAVID CLARK, ROBERTO GIACOBAZZI, CHUNYAN MU
2011 Mathematical Structures in Computer Science  
The paper by Ana Almeida Matos and Jan Cederquist studies the information flows that occur in distributed programs in the presence of code mobility. This is a key problem in language-based security.  ...  in programming languages.  ... 
doi:10.1017/s0960129511000168 fatcat:5idllhv7vveqzej3p7qi7auf5i

Provenance Verification [chapter]

Rupak Majumdar, Roland Meyer, Zilong Wang
2013 Lecture Notes in Computer Science  
We give a unifying view of provenance tracking for distributed messagepassing programs.  ...  This semantics is relative to a domain of provenance annotations. Besides the regular word-languages mentioned above, we use the domains of provenance sets and regular tree-languages.  ...  Thus, our formalization gives a uniform static analysis algorithm for information flow issues in distributed message passing programs.  ... 
doi:10.1007/978-3-642-41036-9_3 fatcat:5qrlyikhizgsbmfjl6yehhc3oe

Models, Languages and Logics for Concurrent Distributed Systems: CEDISYS Workshop (Aarhus, 1991, May 21--24)

Uffe Engberg, Mogens Nielsen, Glynn Winskel
1992 DAIMI Report Series  
</p><p>This booklet contains the program of the workshop, short abstracts for the talks presented, and a list of participants.</p>  ...  <p>The EEC Esprit Basic Research Action No 3011, Models, Languages and Logics for Con current Distributed Systems, CEDISYS, held its second workshop at Aarhus University in May, l991, following the successful  ...  We introduce an observation algebra for CCS whose elements are labelled partial orderings of events called Spatial Histories. As a result we automatically obtain a truly concurrent semantics for CCS.  ... 
doi:10.7146/dpb.v21i392.6627 fatcat:z7kwdje4ebdkrmvhynaomrvqu4

Partial order and SOS semantics for linear constraint programs [chapter]

Eike Best, Frank S. de Boer, Catuscia Palamidessi
1997 Lecture Notes in Computer Science  
Using a partial order based history model, we de ne truly concurrent operational and partial order semantic models of lcp.  ...  The entailment relation of a linear constraint system, in terms of which linear constraint programs are de ned, is based on the main underlying idea of linear logic: hypotheses in a logical derivation  ...  The set of histories associated with a linear constraint program is de ned in SOS (structured operational semantics) style.  ... 
doi:10.1007/3-540-63383-9_85 fatcat:kxwcltjubzcwrprftuxxcikgou

Generative Modeling by PRISM [chapter]

Taisuke Sato
2009 Lecture Notes in Computer Science  
PRISM is a probabilistic extension of Prolog. It is a high level language for probabilistic modeling capable of learning statistical parameters from observed data.  ...  After reviewing it from various viewpoints, we examine some technical details related to logic programming, including semantics, search and program synthesis.  ...  We have only to write a program by a high level language and use it.  ... 
doi:10.1007/978-3-642-02846-5_4 fatcat:paisnhgsvfgq5ia4m7htnkhc3e

Author index volume 32 (1984)

1984 Theoretical Computer Science  
P;fT';\lmann, Linear indexed languages Francez, N., . rl Lehmann and A. Pnueli, A linear-history semantics for languages for distributed programming Hall, T.  ...  Costa, Distributive semantics for nondeterministic typed h-calculi Avenhaus, J. and K. Madlener, The Nielsen reduction and P-complete problems in free groups Avenhaus, J. and K.  ...  339-340 (3) 331-337 (1.2) 87-120 (I, 2) 185-199 0304-3';'75/84/$3.00 a 1984, Elst:vier Science Publishers B.V. (North-Holland)  ... 
doi:10.1016/0304-3975(84)90052-5 fatcat:g2qcqovkqjdxvddkl26beynyhi

Page 1844 of Mathematical Reviews Vol. , Issue 98C [page]

1998 Mathematical Reviews  
Then, for the NILRs and ILRs, the concept of query dependency graphs is introduced to partition the rules of a program into a set of CSLRs and the computation is elaborated so that the optimization for  ...  The first, the logic programming approach, attempts to provide declarative, model-theoretic semantics to programs. This paradigm is dominant in deductive databases.  ... 

Probabilistic NetKAT [chapter]

Nate Foster, Dexter Kozen, Konstantinos Mamouras, Mark Reitblatt, Alexandra Silva
2016 Lecture Notes in Computer Science  
This paper presents a new language for network programming based on a probabilistic semantics.  ...  This is a crucial point of our work: the language developed in this paper is based on NetKAT, which in turn is an extension of KAT, a well-established framework for program verification.  ...  The authors wish to thank the members of the Cornell PLDG and DIKU COPLAS group for insightful discussions and helpful comments.  ... 
doi:10.1007/978-3-662-49498-1_12 fatcat:sii3ahs6ivd53d7m4zwmoehm64

Concurrent Logic/Constraint Programming: The Next 10 Years [chapter]

Kazunori Ueda
1999 The Logic Programming Paradigm  
-cf. other formalisms of concurrency Conclusions (2) Conclusions (2) Constraint-based static systems can make CCP a simple, powerful, and safe language for -parallel computing, -distributed computing  ...  A good chance for us to demonstrate the power of simple and "usable" languages with an appropriate level of abstraction.  ... 
doi:10.1007/978-3-642-60085-2_3 fatcat:4kxepmkwenh7vnxfxnfycevgo4

A History of Probabilistic Inductive Logic Programming

Fabrizio Riguzzi, Elena Bellodi, Riccardo Zese
2014 Frontiers in Robotics and AI  
The field of Probabilistic Logic Programming (PLP) has seen significant advances in the last 20 years, with many proposals for languages that combine probability with logic programming.  ...  Since the start, the problem of learning probabilistic logic programs has been the focus of much attention. Learning these programs represents a whole subfield of Inductive Logic Programming (ILP).  ...  Under the distribution semantics, a probabilistic logic program defines a probability distribution over normal logic programs (termed worlds).  ... 
doi:10.3389/frobt.2014.00006 fatcat:tirvvcv76faq3a6v7a6cdrierq

Semantics of Probabilistic Programs: A Weak Limit Approach [chapter]

Alessandra Di Pierro, Herbert Wiklicky
2013 Lecture Notes in Computer Science  
For a simple probabilistic language we present a semantics based on linear operators on infinite dimensional Hilbert spaces.  ...  For probabilistic programs, it is typical to use Banach spaces and their norm topology to model the properties to be analysed (observables).  ...  Conclusions We have introduced a linear operator semantics (LOS) for probabilistic programs based on infinite-dimensional Hilbert space.  ... 
doi:10.1007/978-3-319-03542-0_18 fatcat:ilmh2ofnp5grzbuqfbxvthwhem

Page 3732 of Mathematical Reviews Vol. , Issue 81I [page]

1981 Mathematical Reviews  
Pnueli, A linear history semantics for distributed languages (extended abstract) (pp. 143-151); Harry B. Hunt, III and Daniel J.  ...  semantics (pp. 89-94); Preben Folkjar and Dines Bjorner, A for- mal model of a generalized CSP-like language (pp. 95-99); M.  ... 

Page 777 of Linguistics and Language Behavior Abstracts: LLBA Vol. 27, Issue 2 [page]

1993 Linguistics and Language Behavior Abstracts: LLBA  
(FRE) 1 An outline of the history of the MARIAMA project, a vertical applica- tion developed from the need to have programs that could analyze infor- mation about the linguistic history of a region.  ...  for a complete C with respect to the language.  ... 
« Previous Showing results 1 — 15 out of 33,240 results