Filters








25,578 Hits in 7.2 sec

Simulating Concurrent Behaviors with Worst-Case Cost Bounds [chapter]

Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa, Einar Broch Johnsen, Rudolf Schlatte, S. Lizeth Tapia Tarifa
2011 Lecture Notes in Computer Science  
To analyze model behavior a formal methodology is proposed to assess resource consumption, which balances the scalability of the method and the reliability of the obtained results.  ...  The approach applies to a general notion of resource, including traditional cost measures (e.g., time, memory) as well as concurrency-related measures (e.g., requests to a server, spawned tasks).  ...  the behavior of concurrent systems.  ... 
doi:10.1007/978-3-642-21437-0_27 fatcat:uz7f4ebyyzctjojpgit3gswzoa

Observable behavior of distributed systems: Component reasoning for concurrent objects

Crystal Chang Din, Johan Dovland, Einar Broch Johnsen, Olaf Owe
2012 The Journal of Logic and Algebraic Programming  
Distributed and concurrent object-oriented systems are difficult to analyze due to the complexity of their concurrency, communication, and synchronization mechanisms.  ...  Compared to related work, this allows the formulation of a much simpler Hoare-style proof system and reduces reasoning complexity by significantly simplifying formulas in terms of the number of needed  ...  Acknowledgements The authors gratefully acknowledge valuable comments from the anonymous reviewers. Their criticism has improved the paper.  ... 
doi:10.1016/j.jlap.2012.01.003 fatcat:wbgg34uasbag3gx4k527oagf4y

An Asynchronous Communication Model for Distributed Concurrent Objects

Einar Broch Johnsen, Olaf Owe
2006 Journal of Software and Systems Modeling  
Furthermore, it is difficult to combine active and passive behavior in concurrent objects.  ...  The concepts are integrated in a small object-oriented language with an operational semantics defined in rewriting logic, and illustrated by an example of a peer-to-peer network.  ...  Unrestricted use of the dynamic class construct implies that objects of class C may violate behavior specified earlier, and constraints on objects of class C must be reproved or weakened.  ... 
doi:10.1007/s10270-006-0011-2 fatcat:4fhqwxz3dfgsxh2gqgq4to62ma

Feral Concurrency Control

Peter Bailis, Alan Fekete, Michael J. Franklin, Ali Ghodsi, Joseph M. Hellerstein, Ion Stoica
2015 Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data - SIGMOD '15  
The rise of data-intensive "Web 2.0" Internet services has led to a range of popular new programming frameworks that collectively embody the latest incarnation of the vision of Object-Relational Mapping  ...  We evaluate which of these feral invariants actually ensure integrity (by usage, up to 86.9%) and which-due to concurrency errors and lack of database support-may lead to data corruption (the remainder  ...  The authors would like to thank Peter Alvaro, Michael R. Bernstein, Colin Jones, Xavier Shay, and the SIGMOD reviewers for their insightful commentary and feedback on this  ... 
doi:10.1145/2723372.2737784 dblp:conf/sigmod/BailisFFGHS15 fatcat:ivgtcqcqpjgn5mak3cf44fm254

Debugging concurrent programs

Charles E. McDowell, David P. Helmbold
1989 ACM Computing Surveys  
The probe effect refers to the fact that any attempt to observe the behavior of a distributed system may change the behavior of that system.  ...  Even when the behavior can be observed, in many systems the lack of a synchronized global clock makes the results of the observation difficult to interpret.  ...  ACKNOWLEDGMENTS We would like to thank Anil Sahai who contributed to an early version of this survey. We would also like to thank the referees for their comments.  ... 
doi:10.1145/76894.76897 fatcat:67jxy3s6h5hk7bsoz2anxocqim

Concurrency, Time, and Constraints [chapter]

Frank D. Valencia
2003 Lecture Notes in Computer Science  
This allows the model to benefit from two well-established theories used in the study of concurrency.  ...  Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in a shared medium.  ...  I am specially grateful to the people with whom I have worked on temporal ccp with great pleasure: Mogens Nielsen, Catuscia Palamidesi, and Camilo Rueda.  ... 
doi:10.1007/978-3-540-24599-5_6 fatcat:7dsa7bnhmjh3dnsdphv6dj5f64

Axioms for concurrent objects

M. P. Herlihy, J. M. Wing
1987 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87  
We propose an approach to specifying and verifying concurrent objects based on a novel correctness condition, which we call linearizability.  ...  Specification and verification techniques for abstract data types that have been successful for sequential programs can be extended in a natural way to provide the same benefits for concurrent programs  ...  Acknowledgments The authors thank David Detlefs, Jim Horning, Leslie Lamport, Larry Rudolph, and William Weihl for lively verbal and electronic discussions about our notions of linearizability and correctness  ... 
doi:10.1145/41625.41627 dblp:conf/popl/HerlihyW87 fatcat:qvnvj5mcyjgvng2fsp3hab7lie

A Concurrent Perspective on Smart Contracts [article]

Ilya Sergey, Aquinas Hobor
2017 arXiv   pre-print
In this paper, we explore remarkable similarities between multi-transactional behaviors of smart contracts in cryptocurrencies such as Ethereum and classical problems of shared-memory concurrency.  ...  We examine two real-world examples from the Ethereum blockchain and analyzing how they are vulnerable to bugs that are closely reminiscent to those that often occur in traditional concurrent programs.  ...  -Linearizability [21] (aka atomicity) is a standard notion of correctness for specifying high-level behavior of lock-free concurrent objects.  ... 
arXiv:1702.05511v1 fatcat:75tic2ctirdffno2trwqecyqf4

A Concurrent Perspective on Smart Contracts [chapter]

Ilya Sergey, Aquinas Hobor
2017 Lecture Notes in Computer Science  
In this paper, we explore remarkable similarities between multi-transactional behaviors of smart contracts in cryptocurrencies such as Ethereum and classical problems of shared-memory concurrency.  ...  We examine two real-world examples from the Ethereum blockchain and analyzing how they are vulnerable to bugs that are closely reminiscent to those that often occur in traditional concurrent programs.  ...  -Linearizability [21] (aka atomicity) is a standard notion of correctness for specifying high-level behavior of lock-free concurrent objects.  ... 
doi:10.1007/978-3-319-70278-0_30 fatcat:sna3auwrr5fybclluyzvucwlum

Linearizability: a correctness condition for concurrent objects

Maurice P. Herlihy, Jeannette M. Wing
1990 ACM Transactions on Programming Languages and Systems  
It permits a high degree of concurrency, yet it permits programmers to specify and reason about concurrent objects using known techniques from the sequential domain.  ...  A concurrent object is a data object shared by concurrent processes. Linearizability is a correctness condition for concurrent objects that exploits the semantics of abstract data types.  ...  Finally, we would like to thank Jim Gray and the anonymous referees for their comments and suggestions.  ... 
doi:10.1145/78969.78972 fatcat:nrwykdb3pjcmnf5ye6llcvsvaq

A simple approach to specifying concurrent systems

Leslie Lamport
1989 Communications of the ACM  
Acknowledgments I wish to thank Amir Pnueli for teaching me what existential quantification over state functions means, Jim Horning and John Guttag for numerous helpful discussions, and the following for  ...  their comments on earlier versions of this paper: Jim Gray, Brent Hailpern, Luigi Logrippo, Jay Misra, Susan Owicki, Willem-Paul de Roever, Fred Schneider, Fritz Vogt, Jeanette Wing, and Pamela Zave.  ...  Concurrency The transition axiom method is supposed to specify concurrent systems, yet the system's behavior is described as a sequence of actions. Where's the concurrency?  ... 
doi:10.1145/63238.63240 fatcat:fjbmoosgefhejnfe3jhjpm7fya

Scalable concurrent computing

Nalini Venkatasubramanian, Shakuntala Miriyala, Gul Agha
1992 Sadhana (Bangalore)  
Concurrent computer architectures In the von Neumann model, the hardware consists of a processor, a memory module (also called storage) and a link to communicate between them as shown in figure 1 .  ...  Section 5 discusses the use of actors to provide interoperability in programming environments-i.e., to provide a software technology which permits use of multiple programming paradigms.  ...  The work described in this paper has been made possible by support provided by a Young Investigator Award from the Office of Naval Research (ONR contract number N00014-90-J-1899), by an Incentives for  ... 
doi:10.1007/bf02811343 fatcat:cx7b7rpe2zcylcai6vut7kddaa

Modeling and testing object-oriented distributed systems with linear-time temporal logic

F. Dietrich, X. Logean, J.-P. Hubaux
2001 Concurrency and Computation  
We present a framework for constructing formal models of object-oriented distributed systems and a property language to express behavioral constraints in such models.  ...  Any approach should be applicable to object-oriented distributed systems as they are developed in the industry today such that the investment made into the development of the model and tools is amortized  ...  We would like to thank C. Delcourt and S. Grisouard at Alcatel Alsthom Research, Marcoussis, and P.-A.  ... 
doi:10.1002/cpe.571 fatcat:dmcfng6r2vbhtlmevlxqy57pxq

Concurrent object-oriented programming

Gul Agha
1990 Communications of the ACM  
of the Silicon Valley Patterns Group performed similar valuable service for preliminary versions of the second edition.  ...  Official and unofficial reviewers of the first-and second-edition manuscripts made helpful comments and suggestions on tight schedules. They include  ...  In addition to concurrency constructs, this example illustrates a few of the issues encountered when using threads with any GUI-based program.  ... 
doi:10.1145/83880.84528 fatcat:natymhbbtbh7zivohgmsjbwg3m

A logical theory of concurrent objects

José Meseguer
1990 SIGPLAN notices  
Thanks to this axiomatization, it becomes possible to study the behavior of concurrent objects by formal methods in a logic intrinsic to their computation.  ...  A new theory of concurrent objects is presented.  ...  -is-to-: 1d.C S OId -> Msg . to create messages requesting that the value of the attribute of the recipient object is sent to another specified object; this behavior is specified by introducing the corresponding  ... 
doi:10.1145/97946.97958 fatcat:xn5kesgm4fgutfwdtrl5atnojy
« Previous Showing results 1 — 15 out of 25,578 results