Filters








88,946 Hits in 5.6 sec

A tactic language for refinement of state-rich concurrent specifications

Marcel Oliveira, Frank Zeyda, Ana Cavalcanti
2011 Science of Computer Programming  
Circus is a refinement language in which specifications define both data and behavioural aspects of concurrent systems using a combination of Z and CSP.  ...  Here, we present ArcAngelC , a language for defining such tactics; we present the language, its semantics, and its application in the formalisation of an existing strategy for verification of Ada implementations  ...  The function applyTacsGC takes two lists: the first is a list of tactics and the second is a list of refinement cells.  ... 
doi:10.1016/j.scico.2010.11.012 fatcat:5ygb73pqdrdyzcmbksullupjvy

An Event-Based SOS for a Language with Refinement [chapter]

Arend Rensink
1995 Structures in Concurrency Theory  
It is usually introduced in the form of an operator in a process algebraic language, for which a denotational semantics in a suitable model is then given.  ...  In this paper we complement this approach b y de ning a corresponding operational semantics for re nement, in the form of derivation rules for a transition relation.  ...  Introduction Process algebras form a well-known speci cation paradigm for concurrent systems.  ... 
doi:10.1007/978-1-4471-3078-9_20 dblp:conf/strict/Rensink95 fatcat:wejkxllw6fb4xkzkig7iptx2uq

A separation logic for refining concurrent objects

Aaron Joseph Turon, Mitchell Wand
2011 Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '11  
Fine-grained concurrent data structures are crucial for gaining performance from multiprocessing, but their design is a subtle art.  ...  In this paper we show how the ownership discipline of separation logic can be used to enable atomicity refinement, and we develop a new rely-guarantee method that is localized to the definition of a data  ...  Acknowledgements Thanks to Dan Brown, Claudio Russo and Sam Tobin-Hochstadt for feedback and discussions. The first author was supported by a grant from Microsoft Research.  ... 
doi:10.1145/1926385.1926415 dblp:conf/popl/TuronW11 fatcat:qouw3ywoabdyfnklwbkddrp7ii

A Concurrent Language for Refinement

Jim Woodcock, Ana Cavalcanti
2001 unpublished
Ò Ø ÖÓÙÒ × ÓÖ Ø× × Òº Ë Ø ÓÒ ¿ ÔÖ × ÒØ× × ×ØÙ Ý Ò Ø Ù× Ó Ö Ù׺ Ò ÐÐݸ Ò Ë Ø ÓÒ Û ÔÖ × ÒØ ÓÙÖ ÓÒ ÐÙ× ÓÒ׸ ÐÓÒ Û Ø Ö Ð Ø Ò ÙØÙÖ ÛÓÖ º ¾ Ö Ù× Ä Ò ×Ô ¬ Ø ÓÒ¸ Ö Ù× ÔÖÓ Ö Ñ × ÓÖÑ Ý × ÕÙ Ò Ó Ô Ö Ö Ô × Ó Ø × Ò  ...  Ò×Ø ÒØ Ø ÔÖÓ ×× ´ µ ÓÙØÔÙØ× Ø ÓÒ × ÕÙ Ò ×Ø ÖØ Ò ÖÓÑ Ø× ÓÙÖØ Ð Ñ Òغ Ï Ò Ð×Ó ¬Ò Ò Ö ÔÖÓ ×× × Ø Ñ Ò ×Ñ × × Ñ Ð Ö ØÓ Ø Ø Ó Ò Ö × Ñ Ò º ÁÒ Ø ÔÖÓ ×× È¸Ø Ò Ñ × Ò Ö Ô Ö Ñ Ø Ö Ø Ø Ò Ù× × ØÝÔ Ò Ø ¬Ò Ø ÓÒ Ó Èº Ä  ... 
doi:10.14236/ewic/iwfm2001.7 fatcat:xbvrnhgwpnf5hbltpn2xpcevkm

A compliance notation for verifying concurrent systems

D. M. Atiya, S. King
2002 Proceedings of the 24th international conference on Software engineering - ICSE '02  
For example, not only should the specification language be suitable for specifying concurrent systems but also it should be amenable for refinement.  ...  A specification language that captures the communication aspects of concurrent systems, 2. A concurrent programming language, and 3.  ... 
doi:10.1145/581339.581475 dblp:conf/icse/AtiyaK02 fatcat:wqurookxjzaq5grscmckswljbu

A Formal Method for Specifying The Interface of Components in Real-time Concurrent Systems

Do Van Chieu
2015 Research and Development on Information and Communication Technology  
In this paper, we propose a method for specifying the interface of components in real-time concurrent systems.  ...  In addition, we propose a class of automata that can recognize a class of timed trace languages called timed concurrent interface automata.  ...  Definitions As introduced in Section 1, the protocol of a realtime concurrent component interface is timed trace language. For the finite representation of the languages, we use ADA.  ... 
doi:10.32913/mic-ict-research.v3.n12.317 fatcat:p4yjwyuvebba7fdrc7gukeq4yi

Models, Languages and Logics for Concurrent Distributed Systems: CEDISYS Workshop (Aarhus, 1991, May 21--24)

Uffe Engberg, Mogens Nielsen, Glynn Winskel
1992 DAIMI Report Series  
</p><p>This booklet contains the program of the workshop, short abstracts for the talks presented, and a list of participants.</p>  ...  <p>The EEC Esprit Basic Research Action No 3011, Models, Languages and Logics for Con current Distributed Systems, CEDISYS, held its second workshop at Aarhus University in May, l991, following the successful  ...  The source language for the translation is a subset of occam-2 and the target language is an abstract assembly language for the transputer.  ... 
doi:10.7146/dpb.v21i392.6627 fatcat:z7kwdje4ebdkrmvhynaomrvqu4

Page 476 of Mathematical Reviews Vol. , Issue 94a [page]

1994 Mathematical Reviews  
For a simple language containing actions of this kind and combinators for sequential and parallel composition of processes, he considers an equivalence called refine equivalence and denoted ~,, which is  ...  Action refinement may be used to give a complete characterization of a model of concurrent computation based on partial orders, the series-parallel pomset of Pratt and Gisher.  ... 

Concurrency specification using Event-based Specification Chart

Dumitru Ciorba, Victor Besliu
2012 Computer Science Journal of Moldova  
Architecting framework proposed in [1] can be used efficiently for developing concurrency-intensive systems only if there exist languages and tools corresponding to the described concepts.  ...  The main focus of our research is to improve usage of formal method in verification of concurrency.  ...  Refinement relations between clouds and events is shown in An event structure semantic for ESCs Every specification language should have a formal semantic, which defines logic for reasoning about behavior  ... 
doaj:4fe7421d1e84446db17192efa811a677 fatcat:iabkg47qfngnlpnyhyjq52m664

Modular reasoning about concurrent higher-order imperative programs

Lars Birkedal
2014 Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '14  
a relational model for a type-and-effect system; and (2) to show correctness of fine-grained concurrent data structures by showing that they are contextual refinements of their coarse-grained counterparts  ...  are indeed related; and (3) to develop logical relations for concurrent languages which allow one to reason about one thread at a time, while still accounting for the possible interference of other running  ... 
doi:10.1145/2535838.2537849 dblp:conf/popl/Birkedal14 fatcat:hjgtj3khsfg2zk766px2gexvaq

Atomicity Refinement for Verified Compilation

Suresh Jagannathan, Vincent Laporte, Gustavo Petri, David Pichardie, Jan Vitek
2014 ACM Transactions on Programming Languages and Systems  
permission system to handle such complex examples) Summary ▶ Compiler for a high-level concurrent language written in Coq ▶ Proof that program refinement implies behaviour inclusion ▶ Sound refinement  ...  a high-level concurrent language written in Coq ▶ Proof that program refinement implies behaviour inclusion ▶ Sound refinement rules ▶ Case studies: spin lock and concurrent garbage collector (using a  ... 
doi:10.1145/2601339 fatcat:auepqofp7vcbxihoub4gphxya4

Progress of Concurrent Objects

Hongjin Liang, Xinyu Feng
2020 Foundations and Trends® in Programming Languages  
In this tutorial we introduce LiLi, a new rely-guarantee style logic for concurrent objects.  ...  Finally, we introduce a rely-guarantee style program logic LiLi for verifying linearizability and progress together for concurrent objects.  ... 
doi:10.1561/2500000041 fatcat:5ko7v5ggmrdoddfqnv24w62g24

Atomicity refinement for verified compilation

Suresh Jagannathan, Gustavo Petri, Jan Vitek, David Pichardie, Vincent Laporte
2013 Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI '14  
permission system to handle such complex examples) Summary ▶ Compiler for a high-level concurrent language written in Coq ▶ Proof that program refinement implies behaviour inclusion ▶ Sound refinement  ...  a high-level concurrent language written in Coq ▶ Proof that program refinement implies behaviour inclusion ▶ Sound refinement rules ▶ Case studies: spin lock and concurrent garbage collector (using a  ... 
doi:10.1145/2594291.2594346 dblp:conf/pldi/JagannathanPVPL14 fatcat:wd4v4jh6pnau3ipbg7536pqltm

A rely-guarantee-based simulation for verifying concurrent program transformations

Hongjin Liang, Xinyu Feng, Ming Fu
2012 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '12  
In this paper, we propose a Rely-Guarantee-based Simulation (RGSim) to verify concurrent program transformations.  ...  We also propose a general garbage collector verification framework based on RGSim, and verify the Boehm et al. concurrent mark-sweep GC.  ...  Here we propose a more direct approach. We view a concurrent garbage collecting system as a transformation T from a high-level garbage-collected language to a low-level language.  ... 
doi:10.1145/2103656.2103711 dblp:conf/popl/LiangFF12 fatcat:xdr6gbu5knezpdfk56g7ysfsiy

Towards the Refinement of Executable Temporal Objects [chapter]

Michael Fisher
1997 IFIP Advances in Information and Communication Technology  
on the basis for refining such systems.  ...  Concurrent METATEM is a high-level language in which the behaviour of an individual reactive component is represented by a temporal logic formula and is animated by direct execution.  ...  INTRODUCTION Concurrent METATEM is a simple programming language developed for reactive systems (Fisher 1993 ) that has been shown to be particularly useful in representing and developing multi-agent  ... 
doi:10.1007/978-0-387-35261-9_30 fatcat:bf3ndzsb3rdrlgdwn5uop7n6ra
« Previous Showing results 1 — 15 out of 88,946 results