Filters








7,986 Hits in 3.3 sec

Automatic Synthesis of Deterministic Concurrency [chapter]

Veselin Raychev, Martin Vechev, Eran Yahav
2013 Lecture Notes in Computer Science  
In this paper, we present a framework for static synthesis of deterministic concurrency control: given a non-deterministic parallel program, our synthesis algorithm introduces synchronization that transforms  ...  Many parallel programs are meant to be deterministic: for the same input, the program must produce the same output, regardless of scheduling choices.  ...  In this paper we propose to automatically synthesize deterministic concurrency control: given a non-deterministic (potentially infinite-state) parallel program, our algorithm will statically introduce  ... 
doi:10.1007/978-3-642-38856-9_16 fatcat:mcemrz647bhtlofzdge66f7k34

Synthesis of Memory Fences via Refinement Propagation [chapter]

Yuri Meshman, Andrei Dan, Martin Vechev, Eran Yahav
2014 Lecture Notes in Computer Science  
We implemented our technique and successfully applied it to several challenging concurrent algorithms, including state of the art concurrent work-stealing queues.  ...  (ii) synthesis with refinement propagation: to synthesize fences for a program P , we combine abstraction refinements used for successful synthesis of programs coarser than P into a new candidate abstraction  ...  Our Approach In this work we propose a novel automatic framework for synthesis of memory fences that can handle infinite-state programs.  ... 
doi:10.1007/978-3-319-10936-7_15 fatcat:mu4y3whi2bbzhaltvsam7gthm4

Static analysis and automatic code synthesis of flexible FSM model

Dohyung Kim, Soonhoi Ha
2005 Proceedings of the 2005 conference on Asia South Pacific design automation - ASP-DAC '05  
To describe complex control modules, the following four features are requested for extended FSM models: concurrency, compositionality, static analyzability, and automatic code synthesis capability.  ...  Because of formality and the structured nature of fFSM model, we can apply a static analysis method to find ambiguous behavior and synthesize software/hardware automatically, which is the main focus of  ...  In particular, static analysis and automatic code synthesis techniques are our main focus.  ... 
doi:10.1145/1120725.1120795 dblp:conf/aspdac/KimH05 fatcat:gozs654vzvcotfqexxshqx7afq

Concurrency theory: timed automata, testing, program synthesis

Davide Sangiorgi
2011 Distributed computing  
The four papers presented cover three important topics within concurrency theory: timed automata, automated program synthesis, and testing. I briefly comment on the contributions below.  ...  Many verification theories, including model checking, are based on the theory of automata, in one of their various variants (deterministic, Meely machines, Buchi, pushdown, etc.).  ...  Program synthesis is methodology whose goal is the automatic construction of a program that satisfies a given specification.  ... 
doi:10.1007/s00446-011-0156-2 fatcat:r6z4smxgfrcwhm5yzoh7sdye7a

Automatic synthesis of specifications from the dynamic observation of reactive programs [chapter]

Bernard Boigelot, Patrice Godefroid
1997 Lecture Notes in Computer Science  
VeriSoft can automatically detect coordination problems between the concurrent processes of a system.  ...  VeriSoft [God97] is a tool for systematically exploring the state spaces of systems composed of several concurrent processes executing arbitrary C (or C-l-+) code.  ...  VeriSoft can automatically detect coordination problems between the concurrent processes of a system.  ... 
doi:10.1007/bfb0035397 fatcat:tbzpxceppbhhhgws7dawj7j5tm

Page 2926 of Mathematical Reviews Vol. , Issue 90E [page]

1990 Mathematical Reviews  
90e:68027 68 they are used primarily to provide an intermediate step in proving the correctness of concurrent systems: proving a weaker condition for weak concurrent systems allows the authors to infer  ...  Join dependencies and solutions of the problem of the synthesis of projections in relational databases. I. (Russian.  ... 

Page 710 of Mathematical Reviews Vol. , Issue 81B [page]

1981 Mathematical Reviews  
From the introduction: “This paper originates in a study of terminating determinate concurrent systems.  ...  (Riga) 12 (1978), no. 5, 11-17 (Russian); translated as Automat. Control Comput.  ... 

Combining Model Checking and Discrete-Event Supervisor Synthesis

Nicolas Chausse, Helen Xu, Juergen Dingel, Karen Rudie
2011 Electronic Communications of the EASST  
We present an approach to facilitate the design of provably correct concurrent systems by recasting recent work that uses discrete-event supervisor synthesis to automatically generate concurrency control  ...  This approach consists of the possibly repeated execution of three steps: manual preparation, automatic synthesis, and semi-automatic analysis.  ...  Consider, for instance, Discrete-Event Systems (DES) control theory, a branch of control theory which is concerned with the Supervisory Control Problem (SCP), i.e., the automatic synthesis of a supervisor  ... 
doi:10.14279/tuj.eceasst.46.686 dblp:journals/eceasst/ChausseXDR11 fatcat:c2jaqtyygzauhgs2rnfwxpzvzu

A LTL Fragment for GR(1)-Synthesis

Andreas Morgenstern, Klaus Schneider
2011 Electronic Proceedings in Theoretical Computer Science  
The idea of automatic synthesis of reactive programs starting from temporal logic (LTL) specifications is quite old, but was commonly thought to be infeasible due to the known double exponential complexity  ...  In this paper, we therefore present algorithms to automatically translate specifications of a remarkable large fragment of LTL to deterministic monitors having a GR(1) acceptance condition so that the  ...  In this paper, we show how to automatically obtain deterministic Büchi automata from a fragment of LTL using the well-known Breakpoint construction.  ... 
doi:10.4204/eptcs.50.3 fatcat:3rbl34fmgvbvrp5oy533p3rike

ChucK: A Strongly Timed Computer Music Language

Ge Wang, Perry R. Cook, Spencer Salazar
2015 Computer Music Journal  
It aims to be expressive and straightforward to read and write with respect to time and concurrency, and to provide a platform for precise audio synthesis and analysis and for rapid experimentation in  ...  flow of time in code and use the keyword now as a time-aware control construct, and gives programmers the ability to use the timing mechanism to realize sample-accurate concurrent programming.  ...  Acknowledgments A great number of people supported and contributed to the development, design, and evaluation of ChucK.  ... 
doi:10.1162/comj_a_00324 fatcat:whk57pjpbzaufbbb5dxn7bj33m

The ACTS software and its supervisory control framework

Marian V. Iordache, Panos J. Antsaklis
2012 2012 IEEE 51st IEEE Conference on Decision and Control (CDC)  
Starting with a specification describing the concurrency constraints, the software generates automatically the concurrency control code implementing the specification.  ...  Included are also results pertaining to limitations and future extensions of the supervisory control approach.  ...  CONCLUSION The development of concurrent programs can be simplified by generating automatically the concurrency control code.  ... 
doi:10.1109/cdc.2012.6426105 dblp:conf/cdc/IordacheA12 fatcat:mv6zmq4wvrb6zpzqx3ftj2hq7u

Line-up

Sebastian Burckhardt, Chris Dern, Madanlal Musuvathi, Roy Tan
2010 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation - PLDI '10  
The key insight of this paper is that if a component is intended to be deterministic, then it is possible to build an automatic linearizability checker by systematically enumerating the sequential behaviors  ...  We develop this insight into a tool called Line-Up, the first complete and automatic checker for deterministic linearizability.  ...  Our results show that automatic checking of deterministic linearizability with Line-Up provides an effective way of catching concurrency bugs without producing large numbers of false alarms.  ... 
doi:10.1145/1806596.1806634 dblp:conf/pldi/BurckhardtDMT10 fatcat:cjzsukuekng7lajsha7lg2cnaq

Ensuring deterministic concurrency through compilation

Nalini Vasudevan, Stephen A. Edwards
2010 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)  
Additionally, we discuss techniques to check for problems like deadlock that can result from the use of these deterministic constructs.  ...  In this paper, we discuss and propose additional tools that provide determinism guarantees-compilers that generate deterministic code, libraries that provide deterministic constructs, and analyzers that  ...  ACKNOWLEDGMENT We thank Julian Dolby, Baolin Shao, Satnam Singh, and Olivier Tardieu for contributing to sections of the work.  ... 
doi:10.1109/ipdpsw.2010.5470803 dblp:conf/ipps/VasudevanE10 fatcat:oqoyszx7ufe6biflo22byistbm

ChucK

Ge Wang, Perry Cook
2004 Proceedings of the 12th annual ACM international conference on Multimedia - MULTIMEDIA '04  
We show how these features enable precise, concurrent audio programming and provide a high degree of programmability in writing real-time audio and multimedia programs.  ...  In this paper, we describe ChucK -a programming language and programming model for writing precisely timed, concurrent audio synthesis and multimedia programs.  ...  But unlike threads, a shred is a deterministic shred of computation, synchronized by time. Each concurrent path of execution in Figure 4 can be realized by a shred.  ... 
doi:10.1145/1027527.1027716 dblp:conf/mm/WangC04 fatcat:hyrv6j2jxzfqritolodav7ygke

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.  ...  We conclude by presenting symbolic algorithms for the synthesis of winning strate- gies (‘controller synthesis’) for infinite-state games with arbitrary j-regular objectives, and prove termination over  ... 
« Previous Showing results 1 — 15 out of 7,986 results