Filters








242 Hits in 2.8 sec

Angelic Verification: Precise Verification Modulo Unknowns [chapter]

Ankush Das, Shuvendu K. Lahiri, Akash Lal, Yi Li
2015 Lecture Notes in Computer Science  
We propose a technique called angelic verification for verification of open programs, where we constrain a verifier to report warnings only when no acceptable environment specification exists to prove  ...  Our framework is parametric in a vocabulary and a set of angelic assertions that allows a user to configure the tool.  ...  Conclusions We presented the angelic verification framework that constrains a verifier to search for warnings that cannot be precluded with acceptable specifications over unknowns from the environment.  ... 
doi:10.1007/978-3-319-21690-4_19 fatcat:fnimbxod6vhz7julviumowgh2a

Automatic formal verification of DSP software

David W. Currie, Alan J. Hu, Sreeranga Rajan
2000 Proceedings of the 37th conference on Design automation - DAC '00  
We tested our tool on code samples taken from a real application program and discovered several previously unknown bugs automatically. Runtime and memory requirements were reasonable on all examples.  ...  This paper describes a novel formal verification approach for equivalence checking of small, assembly-language routines for digital signal processors (DSP).  ...  We ignore rounding and precision.  ... 
doi:10.1145/337292.337339 dblp:conf/dac/CurrieHR00 fatcat:grohhw4vkrgqrj6yvg7cw5ei6q

Automating Deductive Verification for Weak-Memory Programs [article]

Alexander J. Summers, Peter Müller
2018 arXiv   pre-print
In this paper, we provide the first implementation of a weak memory program logic using existing deductive verification tools.  ...  The first program logics for the verification of such programs have recently been proposed, but their usage has been limited thus far to manual proofs.  ...  well as modulo and bitwise arithmetic), and we were able to plug such reasoning in simply.  ... 
arXiv:1703.06368v2 fatcat:2mbhvsaotzbk7bdjurrjbqk6km

Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions [article]

Emanuele D'Osualdo, Felix Stutz
2020 arXiv   pre-print
We develop a theory of decidable inductive invariants for an infinite-state variant of the Applied pi-calculus, with applications to automatic verification of stateful cryptographic protocols with unbounded  ...  Then the relation AC := ( ∼ =AC • ) is terminating, and confluent modulo ∼ =AC.  ...  Intuitively, modulo derivability, two processes P ≡ kn Q are indistinguishable to the intruder and to the principals.  ... 
arXiv:1911.05430v2 fatcat:qjafaoupizeu5ioorgvdxfwsne

Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions

Emanuele D'Osualdo, Felix Stutz, Laura Kovács, Igor Konnov
2020 International Conference on Concurrency Theory  
We develop a theory of decidable inductive invariants for an infinite-state variant of the Applied πcalc, with applications to automatic verification of stateful cryptographic protocols with unbounded  ...  Then the relation AC := ( ∼ =AC • ) is terminating, and confluent modulo ∼ =AC.  ...  Intuitively, modulo derivability, two processes P ≡ kn Q are indistinguishable to the intruder and to the principals.  ... 
doi:10.4230/lipics.concur.2020.31 dblp:conf/concur/DOsualdoS20 fatcat:7fznao3pvnemxmylldz6uam6wm

On sums of squares of primes II [article]

Glyn Harman, Angel Kumchev
2009 arXiv   pre-print
To be precise, we assume that ρ j satisfy the following two hypotheses: (i) Let A, B > 0 be fixed, let χ be a non-principal character modulo q, q ≤ L B , and let I ′ be a subinterval of I.  ...  To be precise, let ρ 1 (m) be the characteristic function of the set of primes.  ... 
arXiv:0902.4190v1 fatcat:l44qt2frb5cs7nmyib3tyxqxcu

On sums of squares of primes II

Glyn Harman, Angel Kumchev
2010 Journal of Number Theory  
To be precise, we assume that ρ j satisfy the following two hypotheses: (i) Let A, B > 0 be fixed, let χ be a non-principal character modulo q, q L B , and let I be a subin- terval of I.  ...  To be precise, let ρ 1 (m) be the characteristic function of the set of primes.  ...  The number of overlaps is thus (q, d 2 ) as a runs through the reduced residues modulo q. Now, since (q, d) P σ and q < P 2σ , we must have (q, d 2 ) = (q, d). This value is either d or  ... 
doi:10.1016/j.jnt.2010.03.010 fatcat:5rr3taljafh25p43wra525l2di

Bounded Abstract Interpretation [chapter]

Maria Christakis, Valentin Wüstholz
2016 Lecture Notes in Computer Science  
When all resources are exhausted, our technique soundly records the achieved verification results with a program instrumentation.  ...  Angelic verification.  ...  Work on differential static analysis [1] and verification modulo versions [26] suppresses warnings based on another program or program version.  ... 
doi:10.1007/978-3-662-53413-7_6 fatcat:26tfergczjdglomcdk6xqvis3m

Continuous Reasoning

Peter W. O'Hearn
2018 Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18  
Angelic reasoning [27] , as about *goo() above, helps avoid spamming developers with reports about unknown code. While useful, it is not always the right solution.  ...  Blanket angelic or demonic assumptions about unknown code can be useful for making engineering compromises, but neither provides a general solution to the problem of compositional reasoning about code  ... 
doi:10.1145/3209108.3209109 dblp:conf/lics/OHearn18 fatcat:i7ig3p6kirhktnma7km2ixyteu

From Infinity to Choreographies: Extraction for Unbounded Systems [article]

Bjørn Angel Kjær and Luís Cruz-Filipe and Fabrizio Montesi
2022 arXiv   pre-print
In this work, we show how to extract choreographies from system descriptions where the total number of participants is unknown and unbounded, due to the ability of spawning new processes at runtime.  ...  More recently, such languages have also been used for programming and verification, e.g., as in choreographic programming [12] and multiparty session types [6] respectively.  ...  An analysis of the rules for both choreography and network semantics shows that necessarily the resulting state and connection graph must be precisely σ and G , respectively.  ... 
arXiv:2207.08884v1 fatcat:tmjab5ao45alfhesqetq4pc2ca

Parameter Synthesis for Markov Models [article]

Sebastian Junges, Erika Abraham, Christian Hensel, Nils Jansen, Joost-Pieter Katoen, Tim Quatmann, Matthias Volk
2019 arXiv   pre-print
53.47 PLA unknown 0.01 SF unknown TO [0.35, 0.50] ETR reject 23.41 PLA reject 0.00 SF unknown TO [0.54, 0.55] ETR reject 22.35 PLA reject 0.01 SF unknown TO [0.80, 0.90]  ...  result time 11 5 [0.20, 0.27] ETR inconsistent 12,11 PLA unknown 0.01 SF unknown TO [0.27, 0.28] ETR reject 20.68 PLA reject 0.01 SF unknown TO [0.28, 0.35] ETR reject  ... 
arXiv:1903.07993v1 fatcat:nfxcd5lt7jbdni4ika72fnjgme

Deduction Beyond Satisfiability (Dagstuhl Seminar 19371)

Carsten Fuhs, Philipp Rümmer, Renate Schmidt, Cesare Tinelli, Michael Wagner
2020 Dagstuhl Reports  
Such problems arise in a variety of applications including the analysis of probabilistic systems (where properties like safety or liveness can be established only probabilistically), network verification  ...  Satisfiability Modulo Theories (SMT) solvers are successfully used for various applications, notably in verification platforms and as back-ends for interactive theorem provers.  ...  a satisfiability problem for CHC modulo theories of arithmetic and arrays.  ... 
doi:10.4230/dagrep.9.9.23 dblp:journals/dagstuhl-reports/FuhsRST19 fatcat:j6moci5zgvgjzgpsqblemwsrlm

Adaptive Verifiable Coded Computing: Towards Fast, Secure and Private Distributed Machine Learning [article]

Tingting Tang, Ramy E. Ali, Hanieh Hashemi, Tynan Gangwani, Salman Avestimehr, Murali Annavaram
2022 arXiv   pre-print
Since it is unknown which node may be a straggler a approach (LCC).  ...  , USA Los Angeles, USA Los Angeles, USA tangting@usc.edu reali@usc.edu  ... 
arXiv:2107.12958v2 fatcat:f4zr6cymjray3mwdcin2dsyqoi

Maximal specification synthesis

Aws Albarghouthi, Isil Dillig, Arie Gurfinkel
2016 Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL 2016  
Many problems in program analysis, verification, and synthesis require inferring specifications of unknown procedures.  ...  Motivated by a broad range of applications, we formulate the problem of maximal specification inference: Given a postcondition ϕ and a program P calling a set of unknown procedures F1, . . . , Fn, what  ...  Work on angelic verification [20, 27] aims to find reasonable environment assumptions in order to suppress "stupid" false alarms. In the recent paper by Das et al.  ... 
doi:10.1145/2837614.2837628 dblp:conf/popl/AlbarghouthiDG16 fatcat:5fzfvkyujrbvbpugk4jzb6hdnq

Software Verification by Combining Program Analyses of Adjustable Precision

Grégory Théoduloz
2010
I would also like to thank Rupak who hosted me for three months in Los Angeles. A special note must be made about my officemate and friend Maria.  ...  Deuxièmement, nous avons amélioré notre cadre général et son algorithme de vérification de manière à permettre l'ajustement dynamique de la précision de l'analyse en fonction des résultats accumulés.  ...  A symbol in a box represents an unknown value.  ... 
doi:10.5075/epfl-thesis-4781 fatcat:f2hwbcnqzzhchd24dttwdkm6fm
« Previous Showing results 1 — 15 out of 242 results