Filters








8,546 Hits in 5.1 sec

Propositional Dynamic Logic with Storing, Recovering and Parallel Composition

Mario R.F. Benevides, Renata de Freitas, Petrucio Viana
2011 Electronical Notes in Theoretical Computer Science  
This work extends Propositional Dynamic Logic (PDL) with parallel composition operator and four atomic programs which formalize the storing and recovering of elements in data structures.  ...  The use of the new language (PRSPDL) is illustrated with some examples.  ...  Definition 2.2 The dynamic modal language with parallel composition, storing and recovering (PRSPDL) is a multi-modal language consisting of a set Φ of countably many propositional symbols, typically denoted  ... 
doi:10.1016/j.entcs.2011.03.008 fatcat:7fl2exwwjvcpne34wsdxgahv3q

Tableaux Methods for Propositional Dynamic Logics with Separating Parallel Composition [chapter]

Philippe Balbiani, Joseph Boudou
2015 Lecture Notes in Computer Science  
Boudou, Joseph Tableaux methods for propositional dynamic logics with separating parallel composition.  ...  PRSPDL is a propositional dynamic logic with an operator for parallel compositions of programs. We first give a complexity upper bound for this logic.  ...  PDL with storing, recovering and parallel composition (PRSPDL) [4] is another extension of PDL with a construct for parallel composition of programs.  ... 
doi:10.1007/978-3-319-21401-6_37 fatcat:5sqxybevf5e6fcjrit64mqumlu

Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition [chapter]

Joseph Boudou
2016 Lecture Notes in Computer Science  
PPDL det extends propositional dynamic logic (PDL) with parallel composition of programs.  ...  This new construct has separation semantics: to execute the parallel program (α || β) the initial state is separated into two substates and the programs α and β are executed on these substates.  ...  The propositional dynamic logic with storing, recovering and parallel composition (PRSPDL) [4] can cope with such situations.  ... 
doi:10.1007/978-3-319-40229-1_26 fatcat:funi23ybnvbeblb6vothos2444

Iron: managing obligations in higher-order concurrent separation logic

Aleš Bizjak, Daniel Gratzer, Robbert Krebbers, Lars Birkedal
2019 Proceedings of the ACM on Programming Languages (PACMPL)  
We present Iron, a novel higher-order concurrent separation logic that allows for precise reasoning about resources that are transferable among dynamically allocated threads.  ...  We show soundness of Iron by means of a model of Iron, defined on top of the Iris base logic, and we use this model to prove that memory resources are accounted for precisely and not leaked.  ...  ACKNOWLEDGMENTS We thank Thomas Dinsdale-Young and Morten Krogh-Jespersen for invaluable discussions, and the reviewers for suggestions on how to make the paper more accessible.  ... 
doi:10.1145/3290378 fatcat:6zwu54msfzdvjddsoi256gvnfy

Convolution as a Unifying Concept

Brijesh Dongol, Ian J. Hayes, Georg Struth
2016 ACM Transactions on Computational Logic  
, where convolution is the chop operation; and stream interval functions, where convolution is proposed for analysing the trajectories of dynamical or real-time systems.  ...  A notion of convolution is presented in the context of formal power series together with lifting constructions characterising algebras of such series, which usually are quantales.  ...  We would like to thank Alasdair Armstrong, Kirill Bogdanov, John Derrick, Victor Gomes and Lindsay Groves for discussions of earlier versions.  ... 
doi:10.1145/2874773 fatcat:czhzxgz5xne6xdfjsz2d6q3ka4

Iteration-free PDL with storing, recovering and parallel composition: a complete axiomatization

Philippe Balbiani, Joseph Boudou
2015 Journal of Logic and Computation  
Sections 2 and 3 present the syntax and the semantics of PRSPDL 0 -a variant of iteration-free PDL with parallel composition.  ...  Instead of using axioms to define the program operation of parallel composition in the language of PDL enlarged with propositional quantifiers, we add an unorthodox rule of proof that makes the canonical  ...  ANR-11-BS02-011) who made several helpful comments for improving the correctness and the readability of this article.  ... 
doi:10.1093/logcom/exv035 fatcat:atrwdmpam5depg47mnvemqzvf4

SteelCore: an extensible concurrent separation logic for effectful dependently typed programs

Nikhil Swamy, Aseem Rastogi, Aymeric Fromherz, Denis Merigoux, Danel Ahman, Guido Martínez
2020 Proceedings of the ACM on Programming Languages (PACMPL)  
We conclude that our effectful semantics provides a simple yet expressive basis on which to layer domain-specific languages and logics for verified, concurrent programming.  ...  and to be specified and verified using a full-featured, extensible CSL.  ...  questions and many useful discussions.  ... 
doi:10.1145/3409003 fatcat:ekzrvta4gjaqta32tdl2zgp2gu

Interference Analysis for Dependable Systems Using Refinement and Abstraction [chapter]

Claus Pahl
2002 Lecture Notes in Computer Science  
A common requirement for modern distributed and reactive systems is a high dependability guaranteeing reliability and security.  ...  Refinement and its dual -abstraction -will play the key roles in an integrated development and analysis framework.  ...  The parallel composition p|q of commands p and q of agents A and B, resp., makes our framework different from dynamic logic as presented in [4] .  ... 
doi:10.1007/3-540-45614-7_19 fatcat:ytatdqup4rgx7chd77rp3n4swe

On the analysis of compensation correctness

Cátia Vaz, Carla Ferreira
2012 The Journal of Logic and Algebraic Programming  
Under our theory, we formally interpret self-healing compositions, that can detect and recover from faults, as correct compositions of compensable processes.  ...  Within this setting, we discuss and formally state correctness criteria for compensable processes compositions, assuming that each process is correct with respect to transaction recovery.  ...  Acknowledgements We thank to Michael Leuschel, Jens Bendisposto and Daniel Plagge for their support on the ProB tool.  ... 
doi:10.1016/j.jlap.2012.04.002 fatcat:btejurrj2ffoddgogaxyivfgqe

Using data-flow analysis for resilience and result checking in peer-to-peer computations

S. Jafar, S. Varrette, J.-L. Roch
2004 Proceedings. 15th International Workshop on Database and Expert Systems Applications, 2004.  
It provides correct execution with respect to a probabilistic certificate. We have implemented it on top of Athapascan programming interface and experimental results are presented.  ...  To achieve correct execution of peer-to-peer applications on non-reliable resources, we present a portable and distributed algorithm that provides fault tolerance and result checking.  ...  Proposition 2. Let consider an execution with n tasks and a probability of tasks forgery lesser than q.  ... 
doi:10.1109/dexa.2004.1333526 dblp:conf/dexaw/JafarVR04 fatcat:huz5wah7v5a4la2mcrwz2wcv5q

QoS negotiation in service composition

Maria Grazia Buscemi, Ugo Montanari
2011 The Journal of Logic and Algebraic Programming  
Basically, a guard c j : π j in a choice is enabled if the constraint c j is entailed by the store of constraints and the prefix π j can be consumed.  ...  Service composition in Service Oriented Computing concerns not only integration of heterogeneous distributed applications but also dynamic selection of services.  ...  Acknowledgements The authors are grateful to the anonymous reviewers for their significant help in improving the quality of this contribution and in correcting the semantics.  ... 
doi:10.1016/j.jlap.2010.04.001 fatcat:mhf4m2co3fbs3lesdsjtbaxq3q

An interactive semantics of logic programming [article]

Roberto Bruni, Ugo Montanari, Francesca Rossi
2001 arXiv   pre-print
As main contributions, we mention the finitary presentation of abstract unification, and a concurrent and coordinated abstract semantics consistent with the most common semantics of logic programming.  ...  We apply to logic programming some recently emerging ideas from the field of reduction-based communicating systems, with the aim of giving evidence of the hidden interactions and the coordination mechanisms  ...  This research has been supported by CNR Integrated Project Progettazione e Verifica di Sistemi Eterogenei ; by Esprit WG CONFER2 and COORDINA ; and by MURST project TOSCA.  ... 
arXiv:cs/0107022v1 fatcat:v3ikvkrkcffa3iywls2s275t2u

A Concurrent Logical Relation

Lars Birkedal, Filip Sieczkowski, Jacob Thamsborg, Marc Herbstritt
2012 Annual Conference for Computer Science Logic  
higher-order store and dynamic memory allocation.  ...  ACM Subject Classification F.3.1 Specifying and Verifying and Reasoning about Programs We consider a standard call-by-value lambda calculus with general references, and extended with parallel composition  ...  In this paper we present the first Kripke logical relation for reasoning about equivalence of a concurrent higher-order ML-like language with higher-order store and dynamic memory allocation.  ... 
doi:10.4230/lipics.csl.2012.107 dblp:conf/csl/BirkedalST12 fatcat:5lue3ayujzdo3ib355uyztq63a

High-Efficiency Parallel Cryptographic Accelerator for Real-Time Guaranteeing Dynamic Data Security in Embedded Systems

Zhun Zhang, Xiang Wang, Qiang Hao, Dongdong Xu, Jinlei Zhang, Jiakang Liu, Jinhui Ma
2021 Micromachines  
Dynamic data security in embedded systems is raising more and more concerns in numerous safety-critical applications.  ...  Therefore, this paper presents a security SoC architecture with integrating a four-parallel Advanced Encryption Standard-Galois/Counter Mode (AES-GCM) cryptographic accelerator for achieving high-efficiency  ...  recover the 16-byte secret key by using the side-channel attacks and then injects tampered data.  ... 
doi:10.3390/mi12050560 pmid:34063441 fatcat:o6e4zpjoure6tcx245jzah6wgq

Synthesizing Monitors for Safety Properties [chapter]

Klaus Havelund, Grigore Roşu
2002 Lecture Notes in Computer Science  
An algorithm which takes a past time LTL formula and generates an efficient dynamic programming algorithm is presented.  ...  The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in runtime analysis of software.  ...  Our main theoretical contribution in this paper is Proposition 1 which shows that the MaC logic, together with 10 others, is equivalent to the standard past time temporal logic.  ... 
doi:10.1007/3-540-46002-0_24 fatcat:ptjqgzuhsnapblrh3taf6ewcyi
« Previous Showing results 1 — 15 out of 8,546 results