3,535 Hits in 6.7 sec

Message Assertions and Predicate-Based Control-Flow Unfolding Revisited

Thomas S. Heinze, Wolfram Amme, Simon Moser
2014 Central-European Workshop on Services and their Composition  
In our previous work, we considered, on the one hand, the predicate-based unfolding of a business process's conditional control flow and, on the other hand, the introduction of assertions for the contents  ...  of messages exchanged between processes.  ...  Predicate-Based Control-Flow Unfolding In principle, predicate-based control-flow unfolding [3] aims at resolving the databased choices of a business process.  ... 
dblp:conf/zeus/HeinzeAM14 fatcat:qo7qwcaurrdt5cwc7onbhsiiii

Formal Framework For Mils Integration

Julien Schmaltz, Holger Blasum, Bruno Langenstein, Betrand Leconte, Kevin Müller, Freek Verbeek, Ruud Koolen
2016 Zenodo  
These extensions enable the reasoning at an abstract level built on top of noninterference, at a much finer level than allowed by base noninterference.  ...  As an illustration of our approach, we formally model and analyse an example system inspired by the GWV Firewall.  ...  Based on this notion, we can describe the message passing semantics that characterise the flow of information between domains.  ... 
doi:10.5281/zenodo.57413 fatcat:mvqqomtiafcfxmyb3fkaagor6q

Characteristic Formulae for Liveness Properties of Non-Terminating CakeML Programs

Johannes Åman Pohjola, Henrik Rostedt, Magnus O. Myreen, Michael Wagner
2019 International Conference on Interactive Theorem Proving  
The approach is inspired by transfinite induction rather than coinduction, and does not require non-terminating loops to be productive.  ...  There are useful programs that do not terminate, and yet standard Hoare logics are not able to prove liveness properties about non-terminating programs.  ...  Acknowledgements We are grateful to Robert Sison and the anonymous reviewers for many constructive and insightful comments.  ... 
doi:10.4230/lipics.itp.2019.32 dblp:conf/itp/PohjolaRM19 fatcat:csu4bmj6nze7lpfxg6jsejl4pi

JaVerT 2.0: compositional symbolic execution for JavaScript

José Fragoso Santos, Petar Maksimović, Gabriela Sampaio, Philippa Gardner
2019 Proceedings of the ACM on Programming Languages (PACMPL)  
JaVerT 2.0 supports whole-program symbolic testing, verification, and, for the first time, automatic compositional testing based on bi-abduction.  ...  We propose a novel, unified approach to the development of compositional symbolic execution tools, bridging the gap between classical symbolic execution and compositional program reasoning based on separation  ...  We would also like to thank Emma Tye and Sacha-Élie Ayoun, whose work during their UROP and MSc projects improved the infrastructure of JaVerT 2.0.  ... 
doi:10.1145/3290379 fatcat:kdbxb6ffrrddxkixh3lhfqiln4

Coordination as an Architectural Aspect

Carlos E. Cuesta, M. Pilar Romay, Pablo de la Fuente, Manuel Barrio-Solórzano
2006 Electronical Notes in Theoretical Computer Science  
Recent research has revisited the original Principle, suggesting a different modularization strategy.  ...  pipeline-style architecture, and obtaining a coordinated version of the initial system.  ...  In fact, the first predicate in the assertion, Coord Gates, which consists just of an action predicate, already superimposes every learner on every gate, and that's exactly the behaviour we need, so no  ... 
doi:10.1016/j.entcs.2005.12.031 fatcat:qmn3pssg4fcbvk2fj7xfm4bfim

Analytical Inductive Functional Programming [chapter]

Emanuel Kitzelmann
2009 Lecture Notes in Computer Science  
Acknowledgements We thank the LOPSTR'2008 referees for helpful comments and suggestions.  ...  Acknowledgement The author would like to thank anonymous reviewers for their constructive and useful comments on the previous version of the paper.  ...  All these approaches are based on the so called threaded control flow graph and the threaded program dependence graph.  ... 
doi:10.1007/978-3-642-00515-2_7 fatcat:r3xkzawlibfcpluopvlz7ukp4y

Barriers in Concurrent Separation Logic: Now With Tool Support!

Aquinas Hobor, Cristian Gherghina, Frank Piessens
2012 Logical Methods in Computer Science  
of the logic and its soundness proof.  ...  We develop and prove sound a concurrent separation logic for Pthreads-style barriers.  ...  on the relation of our logic to the logic of his Heap-Hop tool, and Bart Jacobs for discovering how to verify our example program in his VeriFast tool.  ... 
doi:10.2168/lmcs-8(2:2)2012 fatcat:q4jx7tr35fdjtl7fekt67slak4

Temporal Superimposition of Aspects for Dynamic Software Architecture [chapter]

Carlos E. Cuesta, María del Pilar Romay, Pablo de la Fuente, Manuel Barrio-Solórzano
2006 Lecture Notes in Computer Science  
To illustrate this approach, we expose a case study in which all these ideas are used, and conclude by discussing how the combination of temporal logic and aspect superimposition, in this context, provides  ...  The well-known Separation of Concerns Principle has been revisited by recent research, suggesting to go beyond the limits of traditional modularization.  ...  Therefore, the syntax for temporal assertions would be based in that of PiLar's dynamic language and the µ-calculus.  ... 
doi:10.1007/11768869_9 fatcat:6pkrvxpok5a3rlpcaqmndjlhde

Do As I SaY! Programmatic Access Control with Explicit Identities

Andrew Cirillo, Radha Jagadeesan, Corin Pitcher, James Riely
2007 Computer Security Foundations Workshop (CSFW), Proceedings of the IEEE  
We address the programmatic realization of the access control model of security in distributed systems.  ...  (learn M ⇒ N.P) Assume E a learn M ⇒ N.P, and dom(E) ∩ dom(E ) = / 0. By the typing rule, E a M : Un and E a N : Un, and clauses(E) a says M ⇒ N, and E a P. By (b), E, E a M : Un and E, E a N : Un.  ...  Andrew Cirillo and James Riely were supported by NSF Career 0347542. Radha Jagadeesan and Corin Pitcher were supported by NSF Cybertrust 0430175.  ... 
doi:10.1109/csf.2007.19 dblp:conf/csfw/CirilloJPR07 fatcat:javfgxkpnvhfvdehgdbqzjkviy

The Coq Proof Assistant, Version 8.7.2 [article]

The Coq Development Team
2018 Zenodo  
Other changes include improved support for building with OCaml 4.06.0 and external num package, many other bug fixes, documentation improvements, and user message improvements.  ...  Feedback and bug reports are extremely welcome. This is the second release of Coq developed on a time-based development cycle.  ...  Acknowledgments The authors would like to thank Frédéric Blanqui, François Pottier and Laurence Rideau for their comments and suggestions.  ... 
doi:10.5281/zenodo.1174360 fatcat:ewr4sjw56bep7ej7j34qmpm74i

Declarative Network Verification [chapter]

Anduo Wang, Prithwish Basu, Boon Thau Loo, Oleg Sokolsky
2008 Lecture Notes in Computer Science  
DNV utilizes theorem proving, a well established verification technique where logic-based axioms that automatically capture network semantics are generated, and a userdriven proof process is used to establish  ...  In this paper, we present our initial design and implementation of a declarative network verifier (DNV).  ...  Arrows denote flow of information.  ... 
doi:10.1007/978-3-540-92995-6_5 fatcat:fpd2ello2jgbnglvk5bqtufg3i

The Coq Proof Assistant, Version 8.7.1 [article]

The Coq Development Team
2017 Zenodo  
Version 8.7.1 brings compatibility with OCaml 4.06.0, many bug fixes, documentation improvements, and user message improvements.  ...  Feedback and bug reports are extremely welcome. This is the second release of Coq developed on a time-based development cycle.  ...  Acknowledgments The authors would like to thank Frédéric Blanqui, François Pottier and Laurence Rideau for their comments and suggestions.  ... 
doi:10.5281/zenodo.1133970 fatcat:r426i2vxujfqviuefbs5ytsnfu

Noise*: A Library of Verified High-Performance Secure Channel Protocol Implementations (Long Version) [article]

Son Ho, Jonathan Protzenko, Abhishek Bichhawat, Karthikeyan Bhargavan
2022 IACR Cryptology ePrint Archive  
We evaluate our framework by generating implementations for all 59 Noise protocols and by comparing the size, performance, and security of our verified code against other (unverified) implementations and  ...  The Noise protocol framework defines a succinct notation and execution framework for a large class of 59+ secure channel protocols, some of which are used in popular applications such as WhatsApp and WireGuard  ...  are as follows: Level Authentication Predicate (over i, idx, and l) A0 ⊤ A1 can flow i (CanRead [P idx.p; P idx.peer]) l A2 can flow i (CanRead [S idx.p idx.sid; P idx.peer]) l Fig. 7 . 7 Fig. 7.  ... 
dblp:journals/iacr/HoPBB22 fatcat:tgbtigsjmzdunbnwx4vlhmumvq

La dimensión expresiva del habla interna

Pablo Fossa
2017 Psicologia USP  
Vygotsky: problem solving and thought control.  ...  Based on this point of view, inner language would not only fulfill the function of problem solving and control of thought, but it would also serve as an expressive function.  ... 
doi:10.1590/0103-656420160118 fatcat:f4q3a6eisbc4vagxrytso5xrwq

Resources, Concurrency and Local Reasoning [chapter]

Peter W. O'Hearn
2004 Lecture Notes in Computer Science  
The influence of John Reynolds on this and all of my work is plain to see, and it is a special honour to be able to dedicate this paper to him. John has always stressed how  ...  For instance, because the assertions use -, -they do not track the flow of the values a and b from the left to the right process.  ...  They thus do not affect the flow of control, and are auxiliary variables in the sense of [39] . Further, neither the pre nor postcondition of prog' mentions start or finish.  ... 
doi:10.1007/978-3-540-28644-8_4 fatcat:yygafqcp25bgdbshyylxowh35i
« Previous Showing results 1 — 15 out of 3,535 results