104,798 Hits in 1.8 sec

Using History Invariants to Verify Observers [chapter]

K. Rustan M. Leino, Wolfram Schulte
2007 Lecture Notes in Computer Science  
The technique enables a flexible new way to specify and verify variations of the observer pattern, including iterators.  ...  The technique uses history invariants, two-state invariants that describe the evolution of data values.  ...  We are grateful to the anonymous referees for their thoughtful and helpful suggestions.  ... 
doi:10.1007/978-3-540-71316-6_7 fatcat:wdyzctvkgbbpzlvsnwyc7jjp7y

Verifying Isolation Properties in the Presence of Middleboxes [article]

Aurojit Panda, Ori Lahav, Katerina Argyraki, Mooly Sagiv, Scott Shenker
2014 arXiv   pre-print
We explore how to verify isolation properties in networks that include such "dynamic datapath" elements using model checking.  ...  While the straightforward application of model checking to this problem can only handle very small networks (if at all), our approach can verify simple realistic invariants on networks containing 30,000  ...  We use our system to verify the following node-isolation and flow-isolation invariants: 1.  ... 
arXiv:1409.7687v1 fatcat:faurdbpqora75gd4xswm5hrm7i

Formal Specification and Verification of CRDTs [chapter]

Peter Zeller, Annette Bieniusa, Arnd Poetzsch-Heffter
2014 Lecture Notes in Computer Science  
We show how CRDT implementations can be expressed in our framework and present a general strategy for verifying CRDTs.  ...  Finally, we report on our experiences in using the framework for the verification of important existing CRDT implementations.  ...  When using this strategy, one has to provide an invariant between the payloads and the visible update history.  ... 
doi:10.1007/978-3-662-43613-4_3 fatcat:yfax5f2ytja5tkvz5d7necueam

Flexible Invariants through Semantic Collaboration [chapter]

Nadia Polikarpova, Julian Tschannen, Carlo A. Furia, Bertrand Meyer
2014 Lecture Notes in Computer Science  
The methodology is implemented in AutoProof, our program verifier for the Eiffel programming language (but it is applicable to any language supporting some form of representation invariants).  ...  Combined with a simple ownership mechanism and useful default schemes, semantic collaboration achieves the flexibility necessary to reason about complicated inter-object dependencies but requires limited  ...  Future Work In an ongoing effort, we have been using SC to verify a realistic data structure library.  ... 
doi:10.1007/978-3-319-06410-9_35 fatcat:7jol3rldibggdgnwagj5vjtoii

Towards Scalable Verification of Deep Reinforcement Learning [article]

Guy Amir, Michael Schapira, Guy Katz
2021 arXiv   pre-print
to verify due to the scalability barriers of prior approaches.  ...  To demonstrate the benefits of whiRL 2.0, we apply it to case studies from the communication networks domain that have recently been used to motivate formal verification of DRL systems, and which exhibit  ...  We thank Nathan Jay, Tomer Eliyahu and the anonymous reviewers for their contributions to this project.  ... 
arXiv:2105.11931v2 fatcat:whbvemzqjnckfd6tjalefev5hu

Search for compositeness at LHC

S Ferrag
2008 Journal of Physics, Conference Series  
. excess at high mass • Angular distribution for a high invariant mass bin (excess zone) • Less sensitive to Calorimeter non linearity • Λ = 3 5 10 TeV might be ruled out or verified with first tens of  ...  Introduction Introduction • History of particle physics is filled with discovery f b t t of sub-structures: -Search for quark/lepton substructure: -Composite particles: leptoquarks, excited quarks/leptons  ...  , 2%, 1.4%, ~5-10% and 4-5% • Combined uncertainties: 2.5% experimental and 11% theory (mature detector) Conclusion Conclusion Co c us o Co c us o • Contact interactions are generally observed before  ... 
doi:10.1088/1742-6596/110/7/072010 fatcat:mjg2yjh3sbdttddl5dz5dzmqs4

A verified messaging system

William Mansky, Andrew W. Appel, Aleksey Nogin
2017 Proceedings of the ACM on Programming Languages  
We prove the correctness of the system with valid participants by formally verifying a C implementation of the system in Coq, using the Verified Software Toolchain extended with an atomic exchange operation  ...  For this reason, it should be possible to relax the memory order to acq_rel mode.  ...  The client wants to provide some precondition P and receive some useful result Q, predicated on the client's observed partial history h c and new value v new .  ... 
doi:10.1145/3133911 dblp:journals/pacmpl/ManskyAN17 fatcat:i5lx6rcz4vhxne67pdqc63eqfq

An assertional criterion for atomicity

Wim H. Hesselink
2002 Acta Informatica  
In both cases, the proof comes down to the verification of a number of invariants. The hand-written proofs of these invariants have been verified with a mechanical theorem prover.  ...  A criterion is presented to prove atomicity of read-write objects by means of ghost variables and invariants.  ...  Verification We use the same method as for Bloom's algorithm to verify preservation of the invariants.  ... 
doi:10.1007/s002360200080 fatcat:z67ldxhgi5e23pvev3jq25gfzq

Teaching Computational Reasoning Through Construals
Обучение вычислительному мышлению используя интерпретации (Construals)

Errol Thompson, Aston University, Birmingham, UK
2018 Obrazovanie i Samorazvitie  
We also seek to explore what should be observable and how this impacts the variations that we should use to explore a phenomenon such as computational reasoning.  ...  can construals be used to teach computational reasoning?  ...  It also provides the opportunity to observe the predic state, and the ability to view the history. To encourage the invariant rule, it has the capability for the learner to create a f stones to take.  ... 
doi:10.26907/esd13.3.05 fatcat:pki2jwglsnhp7lvj5lwmxvg3pa

Verifying Concurrent Multicopy Search Structures [article]

Nisarg Patel, Siddharth Krishna, Dennis Shasha, Thomas Wies
2021 arXiv   pre-print
We also instantiate the LSM template to obtain the first verified concurrent in-memory LSM tree implementation.  ...  A search on k aims to return the value associated with the most recent upsert.  ...  We also extend our gratitude to the anonymous reviewers of OOPSLA'21 whose questions helped us clarify the presentation.  ... 
arXiv:2109.05631v1 fatcat:tpoajhflyzagnid7cmbnjmmpnm

Hoare-style Specifications as Correctness Conditions for Non-linearizable Concurrent Objects [article]

Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee, German Andres Delbianco
2016 arXiv   pre-print
Through a series of case studies, we demonstrate how an existing program logic for concurrency can be employed off-the-shelf to capture important state and history invariants, allowing one to explicitly  ...  However, the variety of alternative correctness conditions makes it difficult to choose which one to employ in a particular case, and to compose them when using objects whose behaviors are specified via  ...  Hoarestyle program logics were used with great success to verify a number of concurrent data structures and algorithms, which are much more natural to specify in terms of observable state modifications  ... 
arXiv:1509.06220v3 fatcat:k6l3xrur35cd7iewyk6kln4oue

Inferring annotations for device drivers from verification histories

Zvonimir Pavlinovic, Akash Lal, Rahul Sharma
2016 Proceedings of the 31st IEEE/ACM International Conference on Automated Software Engineering - ASE 2016  
We present an approach that infers program annotations automatically by leveraging the history of verifying related programs.  ...  We present a case study where we applied our algorithm to Microsoft's Static Driver Verifier (SDV).  ...  The authors would like to thank Zilong Wang and Subhajit Roy for their help during initial development of the ideas presented in this paper, and Kenneth McMillan for his help with using the Duality verification  ... 
doi:10.1145/2970276.2970305 dblp:conf/kbse/PavlinovicLS16 fatcat:eegv6kusrzbfhjujotd53albwm

Model-Checking Secure Information Flow for Multi-threaded Programs [chapter]

Marieke Huisman, Henri-Charles Blondeel
2012 Lecture Notes in Computer Science  
This paper shows how secure information flow properties of multi-threaded programs can be verified by model checking in a precise and efficient way, by using the idea of self-composition.  ...  We discuss this encoding, and use it for some practical experiments on several simple examples.  ...  We thank Ngo Minh Tri and the anonymous reviewers for their useful feedback on earlier versions of this paper.  ... 
doi:10.1007/978-3-642-27375-9_9 fatcat:ocxugjgbhvdftkrlvf2s5d3chy

Hippocratic binary instrumentation: First do no harm

Meera Sridhar, Richard Wartell, Kevin W. Hamlen
2014 Science of Computer Programming  
This paper shows how recent approaches for machine-verifying the policycompliance (soundness) of IRMs can be extended to also formally verify IRM preservation of policy-compliant behaviors (transparency  ...  The framework is applied to enforce security policies for Adobe Flash web advertisements and automatically verify that their policy-compliant behaviors are preserved.  ...  We observe that a similar strategy suffices to generate invariants that prove transparency for these IRMs.  ... 
doi:10.1016/j.scico.2014.02.024 fatcat:tdrsx7wurrgwln5un43axr6wly

Observable behavior of distributed systems: Component reasoning for concurrent objects

Crystal Chang Din, Johan Dovland, Einar Broch Johnsen, Olaf Owe
2012 The Journal of Logic and Algebraic Programming  
In this paper, a proof system for partial correctness reasoning is established based on communication histories and class invariants.  ...  The soundness and relative completeness of this proof system are shown using a transformational approach from a sequential language with a non-deterministic assignment operator.  ...  To observe and reason about object creation using histories, we let the history reveal relevant information about object creation.  ... 
doi:10.1016/j.jlap.2012.01.003 fatcat:wbgg34uasbag3gx4k527oagf4y
« Previous Showing results 1 — 15 out of 104,798 results