Filters








44,764 Hits in 4.9 sec

Semantic analysis in a concurrent compiler

V. Seshadri, S. Weber, D. B. Wortman, C. P. Yu, I. Small
1988 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation - PLDI '88  
This paper is about the most difficult aspect of concurrent compilation: concurrent semantic analysis.  ...  The authors are currently engaged in a project to devise ways of structuring compilers so that they can take advantage of modem multiprocessor hardware.  ...  Introduction We begin by describing the structure of our concurrent compiler. Section 3 describes the compiler table management issues that arise during concurrent semantic analysis.  ... 
doi:10.1145/53990.54013 dblp:conf/pldi/SeshadriWJWYS88 fatcat:wnewkqzfhbgtbp7lpmljhrkcty

GOFFIN: Higher-order functions meet concurrent constraints

Manuel M.T. Chakravarty, Yike Guo, Martin Köhler, Hendrik C.R. Lock
1998 Science of Computer Programming  
We introduce a higher-order constraint-based language for structured and declarative parallel programming. The language, called GOFFIN. systematically integrates constraints and user-defined  ...  We thank Rita Loogen, Silvia Breitinger, and Martin Odersky for their comments and suggestions on GOFFIN. Last, but not least, we thank the anonymous referees for their helpful comments.  ...  Acknowledgements We are grateful to Martin Simons for his advice on the mathematics (any imperfections remaining are, of course, our fault) and his TRXnical help.  ... 
doi:10.1016/s0167-6423(97)00010-5 fatcat:joyr3nuwcfdwhax3xv6ccvcxki

Brief Announcement

Adones Rukundo, Aras Atalar, Philippas Tsigas
2018 Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18  
We briefly describe an efficient lock-free concurrent stack design with tunable and tenable relaxed semantics to allow for better performance.  ...  The design is tunable and allow for a continuous monotonic trade of weaker semantics for better throughput performance.  ...  To perform an operation, a thread searches for a sub-stack based on the Global. A thread selects a sub-stack, then, compares the sub-stack item-count with the Global.  ... 
doi:10.1145/3212734.3212794 fatcat:h6a7egngn5eyxccnvfap7vgvcy

Linear logic semantics for Concurrent Prolog [chapter]

Jiří Zlatuška
1994 Lecture Notes in Computer Science  
This paper develops a proof-theoretic semantics based on linear logic for Concurrent Prolog.  ...  Several fragments of linear logic are used in order to provide for a suitable translation of Concurrent Prolog clauses, with the committed-choice concurrency features captured by the properties of linear  ...  as primarily declarative languages based on logic, with the addition of certain control information supporting efficient proof search --this is the Uprogram=logic+control" of [8] .  ... 
doi:10.1007/3-540-58025-5_66 fatcat:fgrkokatfnduneiit5utujalia

Development and Application of Logical Actors Mathematical Apparatus for Logic Programming of Web Agents [chapter]

Alexei A. Morozov
2003 Lecture Notes in Computer Science  
This approach has good prospects, because the ideology and principles of logic programming are very convenient for searching, recognition, and analysis of unstructured, poorly structured, and hypertext  ...  Control strategies for executing logic programs (Internet agents) that are sound and (under some conditions) complete with respect to the modeltheoretic semantics of these agents.  ...  This approach has good prospects, because the ideology and principles of logic programming are very convenient for searching, recognition, and analysis of unstructured, poorly structured, and hypertext  ... 
doi:10.1007/978-3-540-24599-5_39 fatcat:iddvh4wt25cqdhmkueh6bcy5ey

Monotonically Relaxing Concurrent Data-Structure Semantics for Increasing Performance: An Efficient 2D Design Framework

Adones Rukundo, Aras Atalar, Philippas Tsigas, Michael Wagner
2019 International Symposium on Distributed Computing  
We present an efficient, lock-free, concurrent data structure design framework for out-of-order semantic relaxation.  ...  There has been a significant amount of work in the literature proposing semantic relaxation of concurrent data structures for improving scalability and performance.  ...  Thus, by relaxing the stack semantics, we allow for potentially more efficient stack designs with reduced synchronisation overhead, which is the motivation for concurrent data structure semantics relaxation  ... 
doi:10.4230/lipics.disc.2019.31 dblp:conf/wdag/RukundoAT19 fatcat:kpi5zmzvczcsbcsh5rwzkkqw2q

A Graph-Search Based Approach to BPEL4WS Test Generation

Yuan Yuan, Zhongjie Li, Wei Sun
2006 2006 International Conference on Software Engineering Advances (ICSEA'06)  
This paper proposes a graph-search based approach to BPEL test case generation, which effectively deals with BPEL concurrency semantics.  ...  Business Process Execution Language for Web Services (BPEL4WS) is a kind of concurrent programming languages with several special features that raise special challenges for verification and testing.  ...  ACKNOWLEDGMENT We thank for Bin Du for discussion and criticism on a earlier draft of this work. We also thank Jianjun Lu for implementation and verification of part system prototype.  ... 
doi:10.1109/icsea.2006.261270 dblp:conf/icsea/YuanLS06 fatcat:rgoexnrb6nekziqodtgk65osny

A Semantic Feature Model in Concurrent Engineering

Yong-Jin Liu, Kam-Lung Lai, Gang Dai, Matthew Ming-Fai Yuen
2010 IEEE Transactions on Automation Science and Engineering  
In this paper, we present a generic integration framework with a semantic feature model for knowledge representation and reasoning across domains in CE.  ...  Many research works have been proposed for efficiently modeling of different domains in CE.  ...  ACKNOWLEDGMENT The authors thank the associate editor and reviewers for their constructive comments that help improve this paper.  ... 
doi:10.1109/tase.2009.2039996 fatcat:tvmoazoztjdrrjjn4jf6x6xsxi

Path Feasibility Analysis of BPEL Processes under Dead Path Elimination Semantics

Hongda WANG, Jianchun XING, Juelong LI, Qiliang YANG, Xuewei ZHANG, Deshuai HAN, Kai LI
2016 IEICE transactions on information and systems  
Second, based on this abstraction, we symbolically encode every path of BPEL processes as some Satisfiability formulas.  ...  First, to tackle unique features mentioned above, we transform a BPEL process into an intermediary model -BPEL control flow graph, which is proposed to abstract the execution flow of BPEL processes.  ...  Acknowledgments The authors are very grateful to the anonymous reviewers for their insightful remarks and helpful comments on an earlier draft.  ... 
doi:10.1587/transinf.2015edp7121 fatcat:w7k2z64vljedbjl3rloqg6bbkm

Restricted Parallelism in Object-Oriented Lexical Parsing [article]

Peter Neuhaus, Udo Hahn, (Computational Linguistics Lab, Freiburg University, Germany)
1996 arXiv   pre-print
We present an approach to parallel natural language parsing which is based on a concurrent, object-oriented model of computation.  ...  A depth-first, yet incomplete parsing algorithm for a dependency grammar is specified and several restrictions on the degree of its parallelization are discussed.  ...  Given the complex control structure requirements of a realistic text understanding system (integrated, incremental, robust processing), we argued for a unifying approach in which declarative grammar constraints  ... 
arXiv:cmp-lg/9605027v1 fatcat:i75hsg27ijfhxbd2ze5rmz3xfa

Lightweight multigranularity locking for transaction management in XML database systems

Yonggoo Choi, Songchun Moon
2005 Journal of Systems and Software  
For the purpose of developing a concurrency control scheme without the phantom phenomenon, we propose a lightweight multigranularity locking (LWMGL) scheme that is a hybrid mechanism of Tree-based Locking  ...  Since these precise locks could considerably reduce the number of pseudo-conflicts that are regarded as unnecessary locks, they provide high concurrency compared with other concurrency control schemes.  ...  Concurrency control schemes using such a lock coupling can achieve high concurrency because unnecessary locks are released earlier.  ... 
doi:10.1016/j.jss.2004.12.002 fatcat:2qbtno2rkjaclhbrk6pfzhfvhy

A MDE-Based Approach to the Safety Verification of Extended SysML Activity Diagram

Chuanlin Huang, Zhiqiu Huang, Jun Hu, Zhipeng Wu, Siqi Wang
2015 Journal of Software  
structures mapping, which can complete the model transformation; third, input the CTL specification into model checker UPPAAL for the verification.  ...  The processes of the model transformation and formal verification are as follows: first, building the meta-models of SMAD and timed automata, which are based on MDE; second, achieving the semantic and  ...  Time structure consists of the time-base, multi-time base, time and structural relationship of time. The basic elements constituting the time structure is time-base, which is a set of ordered points.  ... 
doi:10.17706/jsw.10.1.56-70 fatcat:kniedgooifem5dr5wlvz2cbg2m

Transactional predication

Nathan G. Bronson, Jared Casper, Hassan Chafi, Kunle Olukotun
2010 Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '10  
The result approximates semantic conflict detection using the STM's structural conflict detection mechanism.  ...  Concurrent collection classes are widely used in multi-threaded programming, but they provide atomicity only for a fixed set of operations.  ...  Because semantically independent transactions may have structural conflicts, some other concurrency control mechanism must be used to protect accesses to the underlying data structure.  ... 
doi:10.1145/1835698.1835703 dblp:conf/podc/BronsonCCO10 fatcat:3xuzjr767ven5c4j6nbvzdonle

Multiversion concurrency control for the generalized search tree

Walter Binder, Adina Mosincat, Samuel Spycher, Ion Constantinescu, Boi Faltings
2009 Concurrency and Computation  
Although in these systems the indexed data are rarely updated and read access is highly concurrent, the existing concurrency control mechanisms for multidimensional index structures are based on locking  ...  In this article we present the Multiversion-GiST (MVGiST), a concurrent index structure based on MVCC and the GiST.  ...  [7] introduced a concurrency control technique for multidimensional index structures like the generalized search tree (GiST) [8] based on the link technique for B-trees (see Section 6.1); however,  ... 
doi:10.1002/cpe.1387 fatcat:vyqosebp5bherehnxsgidh4dya

Page 5005 of Mathematical Reviews Vol. , Issue 96h [page]

1996 Mathematical Reviews  
The theory forms a basis of P-algebra, a genéral semantic structure for concurrent processes.”  ...  The “truly concurrentsemantics of concurrency, based on Petri nets, presents many advantages in comparison with the “inter- leaving” semantics.  ... 
« Previous Showing results 1 — 15 out of 44,764 results