Filters








26,663 Hits in 5.2 sec

Imperative Program Synthesis from Answer Set Programs

Sarat Chandra Varanasi
2019 Electronic Proceedings in Theoretical Computer Science  
Our research concerns generating imperative programs from Answer Set Programming Specifications. ASP is highly declarative and is ideal for writing specifications.  ...  We are currently working on synthesizing imperative programs from ASP programs by turning the negation into useful computations.  ...  This is to be contrasted with traditional ASP solvers which ground the entire program and solve answer sets using some form of SAT-solving [4] .  ... 
doi:10.4204/eptcs.306.55 fatcat:ptveajo7xngn5przh7bbltfxzu

Sketching concurrent data structures

Armando Solar-Lezama, Christopher Grant Jones, Rastislav Bodik
2008 SIGPLAN notices  
We have used the PSKETCH system to implement several classes of concurrent data structures, including lock-free queues and concurrent sets with fine-grained locking.  ...  We describe PSKETCH, a program synthesizer that helps programmers implement concurrent data structures.  ...  supported in part by the National Science Foundation with grants CCF-0085949, CNS-0326577, and CNS-0524815, a generous gift from IBM Corporation, an IBM Fellowship, and the University of California MICRO program  ... 
doi:10.1145/1379022.1375599 fatcat:x5s6klcsgrfhrpvt5idyibqfea

Sketching concurrent data structures

Armando Solar-Lezama, Christopher Grant Jones, Rastislav Bodik
2008 Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation - PLDI '08  
We have used the PSKETCH system to implement several classes of concurrent data structures, including lock-free queues and concurrent sets with fine-grained locking.  ...  We describe PSKETCH, a program synthesizer that helps programmers implement concurrent data structures.  ...  supported in part by the National Science Foundation with grants CCF-0085949, CNS-0326577, and CNS-0524815, a generous gift from IBM Corporation, an IBM Fellowship, and the University of California MICRO program  ... 
doi:10.1145/1375581.1375599 dblp:conf/pldi/Solar-LezamaJB08 fatcat:a2gezeanvvdbreirt3uljr3pdu

Synthesizing fine-grained synchronization protocols for implicit monitors

Kostas Ferles, Benjamin Sepanski, Rahul Krishnan, James Bornholt, Işil Dillig
2022 Proceedings of the ACM on Programming Languages (PACMPL)  
A monitor is a widely-used concurrent programming abstraction that encapsulates all shared state between threads.  ...  Implicit monitors are much easier to program but typically not as efficient.  ...  Concurrency verification. Cortado reasons about concurrent program executions by building on work in concurrent program analysis and verification.  ... 
doi:10.1145/3527311 fatcat:wzgvu4rfkrb6lgtz24ku73dska

Synthesis of biological models from mutation experiments

Ali Sinan Koksal, Yewen Pu, Saurabh Srivastava, Rastislav Bodik, Jasmin Fisher, Nir Piterman
2013 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '13  
We describe how this language design and embedding allows us to build an efficient synthesizer.  ...  In contrast, a "regular" concurrent program is correct if it picks any outcome allowed by the non-deterministic specification.  ...  That work showed how to extend the CEGIS algorithm [29] from the sequential setting into the semantics of concurrent programs.  ... 
doi:10.1145/2429069.2429125 dblp:conf/popl/KoksalPSBFP13 fatcat:3yfcdl4ienagrgtq4af6ukewlm

Synthesis of biological models from mutation experiments

Ali Sinan Koksal, Yewen Pu, Saurabh Srivastava, Rastislav Bodik, Jasmin Fisher, Nir Piterman
2013 SIGPLAN notices  
We describe how this language design and embedding allows us to build an efficient synthesizer.  ...  In contrast, a "regular" concurrent program is correct if it picks any outcome allowed by the non-deterministic specification.  ...  That work showed how to extend the CEGIS algorithm [29] from the sequential setting into the semantics of concurrent programs.  ... 
doi:10.1145/2480359.2429125 fatcat:o6etcwokabgzlg2bpeqggqlecy

Can We Monitor All Multithreaded Programs? [chapter]

Antoine El-Hokayem, Yliès Falcone
2018 Lecture Notes in Computer Science  
Parallel programs generally introduce an added level of complexity on the program execution due to concurrency. A concurrent execution of a parallel program is best represented as a partial order.  ...  in which it is sound to use the existing tools and approaches.  ...  Two correct executions have the following orders: 1 Before runtime, RV is applied to a program with a concurrent execution (dashed): a monitor M ϕ is synthesized from a property ϕ, and the program is  ... 
doi:10.1007/978-3-030-03769-7_6 fatcat:fetmoxrijjdnpbq67zmsk7hcua

BPELDebugger: An effective BPEL-specific fault localization framework

Chang-ai Sun, Yi Meng Zhai, Yan Shang, Zhenyu Zhang
2013 Information and Software Technology  
Our framework formulates the BPEL fault localization problem using the popular fault localization problem settings, and synthesizes BPEL-specific fault localization techniques by reuse of existing fault  ...  We use two realistic BPEL programs and three existing fault localization formulas to evaluate the feasibility and effectiveness of the proposed fault localization framework and guidelines.  ...  Acknowledgments Authors thank Tieheng Xue and Ke Wang for their implementations of BPEL programs which are used for the empirical study.  ... 
doi:10.1016/j.infsof.2013.07.009 fatcat:knoji4rz5rhvfjcdciya56vr74

Quantitative Synthesis for Concurrent Programs [chapter]

Pavol Černý, Krishnendu Chatterjee, Thomas A. Henzinger, Arjun Radhakrishna, Rohit Singh
2011 Lecture Notes in Computer Science  
We have implemented a prototype tool and used it to synthesize finite-state concurrent programs that exhibit different programming patterns, for several performance models representing different architectures  ...  While we show, using gametheoretic methods, that the synthesis problem is Nexp-complete, we present an algorithmic method and an implementation that works efficiently for concurrent programs and performance  ...  There are several other future research directions: one is to consider the synthesis of programs that access concurrent data structures; another is to create benchmarks from which performance automata  ... 
doi:10.1007/978-3-642-22110-1_20 fatcat:aquipr45obdtlo5e267jyfjove

Synthesizing memory models from framework sketches and Litmus tests

James Bornholt, Emina Torlak
2017 Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2017  
Yet architectures usually define their memory models with prose and litmus tests-small concurrent programs that demonstrate allowed and forbidden outcomes.  ...  We also used MemSynth to reproduce, debug, and automatically repair a paper on comparing memory models in just two days.  ...  A symbolic litmus test thus defines a set of concurrent programs rather than only one such program.  ... 
doi:10.1145/3062341.3062353 dblp:conf/pldi/BornholtT17 fatcat:lez4mnybdjdhbgfgf3iydij3we

Synthesis from Temporal Specifications Using Preferred Answer Set Programming [chapter]

Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
2005 Lecture Notes in Computer Science  
Furthermore, we demonstrate how preferred ASP, where rules are ordered according to preference for satisfaction, can be used for synthesizing synchronization skeletons of processes in a concurrent program  ...  We use extended answer set programming (ASP), a logic programming paradigm which allows for the defeat of conflicting rules, to check satisfiability of computation tree logic (CTL) temporal formulas via  ...  Preferred Answer Set Programming We introduce the extended answer set semantics as in [24] .  ... 
doi:10.1007/11560586_23 fatcat:z3vi5amfibdsfbjrkpnmtshdtq

Synthesizing memory models from framework sketches and Litmus tests

James Bornholt, Emina Torlak
2017 SIGPLAN notices  
Yet architectures usually define their memory models with prose and litmus tests-small concurrent programs that demonstrate allowed and forbidden outcomes.  ...  We also used MemSynth to reproduce, debug, and automatically repair a paper on comparing memory models in just two days.  ...  A symbolic litmus test thus defines a set of concurrent programs rather than only one such program.  ... 
doi:10.1145/3140587.3062353 fatcat:bcbdqnjnpjcqpeq4drclsrndcy

Quantitative Synthesis for Concurrent Programs [article]

Pavol Cerny and Krishnendu Chatterjee and Thomas Henzinger and Arjun Radhakrishna and Rohit Singh
2011 arXiv   pre-print
We have implemented a prototype tool and used it to synthesize finite-state concurrent programs that exhibit different programming patterns, for several performance models representing different architectures  ...  While we show, using game-theoretic methods, that the synthesis problem is NEXP-complete, we present an algorithmic method and an implementation that works efficiently for concurrent programs and performance  ...  A partial program is a finite-state concurrent program that includes nondeterministic choices which the synthesizer has to resolve.  ... 
arXiv:1104.4306v1 fatcat:3luehqshabaapckvtqbccyakwi

Production-guided concurrency debugging

Nuno Machado, Brandon Lucia, Luís Rodrigues
2016 Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '16  
By leveraging this information from production runs, Cortex synthesizes executions to guide the search for failing schedules.  ...  Cortex preemptively exposes failing executions by perturbing the order of events and controlflow behavior in non-failing schedules from production runs of a program.  ...  Testing for concurrency bugs. Systematic concurrency testing (SCT) is one approach to testing multithreaded programs.  ... 
doi:10.1145/2851141.2851149 dblp:conf/ppopp/MachadoLR16 fatcat:2ko5kv2jcvcaxkmxbf4dlar2lq

Generating Concurrent Programs From Sequential Data Structure Knowledge [article]

Sarat Chandra Varanasi, Neeraj Mittal, Gopal Gupta
2020 arXiv   pre-print
Knowledge in our case is expressed using Answer Set Programming (ASP), and we employ deduction, induction and abduction---just as humans do---in the reasoning involved.  ...  To the best of our knowledge, our work is the first one to use commonsense reasoning to automatically transform sequential programs into concurrent code.  ...  The set of satisfiable literals of an answer set program are termed as its answer sets (stable models).  ... 
arXiv:2011.04045v1 fatcat:iqbfi7flbzecrhamh77guolhne
« Previous Showing results 1 — 15 out of 26,663 results