Abstract
In this paper we present a new kind of semantics for Concurrent ML, apopular concurrent extension of the MLfunctional language equipped with message-passing inter-processcommunication along first-class channels. This semanticsis based on infinite domains of higher-dimensional transition systems that are able to model the asynchronous execution of concurrentoperations and is operational in nature.By dual abstract interpretation using folding of states and truncation oftransitions finite automata can be automatically derived that representa sound but imprecise semantics of a given program. They are used to compute staticproperties verified by the standardconcurrent execution of the program by means of abstractmodel-checking of modal logic formulae.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
