Filters








181,327 Hits in 5.3 sec

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 use Concurrent Constraint Programming as a reference programming paradigm. The basic concepts and ideas can nevertheless be applied to any other paradigm.  ...  The main difference between our approach and the standard theory of abstract interpretation is the choice of linear space structures instead of order-theoretic ones as semantical (concrete and abstract  ...  In [16, 17] the authors develop a probabilistic version of concurrent constraint programming [35] called Probabilistic Concurrent Constraint Programming (PCCP).  ... 
doi:10.1145/351268.351284 dblp:conf/ppdp/PierroW00 fatcat:lzlm4l5qzjclvc5czqxw2bynca

Monadic concurrent linear logic programming

Pablo López, Frank Pfenning, Jeff Polakow, Kevin Watkins
2005 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '05  
LolliMon thereby cleanly integrates both concurrency and saturation with logic programming search.  ...  Lolli is a logic programming language based on the asynchronous propositions of intuitionistic linear logic. It uses a backward chaining, backtracking operational semantics.  ...  than concurrent programming.  ... 
doi:10.1145/1069774.1069778 dblp:conf/ppdp/LopezPPW05 fatcat:wsts6t7gwrgjhigxxnzake77um

Race directed scheduling of concurrent programs

Mahdi Eslamimehr, Jens Palsberg
2014 Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '14  
Detection of data races in Java programs remains a difficult problem. The best static techniques produce many false positives, and also the best dynamic techniques leave room for improvement.  ...  Our experiments on 23 Java programs found 72 real races that were missed by the best existing dynamic techniques.  ...  We thank Michael Bond who gave us access to Pacer, and Can Bekar, Tayfun Elmas, Cormac Flanagan, Steve Freund, and Serdar Tasiran who gave us access to Goldilocks.  ... 
doi:10.1145/2555243.2555263 dblp:conf/ppopp/EslamimehrP14 fatcat:7j4nl4hetvam3aqg6fa7lr6664

Mapping concurrent programs to VLIW processors

Hester Bakewell, Donna J. Quammen, Pearl Y. Wang
1991 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming - PPOPP '91  
In sample programs that were ex- amined, it was found that long procedure chains were infrequent and the scheme could be easily applied.  ...  The technique is not restricted to occam, but can be applied to any concurrent language where communications can be specified, and synchronization points can be statically determined, such  ... 
doi:10.1145/109625.109629 dblp:conf/ppopp/BakewellQW91 fatcat:nfzifuc73zaxvpjodppldpkrky

Efficient computation of program equivalence for confluent concurrent constraint programming

Luis F. Pino, Filippo Bonchi, Frank D. Valencia
2013 Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming - PPDP '13  
Concurrent Constraint Programming (ccp) is a well-established declarative framework from concurrency theory.  ...  Its foundations and principles e.g., semantics, proof systems, axiomatizations, have been thoroughly studied for over the last two decades.  ...  Concurrent constraint programming (ccp) [26] is a well-established formalism from concurrency theory that combines the traditional algebraic and operational view of process calculi with a declarative  ... 
doi:10.1145/2505879.2505902 dblp:conf/ppdp/PinoBV13 fatcat:b6nirdz4wfcx3d7znhmula42wq

Concurrent breakpoints

Chang-Seo Park, Koushik Sen
2012 Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming - PPoPP '12  
We have implemented concurrent breakpoints as a light-weight library for Java and C/C++ programs.  ...  Unfortunately, bugs in concurrent programs are notoriously difficult to reproduce because bugs due to concurrency happen under very specific thread schedules and the likelihood of taking such corner-case  ...  Acknowledgements Research supported by Microsoft (Award #024263) and Intel (Award #024894) funding and by matching funding by U.C.  ... 
doi:10.1145/2145816.2145880 dblp:conf/ppopp/ParkS12 fatcat:zyn5hekagjfihaq4jzqohauhzy

Non-concurrency analysis

Stephen P. Masticola, Barbara G. Ryder
1993 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming - PPOPP '93  
Parallel and concurrent programs are often explicitly divided into tasks by the programmer.  ...  We provide experiment al evidence that static non-concurrency analysis of Ada programs can be accomplished in a reasonable time, and is generally quite accurate.  ...  If m E CReach(n) and n @ CReach(m), then there is a control path from m to n, but not from n to m; thus, m c B4 (n).  ... 
doi:10.1145/155332.155346 dblp:conf/ppopp/MasticolaR93 fatcat:injytpoownbshf5snnsq6lkspe

Two examples of parallel programming without concurrency constructs (PP-CC)

Chen Ding
2011 Proceedings of the 16th ACM symposium on Principles and practice of parallel programming - PPoPP '11  
The first two mean lower performance, while the next two may mean better programmability and more parallelism, compared to programming not using hints. • No concurrency constructs.  ...  Therefore, concurrency constructs cannot be hints, and the options for synchronization are limited when using hints.  ... 
doi:10.1145/1941553.1941598 dblp:conf/ppopp/Ding11 fatcat:4l37ds5f6nexnc43gj6eiwpeay

Concurrent hash tables

Tobias Maier, Peter Sanders, Roman Dementiev
2016 Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '16  
Our starting point for better performing data structures is a fast and simple lock-free concurrent hash table based on linear probing that is limited to word-sized key-value types and does not support  ...  Concurrent hash tables are one of the most important concurrent data structures with numerous applications.  ...  This allows threads to share information in a flexible and efficient way. Therefore, concurrent hash tables are one of the most important concurrent data structures.  ... 
doi:10.1145/2851141.2851188 dblp:conf/ppopp/MaierSD16 fatcat:rdpp45usvzdcvaqxisiehcp3se

Optimistic concurrency with OPTIK

Rachid Guerraoui, Vasileios Trigonakis
2016 Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '16  
We introduce OPTIK, a new practical design pattern for designing and implementing fast and scalable concurrent data structures.  ...  We illustrate the power of our OPTIK pattern and its implementation by introducing four new algorithms and by optimizing four state-of-the-art algorithms for linked lists, skip lists, hash tables, and  ...  We also want to thank Tim Harris and the members of the Systems and Networking group at MSR Cambridge for their useful feedback during the early steps of OPTIK.  ... 
doi:10.1145/2851141.2851146 dblp:conf/ppopp/GuerraouiT16 fatcat:bdxf2f77hrhsriycuxe4h73fku

On the expressive power of temporal concurrent constraint programming languages

Mogens Nielsen, Catuscia Palamidessi, Frank D. Valencia
2002 Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '02  
The tcc paradigm is a formalism for timed concurrent constraint programming. Several tcc languages differing in their way of expressing infinite behavior have been proposed in the literature.  ...  recursive procedures with static scoping, and viceversa. (3) the languages from (1) are strictly more expressive than the languages from (2).  ...  Acknowledgments We thank Maurizio Gabbrielli and Vijay Saraswat for stimulating discussion on the topics of this paper.  ... 
doi:10.1145/571157.571173 dblp:conf/ppdp/NielsenPV02 fatcat:5iuqpwr4xncuzdoayfoqqf6gpm

A framework for abstract interpretation of timed concurrent constraint programs

Moreno Falaschi, Carlos Olarte, Catuscia Palamidessi
2009 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming - PPDP '09  
Timed Concurrent Constraint Programming (tcc) is a declarative model for concurrency offering a logic for specifying reactive systems, i.e. systems that continuously interact with the environment.  ...  Relying on this semantics, we formalize the first general framework for data flow analyses of tcc and utcc programs by abstract interpretation techniques.  ...  This work then provides the theoretical basis for building tools for the data-flow analyses of utcc and tcc programs whose verification and debugging are not trivial due to their concurrent nature and  ... 
doi:10.1145/1599410.1599436 dblp:conf/ppdp/FalaschiOP09 fatcat:ly5ofbkb3bb5dms3aedk4uhnra

A practical concurrent binary search tree

Nathan G. Bronson, Jared Casper, Hassan Chafi, Kunle Olukotun
2010 Proceedings of the 15th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '10  
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention.  ...  Experimental evidence shows that our algorithm outperforms a highly tuned concurrent skip list for many access patterns, with an average of 39% higher singlethreaded throughput and 32% higher multi-threaded  ...  Acknowledgments This work was supported by the Stanford Pervasive Parallelism Lab, by Dept. of the Army, AHPCRC W911NF-07-2-0027-1, and by the National Science Foundation under grant CNS-0720905.  ... 
doi:10.1145/1693453.1693488 dblp:conf/ppopp/BronsonCCO10 fatcat:zxfs4666bjeqbdcdmi2hlju3b4

Practical concurrent binary search trees via logical ordering

Dana Drachsler, Martin Vechev, Eran Yahav
2014 Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '14  
We implemented our concurrent BST algorithms and evaluated them against several state-of-the-art concurrent tree algorithms.  ...  Our experimental results show that our algorithms with lock-free contains and on-time deletion are practical and often comparable to the state-of-the-art. 7 3 9 1 7 3 9 1 T1 7 9 Key range: 2 · 10 6 Throughput  ...  Acknowledgements We would like to thank Guy Gueta, Faith Ellen, Tim Harris, and Adam Morrison for their insightful comments.  ... 
doi:10.1145/2555243.2555269 dblp:conf/ppopp/DrachslerVY14 fatcat:3etunsvxfzcfrps2ynrzruekaq

Semantics-preserving translations between linear concurrent constraint programming and constraint handling rules

Thierry Martinez
2010 Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming - PPDP '10  
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically.  ...  In conjunction with the equivalence between CHR and CSR with respect to original operational semantics, these results lead to semantics-preserving translations from full LCC to CHR and conversely.  ...  I would like to thank François Fages, Rémy Haemmerlé, Julien Martin and Sylvain Soliman for all the useful discussions and comments since the very beginning of this work.  ... 
doi:10.1145/1836089.1836097 dblp:conf/ppdp/Martinez10 fatcat:h5ypohsmibcu5a7xywlb3ucl4u
« Previous Showing results 1 — 15 out of 181,327 results