Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDREX Workshop 1992: Beekbergen, The Netherlands
- J. W. de Bakker, Willem P. de Roever, Grzegorz Rozenberg:
Sematics: Foundations and Applications, REX Workshop, Beekbergen, The Netherlands, June 1-4, 1992, Proceedings. Lecture Notes in Computer Science 666, Springer 1993, ISBN 3-540-56596-5 - Ralph-Johan Back, Joakim von Wright:
Predicate Transformers and Higher Order Logic. 1-20 - Éric Badouel, Philippe Darondeau:
Trace Nets. 21-50 - Rudolf Berghammer, Birgit Elbl, Ulf R. Schmerl:
Proving Total Correctness of Programs in Weak Second-Order Logic. 51-72 - Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi
, Jan J. M. M. Rutten:
On Blocks: Locality and Asynchronous Communication (Extended Abstract). 73-90 - Marcello M. Bonsangue, Joost N. Kok:
Semantics, Orderings and Recursion in the Weakest Precondition Calculus. 91-109 - Andrea Corradini, Andrea Asperti:
A Categorial Model for Logic Programs: Indexed Monoidal Categories. 110-137 - Pierpaolo Degano, Roberto Gorrieri, Giuseppe Rosolini:
A Categorial View of Process Refinement. 138-153 - Abbas Edalat, Michael B. Smyth:
Compact Metric Information Systems (Extended Abstract). 154-173 - Anton Eliëns, Erik P. de Vink:
Asynchronous Rendez-vous in Distributed Logic Programming. 174-203 - Maurizio Gabbrielli, Giorgio Levi, Maurizio Martelli:
New Semantic Tools for Logic Programming. 204-235 - Wim H. Hesselink, Ronald Reinds:
Temporal Preconditions of Recursive Procedures. 236-260 - Wiebe van der Hoek, M. van Hulst, John-Jules Ch. Meyer:
Towards an Epistemic Approach to Reasoning about Concurrent Programs. 261-287 - Eiichi Horita:
A Fully Abstract Model for a Nonuniform Concurrent Language with Parameterization and Locality. 288-317 - Ramarao Kanneganti, Robert Cartwright, Matthias Felleisen:
SPCF: Its Model, Calculus, and Computational Power (Preliminary Version). 318-347 - Marta Z. Kwiatkowska:
Infinite Behaviour and Fairness in Concurrent Constraint Programming. 348-383 - Michael W. Mislove, Frank J. Oles:
Full Abstraction and Unnested Recursion. 384-397 - Peter D. Mosses:
On the Action Semantics of Concurrent Programming Languages. 398-424 - Flemming Nielson, Hanne Riis Nielson:
Layered Predicates. 425-456 - Prakash Panangaden, Vijay A. Saraswat, Philip J. Scott, Robert A. G. Seely:
A Hyperdoctrinal View of Concurrent Constraint Programming. 457-476 - Jan J. M. M. Rutten, Daniele Turi:
On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders. 477-530 - Viggo Stoltenberg-Hansen, John V. Tucker:
Infinite Systems of Equations over Inverse Limits and Infinite Synchronous Concurrent Algorithms. 531-562 - Bent Thomsen, Lone Leth Thomsen, Alessandro Giacalone:
Some Issues in the Semantics of Facile Distributed Programming. 563-593 - Rob T. Udink, Joost N. Kok:
On the Relation Between Unity Properties and Sequences of States. 594-608 - Frits W. Vaandrager:
Expressive Results for Process Algebras. 609-638 - Sam Weber, Bard Bloom, Geoffrey Brown:
Compiling Joy Into Silicon: An Exercise in Applied Structural Operational Semantics. 639-659
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
