Filters








91,426 Hits in 4.4 sec

Optimizing Code Generation from SSA Form: A Comparison Between Two Formal Correctness Proofs in Isabelle/HOL

Jan Olaf Blech, Sabine Glesner, Johannes Leitner, Steffen Mülling
2005 Electronical Notes in Theoretical Computer Science  
Our comparison between the two proofs shows that it is very important to find adequate formalizations in formal proofs since they can simplify the verification task considerably.  ...  In this paper, we present two approaches for the formalization of static single assignment (SSA) form together with two corresponding formal proofs in the Isabelle/HOL system, each showing the correctness  ...  By building up our proof on this general principle we will be able to reuse our proof for the verification of further transformations involving data flow dependencies.  ... 
doi:10.1016/j.entcs.2005.02.042 fatcat:ajtgyipdargs7bpdnympjmoi6a

Formal Characterization of Illegal Control Flow in Android System

Mariem Graa, Nora Cuppens-Boulahia, Frederic Cuppens, Ana Cavalli
2013 2013 International Conference on Signal-Image Technology & Internet-Based Systems  
Also, we provide a correct and complete algorithm based on these rules to solve the under-tainting problem.  ...  The dynamic taint analysis mechanism is used to protect sensitive data in the Android system. But this technique does not detect control flows which can cause an under-tainting problem.  ...  Fenton [31] proposed a Data Mark Machine, an abstract model, to handle control flows.  ... 
doi:10.1109/sitis.2013.56 dblp:conf/sitis/GraaCCC13 fatcat:pr2buvshpndjdawurb6odgsrei

Distributed Consistent Network Updates in SDNs: Local Verification for Global Guarantees [article]

Klaus-Tycho Foerster, Stefan Schmid
2019 arXiv   pre-print
In particular, our approach leverages concepts from local proof labeling systems, which allows the data plane elements to locally check network properties, and we show that this is sufficient to obtain  ...  This paper initiates the study of a more distributed approach, in which the consistent network updates are implemented by the switches and routers directly in the data plane.  ...  This paper presented a distributed approach, based on proof labeling systems, which allows to offload the responsibility for network reconfigurations to the data plane and hence support and speed up such  ... 
arXiv:1908.10086v1 fatcat:npvn3ssr45alfddxlakzwjy7g4

ALITHEIA

Yupeng Zhang, Charalampos Papamanthou, Jonathan Katz
2014 Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security - CCS '14  
Such an approach will incur large overhead, especially in the proof-computation time.  ...  We consider a scenario in which a data owner outsources storage of a large graph to an untrusted server; the server performs computations on this graph in response to queries from a client (whether the  ...  Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon. We thank Roberto Tamassia for useful discussions.  ... 
doi:10.1145/2660267.2660354 dblp:conf/ccs/ZhangPK14 fatcat:nrpunkrdabhoxe3luydt4a4dfu

The KeY Platform for Verification and Analysis of Java Programs [chapter]

Wolfgang Ahrendt, Bernhard Beckert, Daniel Bruns, Richard Bubel, Christoph Gladisch, Sarah Grebing, Reiner Hähnle, Martin Hentschel, Mihai Herda, Vladimir Klebanov, Wojciech Mostowski, Christoph Scheben (+2 others)
2014 Lecture Notes in Computer Science  
But the approach is general enough to provide a basis for other methods and purposes: (i) complementary validation techniques to formal verification such as testing and debugging, (ii) methods that reduce  ...  We use the current release of the KeY system as an example to explain and prove this claim.  ...  A right click on the proof tree or a node in it produces a context menu with possible actions on proof trees.  ... 
doi:10.1007/978-3-319-12154-3_4 fatcat:3eunuqfaxzhdvg6xcr5muxx2sq

Lightweight authentication of freshness in outsourced key-value stores

Yuzhe Tang, Ting Wang, Ling Liu, Xin Hu, Jiyong Jang
2014 Proceedings of the 30th Annual Computer Security Applications Conference on - ACSAC '14  
For data owners and end users that have limited computing power, INCBM-TREE can be a practical solution to authenticate the freshness of outsourced data while reaping the benefits of broadly available  ...  We detail this problem and propose INCBM-TREE, a novel construct delivering freshness and authenticity.  ...  Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon.  ... 
doi:10.1145/2664243.2664244 dblp:conf/acsac/TangWLHJ14 fatcat:5odbya52tbbd3cfe3aakrzyfli

Hybrid network-erasure coding protection of multi-source, multi-sink multicast sessions in WSNs

Suhas Shetty, Ahmed E. Kamal
2012 2012 IEEE Global Communications Conference (GLOBECOM)  
., sensors, and delivering data to a pre-defined set of destinations, e.g., sinks.  ...  We propose an algorithm that combines network and erasure coding to provide resilience against a predefined number of link failures.  ...  of proof: Part (a) of the theorem states that the disjoint flow from a source to a destination can share links with a disjoint flow going from the same source to any other destination, but cannot share  ... 
doi:10.1109/glocom.2012.6503102 dblp:conf/globecom/ShettyK12 fatcat:32fttjnkunelhgskbpsmc4ltiy

Maximum Covering Subtrees for Phylogenetic Networks [article]

Nathan Davidov, Amanda Hernandez, Justin Jian, Patrick McKenna, K.A. Medlin, Roadra Mojumder, Megan Owen, Andrew Quijano, Amanda Rodriguez, Katherine St. John, Katherine Thai, Meliza Uraga
2020 arXiv   pre-print
We show that finding a phylogenetic tree covering the maximum number of nodes in a phylogenetic network can be be computed in polynomial time via an encoding into a minimum-cost maximum flow problem.  ...  We answer an open question of Francis, Semple, and Steel about the complexity of determining how far a phylogenetic network is from being tree-based, including non-binary phylogenetic networks.  ...  This work was funded by a Research Experience for Undergraduates (REU) grant from the U.S. National Science Foundation (#1461094 to St. John and Owen). Owen and St.  ... 
arXiv:2009.12413v2 fatcat:74rlqlhorffqrbliecaqeldn7m

Structural Encoding of Static Single Assignment Form

Andreas Gal, Christian W. Probst, Michael Franz
2005 Electronical Notes in Theoretical Computer Science  
We propose a novel approach to transport SSA information implicitly through structural code properties of standard Java bytecode.  ...  SSA-based mobile code transport formats have been shown to eliminate this cost by shifting SSA creation to the code producer.  ...  While multiple approaches exist to compute the dominator tree efficiently from a control-flow graph [12, 3, 4] , our approach uses the fact that the code producer either already has the dominator tree  ... 
doi:10.1016/j.entcs.2005.02.045 fatcat:lbmcfeud6fbo3nwd6jefxvmfei

Enhancement of Power System State Estimation [chapter]

Bei Gou, Weibiao Wu
2011 Energy Technology and Management  
Proof: Let us assume all the measurements are perfect except a gross error in a flow measurement km S (see Fig. 1 for the explanation) that is included in a solving tree l . km S is a measurement connecting  ...  Theorem 2: If a bad data appears in a measurement of a solving tree, then all the recovered power flows corresponding to the redundant measurements of this measurement contain a gross error.  ...  How to reference In order to correctly reference this scholarly work, feel free to copy and paste the following: Bei Gou and Weibiao Wu (2011) .  ... 
doi:10.5772/17965 fatcat:qd2u4qn7hbbufe3gqm7k4todhy

An optimal graph theoretic approach to data clustering: theory and its application to image segmentation

Z. Wu, R. Leahy
1993 IEEE Transactions on Pattern Analysis and Machine Intelligence  
A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated.  ...  For graphs of moderate size (-2000 vertices), the optimal solution is obtained through partitioning a flow and cut equivalent tree of 6, which can be efficiently constructed using the Gomory-Hu algorithm  ...  An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation Zhenyu Wu and Richard Leahy Abstract-A novel graph theoretic approach for data clustering is presented  ... 
doi:10.1109/34.244673 fatcat:eisqkbw7vbfmhc6wje326zlsga

Scalable Automated Verification via Expert-System Guided Transformations [chapter]

Hari Mony, Jason Baumgartner, Viresh Paruthi, Robert Kanzelman, Andreas Kuehlmann
2004 Lecture Notes in Computer Science  
flow differs widely from problem to problem.  ...  Transformation-based verification has been proposed to synergistically leverage various transformations to successively simplify and decompose large problems to ones which may be formally discharged.  ...  Acknowledgements The authors would like to thank Geert Janssen, Mark Williams, and Jessie Xu for their contributions to numerous aspects of the TBV system, as well as for insights into the integration  ... 
doi:10.1007/978-3-540-30494-4_12 fatcat:sta3akt35vdlvpiz32iafsn6v4

A Fast Verified Liveness Analysis in SSA Form [chapter]

Jean-Christophe Léchenet, Sandrine Blazy, David Pichardie
2020 Lecture Notes in Computer Science  
We also compare experimentally this approach on CompCert's benchmarks with respect to the classic data-flow-based liveness analysis, and observe performance gains.  ...  We formalize their approach in the Coq proof assistant, inside the CompCertSSA verified C compiler.  ...  This work is supported by a European Research Council (ERC) Consolidator Grant for the project "VESTA", funded under the European Union's Horizon 2020 Framework Programme (grant agreement no. 772568).  ... 
doi:10.1007/978-3-030-51054-1_19 fatcat:yclphtixrrfsjfceh55z42cstm

Distributed Throughput Optimization for ZigBee Cluster-Tree Networks

Yu-Kai Huang, Ai-Chun Pang, Pi-Cheng Hsiu, Weihua Zhuang, Pangfeng Liu
2012 IEEE Transactions on Parallel and Distributed Systems  
Note that flow represents bandwidth rather than data packets. There is no intention to send data packets back and forth.  ...  To optimize the throughput in the framework, we model the process as a vertex-constraint maximum flow problem, and develop a distributed algorithm that is fully compatible with the ZigBee standard.  ...  To resolve such problems, we propose an adoptive-parent-based framework for a ZigBee cluster-tree network.  ... 
doi:10.1109/tpds.2011.192 fatcat:l5stdhi465hmlac2eo3xl5iy7q

Page 1299 of Mathematical Reviews Vol. , Issue 2002B [page]

2002 Mathematical Reviews  
programs during proof.  ...  The proof embodies a way of understanding polyvariant flow information in terms of union and intersection types, and, conversely, a way of understanding union and intersection types in terms of polyvariant  ... 
« Previous Showing results 1 — 15 out of 91,426 results