Filters








23,890 Hits in 3.2 sec

An Environment for the Development of Concurrent Object-Based Applications

Fernando L. Dotti, Lucio M. Duarte, Luciana Foss, Leila Ribeiro, Daniela Russi, Osmar M. dos Santos
2005 Electronical Notes in Theoretical Computer Science  
In this paper we present the set of tools we have developed and/or integrated to build an environment for the development of concurrent object-based systems.  ...  With this environment, we support the specification and analysis of concurrent object-based systems specified using OBGG.  ...  the kernel semantics for message passing.  ... 
doi:10.1016/j.entcs.2004.12.026 fatcat:z2wgeakauffznldexjndybfyaq

Static Provenance Verification for Message Passing Programs [chapter]

Rupak Majumdar, Roland Meyer, Zilong Wang
2013 Lecture Notes in Computer Science  
The provenance verification problem is to statically decide, given a message passing program and a set of allowed provenances, whether the provenance of all messages in all possible program executions,  ...  We study the problem of provenance tracking in concurrent programs, in which several principals execute concurrent processes and exchange messages over unbounded but unordered channels.  ...  We model systems as concurrent message passing processes, one process for each principal in the system. Processes communicate by sending and receiving messages via a shared set of channels.  ... 
doi:10.1007/978-3-642-38856-9_20 fatcat:4tq6uiwrkrd3jkqi2ffvwtww5y

Symbolically modeling concurrent MCAPI executions

Topher Fischer, Eric Mercer, Neha Rungta
2011 Proceedings of the 16th ACM symposium on Principles and practice of parallel programming - PPoPP '11  
In this work we describe a new technique for modeling executions of concurrent software that use a message passing API called MCAPI.  ...  Improper use of Inter-Process Communication (IPC) within concurrent systems often creates data races which can lead to bugs that are challenging to discover.  ...  The semantics of message passing applications are difficult to model.  ... 
doi:10.1145/1941553.1941602 dblp:conf/ppopp/FischerMR11 fatcat:ihbrzw7dgnc2bdlb3jxwnqejbi

Symbolically modeling concurrent MCAPI executions

Topher Fischer, Eric Mercer, Neha Rungta
2011 SIGPLAN notices  
In this work we describe a new technique for modeling executions of concurrent software that use a message passing API called MCAPI.  ...  Improper use of Inter-Process Communication (IPC) within concurrent systems often creates data races which can lead to bugs that are challenging to discover.  ...  The semantics of message passing applications are difficult to model.  ... 
doi:10.1145/2038037.1941602 fatcat:a3z6k5dr3ratnbkluk2pclezmq

The foundations of program verification

Michal Grabowski
1988 Science of Computer Programming  
Basic concepts of cpo-theory are provided. Each verification method is proved to be correct with the help of the most appropriate of the semantics.  ...  The book ends with a short overview of other approaches and more advanced investigations in the field of program verification.  ...  The actor model of computation combines an object-based view of the world with concurrency. Every computational entity in an actor system is an actor, capable of responding to messages.  ... 
doi:10.1016/0167-6423(88)90027-5 fatcat:ozc63425qveylnjyy72d77qf7u

Some resources for teaching concurrency

Ganesh Gopalakrishnan, Michael DeLisi, Simone Atzeni, Yu Yang, Sarvani Vakkalanka, Anh Vo, Sriram Aananthakrishnan, Grzegorz Szubzda, Geof Sawaya, Jason Williams, Subodh Sharma
2009 Proceedings of the 7th Workshop on Parallel and Distributed Systems Testing, Analysis, and Debugging - PADTAD '09  
We examine background papers, the teaching of low level concurrency, and the teaching of threading and message passing.  ...  Our observation is that the teaching of concurrency is greatly facilitated by the use of dynamic push-button formal verification tools that can handle non-trivial concurrent programs.  ...  Acknowledgements: The first author likes to especially thank the students of CS 5966/6966 of Spring 2009 for their patience and feedback through his class.  ... 
doi:10.1145/1639622.1639624 dblp:conf/issta/GopalakrishnanYVVASSWSDA09 fatcat:ajrmptwimze45errm5yyeap3dq

An Empirical Study of Messaging Passing Concurrency in Go Projects

Nicolas Dilley, Julien Lange
2019 2019 IEEE 26th International Conference on Software Analysis, Evolution and Reengineering (SANER)  
Go is a popular programming language renowned for its good support for system programming and its channelbased message passing concurrency mechanism.  ...  In this paper, we analyse 865 Go projects from GitHub in order to understand how message passing concurrency is used in publicly available code.  ...  We would like to thank Nicholas Ng, Stefan Marr, Bernardo Toninho, and the anynomous referees for their thoughtful comments on earlier versions of this work.  ... 
doi:10.1109/saner.2019.8668036 dblp:conf/wcre/DilleyL19 fatcat:fm6a4xjzt5aprnxdcpkq4rjnr4

Model checking processes specified in join-calculus algebra

Maludziński Sławomir, Dobrowolski Grzegorz
2014 Computer Science  
This article presents a model checking tool used to verify concurrent systems specified in join-calculus algebra. The temporal properties of systems under verification are expressed in CTL logic.  ...  The described model checker is a proof of concept for the utilization of new methodologies of formal system specification and verification in software engineering practice.  ...  Summary and future extensions The proposed model checker can be used for the specification and verification of concurrent systems.  ... 
doi:10.7494/csci.2014.15.1.61 fatcat:x4nfmgjytfgbzppbnfs5qxzc4y

Verification and coverage of message passing multicore applications

Etem Deniz, Alper Sen, Jim Holt
2012 ACM Transactions on Design Automation of Electronic Systems  
Verification and coverage of message passing multicore applications.  ...  We describe verification and coverage methods for multicore software that uses message passing libraries for communication.  ...  Our properties are related with problems that occur in concurrent message passing systems, for instance, the size of the sent message being larger than the maximum message size defined in the MCAPI library  ... 
doi:10.1145/2209291.2209296 fatcat:ikq5j2hamzbtjixf52mycfktqu

Using Category Theory to Verify Implementation Against Design in Concurrent Systems

Ming Zhu, Peter Grogono, Olga Ormandjieva
2015 Procedia Computer Science  
However, in the development of a concurrent system, there is a challenge to manage consistency between design and implementation.  ...  The consistency between the design and the implementation of such a concurrent system is verified formally using category theory.  ...  With the notion of port, it helps to specify and analyze passing messages between processes and channels. In this research, Erasmus is chosen to implement concurrent systems.  ... 
doi:10.1016/j.procs.2015.05.030 fatcat:ko4m3sjetfh6tla6riuit7fq2i

Assertional Reasoning for Concurrent and Communicating BPEL-like Programs

Longfei Zhu, Qiwen Xu, Huibiao Zhu
2018 Communication Papers of the 2018 Federated Conference on Computer Science and Information Systems  
Traditionally, in verification of concurrent and distributed programs, the model was either based on shared variables or message passing and was studied separately.  ...  Therefore, it is natural that for verification of BPEL-like programs, the verification methods developed for shared variables and message passing be integrated.  ...  Hoare logic to concurrent programs with shared variables and distributed programs with message passing.  ... 
doi:10.15439/2018f148 dblp:conf/fedcsis/ZhuXZ18 fatcat:3tjsc3kvzvcv3e3lavkssmkbsm

Verification Tests for MCAPI

Alper Sen, Etem Deniz
2011 2011 12th International Workshop on Microprocessor Test and Verification  
Simulation based verification is the most commonly used verification technique in the industry.  ...  We present preliminary experimental results to validate the effectiveness of our approach. 12th International Workshop on Microprocessor Test and Verification 978-0-7695-4594-3/11 $26.00  ...  MCAPI is a message passing programming library, similar to the well-known MPI [3] library for distributed systems.  ... 
doi:10.1109/mtv.2011.18 dblp:conf/mtv/SenD11 fatcat:wwcyt5vr2zg2jgyrhwma7h5lsa

Modular verification of web services using efficient symbolic encoding and summarization

Fang Yu, Chao Wang, Aarti Gupta, Tevfik Bultan
2008 Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering - SIGSOFT '08/FSE-16  
Our technical contributions include (1) an efficient symbolic encoding for modeling the concurrency semantics of systems having both multi-threading and message passing, and (2) a scalable method for summarizing  ...  concurrent processes that interact with each other using synchronous message passing, along with a modular framework that utilizes these summaries for scalable verification.  ...  message passing among processes.  ... 
doi:10.1145/1453101.1453127 dblp:conf/sigsoft/YuWGB08 fatcat:54r4rlckmjgvbcah2jm2gcoqbi

Verification coverage of embedded multicore applications

E. Deniz, A. Sen, J. Holt
2012 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE)  
Verification of embedded multicore applications is crucial as these applications are deployed in many safety critical systems.  ...  Verification task is complicated by concurrency inherent in such applications.  ...  MCAPI is a message passing API like the well-known MPI [3] but its target system and functionalities differ from MPI.  ... 
doi:10.1109/date.2012.6176471 dblp:conf/date/DenizSH12 fatcat:jtk5dff6zrb33er5hrnw4wwpce

Principles of proving concurrent programs in Gypsy

Donald I. Good, Richard M. Cohen, James Keeton-Williams
1979 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '79  
Concurrency in Gypsy is based on a unique, formal approach to specifying and proving systems of concurrent processes.  ...  The specification and proof methods are designed so that proofs of individual processes are totally independent, even when operating concurrently.  ...  Because concurrent systems are usually more complex than sequential systems, the use of the independence principle is even more important in concurrent systems; we know of no other proof methods for concurrent  ... 
doi:10.1145/567752.567757 dblp:conf/popl/GoodC79 fatcat:ayvp7bzzzvbxfkt2kcfjkq5tai
« Previous Showing results 1 — 15 out of 23,890 results