Filters








34,543 Hits in 2.4 sec

Truly concurrent constraint programming [chapter]

Vineet Gupta, Radha Jagadeesan, Vijay Saraswat
1996 Lecture Notes in Computer Science  
Concurrent Constraint Programming (CCP) is a powerful computation model for concurrency obtained by internalizing the notion of computation via deduction over (first-order) systems of partial information  ...  (constraints).  ...  Introduction Concurrent constraint programming [Sar93, SR90, SRP91] is a simple and powerful model of concurrent computation obtained by internalizing the notion of computation as deduction over (first-order  ... 
doi:10.1007/3-540-61604-7_65 fatcat:pmxdjkrgdrfnrgslsjl33c25s4

Truly concurrent constraint programming

V. Gupta, R. Jagadeesan, V.A. Saraswat
2002 Theoretical Computer Science  
We study "causality" relationships in Concurrent Constraint Programming: what is observed is not just the conjunction of constraints deposited in the store, but also the causal dependencies between these  ...  constraints.  ...  Introduction Concurrent constraint programming [20, 23, 24] is a simple and powerful model of concurrent computation obtained by internalizing the notion of computation as deduction over (ÿrst-order)  ... 
doi:10.1016/s0304-3975(00)00337-6 fatcat:3t6zrr2rezbcvmsw5vrlkle2im

The Language Model LMNtal [chapter]

Kazunori Ueda, Norio Kato
2003 Lecture Notes in Computer Science  
LMNtal is an outcome of the attempt to unify two extensions of concurrent logic programming, namely concurrent constraint programming and Constraint Handling Rules, where our focus has been multiset rewriting  ...  (rather than constraint handling).  ...  LMNtal is an outcome of the attempt to unify two extensions of concurrent logic programming, namely concurrent constraint programming and Constraint Handling Rules, where our focus has been multiset rewriting  ... 
doi:10.1007/978-3-540-24599-5_50 fatcat:k2n4rj3ckzboxpmh3aoi6hhdoq

Page 3183 of Mathematical Reviews Vol. , Issue 98E [page]

1998 Mathematical Reviews  
: a progress report (331-372); Vineet Gupta, Radha Jagadeesan and Vijay Saraswat, Truly concurrent constraint programming (373-388).  ...  ISBN 3-540-60983-0 {The 4th Workshop has been reviewed [MR 95c:68007]. } Contents: Martin Argenius and Andrei Voronkov, Semantics of constraint logic programs with bounded quantifiers (1-18); Mat- teo  ... 

Page 4770 of Mathematical Reviews Vol. , Issue 94h [page]

1994 Mathematical Reviews  
Starting out from Halpern and Moses’ interpretation of knowledge in the context of distributed systems, where they use the interleaving model, we extend this to a set- ting where also truly concurrent  ...  Summary: “We show how epistemic logic may be used to reason about concurrent programs.  ... 

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

2003 Mathematical Reviews  
Truly concurrent constraint programming. (English summary) Mathematical foundations of programming semantics (Boulder, CO, 1996). Theoret. Comput. Sci. 278 (2002), no. 1-2, 223-255.  ...  Summary: “We study ‘causality’ relationships in concurrent con- straint programming (cc): what is observed is not just the conjunc- tion of constraints deposited in the store, but also the causal de- pendencies  ... 

Automated Analysis of Concurrent and Real-Time Software [chapter]

George S. Avrunin, Jack C. Wileden
1991 The Kluwer International Series in Engineering and Computer Science  
This paper surveys the current status of our work on automated analysis of the logical and timing properties of concurrent software based on the constrained expression approach.  ...  It describes our analysis toolset, reports some extremely encouraging results of using the toolset to analyze logical properties of nontrivial concurrent systems, and discusses the modifications we have  ...  Ongoing research is directed toward applying our techniques to "truly concurrent" (i.e., multiprocessor) systems.  ... 
doi:10.1007/978-1-4615-4016-8_8 fatcat:2hi7o3mqrbfu3brl5azfd5syxe

Finding schedule-sensitive branches

Jeff Huang, Lawrence Rauchwerger
2015 Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2015  
This paper presents an automated, precise technique, TAME, for identifying schedule-sensitive branches (SSBs) in concurrent programs, i.e., branches whose decision may vary depending on the actual scheduling  ...  of concurrent threads.  ...  ., every identified SSB is truly schedule-sensitive.  ... 
doi:10.1145/2786805.2786840 dblp:conf/sigsoft/HuangR15 fatcat:sf7uz5jfnvfcrmo4rtyhny5vzq

Page 150 of Behavior Research Methods Vol. 12, Issue 2 [page]

1980 Behavior Research Methods  
. (3) Can programs that are not subtasks of a single main program ever execute concurrently?  ...  to program some experiments.  ... 

Actors as a special case of concurrent constraint (logic) programming

K. Kahn, Vijay A. Saraswat
1990 SIGPLAN notices  
Saraswat recently introduced the framework of concurrent constraint programming [14].  ...  This very impoverished concurrent constraint language is a syntactic subset of Janus, a concurrent constraint language which closely resembles concurrent logic programming languages such as Guarded Horn  ...  Car = Porsche. 2 Distributed and Concurrent Constraint Programming Concurrent constraint (cc) programming [14] is a synthesis and fundamental generalization of constraint logic programming (e.g.  ... 
doi:10.1145/97946.97955 fatcat:hykq574vhnacjjviqr73shgfue

Logic programming in the context of multiparadigm programming: the Oz experience [article]

Peter Van Roy, Per Brand, Denys Duchier, Seif Haridi, Martin Henz, Christian Schulte
2002 arXiv   pre-print
A multiparadigm language is designed to support different programming paradigms (logic, functional, constraint, object-oriented, sequential, concurrent, etc.) with equal ease.  ...  This model subsumes both concurrent logic programming (committed-choice-style) and search-based logic programming (Prolog-style).  ...  This research was partly financed by the Walloon Region of Belgium in the PIRATES project. fourth international conference on principles and practice of constraint programming (cp '98 Nadathur, Gopalan  ... 
arXiv:cs/0208029v1 fatcat:aef4drwtkfd4tcyknziqfegbja

The virtues of conflict

Ganesh Narayanaswamy, Saurabh Joshi, Daniel Kroening
2016 Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '16  
In this work, we propose a novel, conflict-aware, composable, truly concurrent semantics for programs written using C/C++ for modern weak memory architectures.  ...  These reorderings are often a source of subtle bugs in programs written for such architectures.  ...  We are now in a position to define our truly concurrent semantics for the shared memory program P : the system of the n-threaded program P is over-approximated by P ΓP = (E, Con, ) n−1 i=0 (Ei, Coni, i  ... 
doi:10.1145/2851141.2851165 dblp:conf/ppopp/Narayanaswamy0K16 fatcat:pwhqe42pv5hmhirh6psipqezty

Logic programming in the context of multiparadigm programming: the Oz experience

PETER VAN ROY, PER BRAND, DENYS DUCHIER, SEIF HARIDI, CHRISTIAN SCHULTE, MARTIN HENZ
2003 Theory and Practice of Logic Programming  
A multiparadigm language is designed to support different programming paradigms (logic, functional, constraint, object-oriented, sequential, concurrent, etc.) with equal ease.  ...  This model subsumes both concurrent logic programming (committed-choice-style) and search-based logic programming (Prolog-style).  ...  The statically-typed parts should be truly statically typed.  ... 
doi:10.1017/s1471068403001741 fatcat:opfvkb5i3vellfgk7s3mozjo7i

Author index volume 278 (2002)

2002 Theoretical Computer Science  
Saraswat, Truly concurrent constraint programming (1-2) 223-255 Hennessy, M., A fully abstract denotational semantics for the p-calculus (1-2) 53-89 Jagadeesan, R., see V.  ...  ., Fixpoint semantics for logic programming a survey (1-2) 25-51 Flagg, R.C. and P.  ... 
doi:10.1016/s0304-3975(02)00149-4 fatcat:aatd2uip3nfazmcqnx5bzq6obq

Model Checking in CLP [chapter]

Giorgio Delzanno, Andreas Podelski
1999 Lecture Notes in Computer Science  
Our contributions are: (1) a semantics-preserving translation of concurrent systems into CLP programs, (2) a method for verifying safety and liveness properties on the CLP programs produced by the translation  ...  We show that Constraint Logic Programming (CLP) can serve as a conceptual basis and as a practical implementation platform for the model checking of infinite-state systems.  ...  CLP program P S for the concurrent system S in Figure 1 .  ... 
doi:10.1007/3-540-49059-0_16 fatcat:bskn3ksmmfh5dilumog4qlecdy
« Previous Showing results 1 — 15 out of 34,543 results