Internet Archive Scholar
Filters
























243,743 Hits in 3.9 sec

Plotting in a Formally Verified Way

Guillaume Melquiond
2021 Electronic Proceedings in Theoretical Computer Science  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (204.1 kB)
https://web.archive.org/web/20210812055634/https://arxiv.org/pdf/2108.03974v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL. The file type is application/pdf.

Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:

2021 pre-print arXiv:2108.03974v1 fatcat:dkolllvv5zf5bjz3h7qfkoma74
This paper investigates what it means for a plot to be correct and how to formally verify this property.  ...  The Coq proof assistant is then turned into a tool for plotting function graphs using reliable polynomial approximations. This feature is provided as part of the CoqInterval library.  ...  We also have a theorem formally verified in Coq that states (plot2 f ox ... ). So, only interface issues remain. First, let us deal with the plot display.  ... 
doi:10.4204/eptcs.338.6 fatcat:bqejx6ey6nafhpdwce565472na
DOAJ Multiple Versions
Citation

Guillaume Melquiond. "Plotting in a Formally Verified Way." Electronic Proceedings in Theoretical Computer Science (2021) 39-45

Visualization of Temporal Logic Specifications [article]

James Scott-Brown, Antonis Papachristodoulou
2017 Eurographics Conference on Visualization  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (304.2 kB)
https://web.archive.org/web/20220121033009/https://diglib.eg.org/xmlui/bitstream/handle/10.2312/eurp20171183/117-119.pdf;jsessionid=D241567B741B9DF6DEDCD32D445870CF?sequence=1

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL. The file type is application/pdf.

The desired behaviour of a system can be formally specified using a temporal logic, and used to check whether a candidate design meets this specification, or to automatically design a system that does.  ...  Such techniques are in principle applicable to a wide range of types of systems, but their current extent of use does not fulfill their potential.  ...  Introduction The process of model checking verifies whether a model of a system satisfies a formal specification [Bai08] .  ... 
doi:10.2312/eurp.20171183 dblp:conf/vissym/Scott-BrownP17 fatcat:r5yjn7gsp5fxljfdauwnjsf7qq
Citation

James Scott-Brown, Antonis Papachristodoulou. "Visualization of Temporal Logic Specifications." Eurographics Conference on Visualization (2017) 117-119

Career Stages and Attitudes to Skills Development Process in Poland

Alicja Grześkowiak
2015 Mediterranean Journal of Social Sciences  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (328.3 kB)
https://web.archive.org/web/20170923011817/http://www.mcser.org/journal/index.php/mjss/article/download/6157/5902

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

A hypothesis is verified that the educational patterns are different at various stages of the career development.  ...  The analyses are carried out on the basis of the microdata provided by a Polish nationwide survey on human capital conducted in 2013.  ...  This research was financed by Narodowe Centrum Nauki (National Science Centre) in Poland under the project entitled "Non-metric multivariate data analysis as a tool for study of adults situation in the  ... 
doi:10.5901/mjss.2015.v6n2s5p37 fatcat:pv2qnira3jhtjds3nqgjjoi7ye
DOAJ OJS Szczepanski
Citation

Alicja Grześkowiak. "Career Stages and Attitudes to Skills Development Process in Poland." Mediterranean Journal of Social Sciences (2015)

Page 608 of American Society of Civil Engineers. Collected Journals Vol. 109, Issue 4 [page]

1983 American Society of Civil Engineers. Collected Journals  

Preserved Fulltext

fulltext thumbnail
Digitized Microfilm
https://archive.org/details/sim_american-society-of-civil-engineers-collected-journals_1983-07_109_4/page/608

The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.

—Although a formal evaluation of the cumulative de- gree of curve approach could not be made, attempts were made to as- sess this technique as a tool for identifying problem downgrades.  ...  To verify this idea, an additional analysis was under- taken. Collision diagrams were plotted for all 15 downgrades.  ... 
Citation

American Society of Civil Engineers. Collected Journals 109.4 (1983) 608

Some Experimental Results on Randomly Generating Formal Contexts

Daniel Borchmann, Tom Hanika
2016 International Conference on Concept Lattices and their Applications  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (18.8 MB)
https://web.archive.org/web/20220307175212/http://ceur-ws.org/Vol-1624/paper5.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL. The file type is application/pdf.

In doing so, we additionally show that the previously observed phenomenon of the "Stegosaurus" does not express a real correlation between intents and pseudo-intents, but is an artifact of the way random  ...  We investigate different simple approaches to generate random formal contexts. To this end, we consider for each approach the empirical correlation between the number of intents and pseudo-intents.  ...  Therefore, uniformly choosing a formal contexts does not mean to choose a closure system in a uniform way.  ... 
dblp:conf/cla/BorchmannH16 fatcat:xcpxcmk53nd33ijzpbgbxnu77a
Citation

Daniel Borchmann, Tom Hanika. "Some Experimental Results on Randomly Generating Formal Contexts." International Conference on Concept Lattices and their Applications (2016) 57-69

Analog layer extensions for analog/mixed-signal assertion languages

Dogan Ulus, Alper Sen, Faik Baskaya
2013 2013 IFIP/IEEE 21st International Conference on Very Large Scale Integration (VLSI-SoC)  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (412.3 kB)
https://web.archive.org/web/20170809000058/https://www.cmpe.boun.edu.tr/~sen/publications/vlsi-soc13.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

We first describe the concept of haloes, an implicit way to handle tolerance values of analog signals in assertions.  ...  We validate our extensions using our prototype tool on a 10-bit two-stage pipelined analog-to-digital converter design.  ...  ACKNOWLEDGMENT This work was supported in part by Semiconductor Research Corporation under task 2082.001, Marie Curie European Reintegration Grant within the 7th European Community Framework Programme,  ... 
doi:10.1109/vlsi-soc.2013.6673252 dblp:conf/vlsi/UlusSB13 fatcat:6h5bptj2w5d4dmy5dvlm2j3usy
Citation

Dogan Ulus, Alper Sen, Faik Baskaya. "Analog layer extensions for analog/mixed-signal assertion languages." 2013 IFIP/IEEE 21st International Conference on Very Large Scale Integration (VLSI-SoC) (2013) 66-71

Scaling functions of two-neutron separation energies of20Cwith finite range potentials

M. A. Shalchi, M. R. Hadizadeh, M. T. Yamashita, Lauro Tomio, T. Frederico, C. Elster, D.R. Phillips, C.D. Roberts
2016 EPJ Web of Conferences  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (138.4 kB)
https://web.archive.org/web/20190427052609/https://www.epj-conferences.org/articles/epjconf/pdf/2016/08/epjconf_fb2016_06017.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL. The file type is application/pdf.

Other Versions

2015 pre-print
arXiv:1508.06258v1 fatcat:gfpff4otf5axlhzdmncm34myaa
The main objective is to study range corrections in a scaling approach, with focus in the exotic carbon halo nucleus ^20C.  ...  The behaviour of an Efimov excited state is studied within a three-body Faddeev formalism for a general neutron-neutron-core system, where neutron-core is bound and neutron-neutron is unbound, by considering  ...  In this way, we are able to obtain a scaling plot, which is conveniently given in dimensionless quantities, [5, 8] . above steps are repeated, with the zero-range interaction being replaced by a separable  ... 
doi:10.1051/epjconf/201611306017 fatcat:z3ypmonbonagrdq6z5gg3vvs24
DOAJ Multiple Versions
Citation

M. A. Shalchi, M. R. Hadizadeh, M. T. Yamashita, Lauro Tomio, T. Frederico, C. Elster, D.R. Phillips, C.D. Roberts. "Scaling functions of two-neutron separation energies of20Cwith finite range potentials." EPJ Web of Conferences (2016) 06017

Applications of real number theorem proving in PVS

Hanne Gottliebsen, Ruth Hardy, Olga Lightfoot, Ursula Martin
2012 Formal Aspects of Computing  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (879.1 kB)
https://web.archive.org/web/20171118053335/https://core.ac.uk/download/pdf/30317639.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

that builds on the capabilities of Maple and PVS to provide a verified and automatic analysis of Nichols plots.  ...  Machine verification aims to solve such problems by providing a formal proof, developed from axioms and rules of inference in a computational logic system.  ...  We are grateful to the referees for their insightful and encouraging comments, which have been of great help in shaping the paper, and to the editor for his patience.  ... 
doi:10.1007/s00165-012-0232-9 fatcat:cttlm47ehreezkk2ikywgwuixu
Citation

Hanne Gottliebsen, Ruth Hardy, Olga Lightfoot, Ursula Martin. "Applications of real number theorem proving in PVS." Formal Aspects of Computing 25.6 (2012) 993-1016

Towards formal proofs of feedback control theory

Omar A. Jasim, Sandor M. Veres
2017 2017 21st International Conference on System Theory, Control and Computing (ICSTCC)  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (235.3 kB)
https://web.archive.org/web/20180722104301/http://eprints.whiterose.ac.uk/130475/1/Paper.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL. The file type is application/pdf.

Other examples are statements on robust control performance in the face of dynamical uncertainties and disturbances in sensing and actuation.  ...  The paper gives an overview of the challenges of the area and illustrates them on a computer-based formal proof of the Small-gain theorem and conclusions are drawn from these initial experiences.  ...  This method carried out in the Nichols plot Requirements Verifier (NRV) to implement an automated formal Nichols plot analysis using computer algebra system (Maple) and PVS proof assistant in addition  ... 
doi:10.1109/icstcc.2017.8107009 fatcat:q4mfpuohkfeete525amndwjljq
Citation

Omar A. Jasim, Sandor M. Veres. "Towards formal proofs of feedback control theory." 2017 21st International Conference on System Theory, Control and Computing (ICSTCC) (2017)

A unified statistical approach to explain the transverse momentum spectra in hadron-hadron collision [article]

Rohit Gupta, Shubhangi Jain, Satyajit Jena
2021 arXiv   pre-print

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (283.9 kB)
https://web.archive.org/web/20210910002524/https://arxiv.org/pdf/2103.11185v2.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL. The file type is application/pdf.

Other Versions

2021 pre-print
arXiv:2103.11185v1 fatcat:45at4yv3ovdexlwanulyqrlyxu
This formalism has been proved to nicely explain the spectra of particles produced in soft processes as well hard scattering processes in a consistent manner.  ...  For this analysis, we have used the highest available range of p_T published by experiments to verify the applicability of Pearson statistical framework at large p_T.  ...  Therefore, a function with more free parameters may reveal the complexity of QCD processes in a generalised way.  ... 
arXiv:2103.11185v2 fatcat:zcljokcj3vhn7pfuccfzfwsf4q
Open Access Multiple Versions
Citation

Rohit Gupta, Shubhangi Jain, Satyajit Jena. "A unified statistical approach to explain the transverse momentum spectra in hadron-hadron collision." arXiv (2021)

Challenging the supremacy of traffic matrices in anomaly detection

Augustin Soule, Fernando Silveira, Haakon Ringberg, Christophe Diot
2007 Proceedings of the 7th ACM SIGCOMM conference on Internet measurement - IMC '07  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (374.9 kB)
https://web.archive.org/web/20170808131444/http://www.haakonringberg.com/work/papers/soule_imc_07.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

The most popular way to aggregate the traffic is as a Traffic Matrix, where the traffic is divided according to its ingress and egress points in the network.  ...  Each formalism is computed on data collected from two research backbones. Then, a network-wide anomaly detection method is applied to each formalism.  ...  Each plot shows the cumulative distribution functions for this metric over the time series in a given formalism. Ingress routers have the smallest flow variability among all formalisms.  ... 
doi:10.1145/1298306.1298320 dblp:conf/imc/SouleSRD07 fatcat:fae5je45pnc5plr4352o5asisy
Citation

Augustin Soule, Fernando Silveira, Haakon Ringberg, Christophe Diot. "Challenging the supremacy of traffic matrices in anomaly detection." Proceedings of the 7th ACM SIGCOMM conference on Internet measurement - IMC '07 (2007) 105-110

Probing Primordial Symmetry Breaking with Cosmic Microwave Background Anisotropy [article]

Jiwon Park, Tae Hoon Lee
2020 arXiv   pre-print

Preserved Fulltext

Web Archive Capture PDF (792.2 kB)
https://web.archive.org/web/20200326015505/https://arxiv.org/pdf/1908.04630v2.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

Other Versions

2019 pre-print
arXiv:1908.04630v1 fatcat:vbmzmi3a7rf5djux5wbvfifrke
2020 accepted
arXiv:1908.04630v3 fatcat:4vvaxvam25gvbofkd7c4qi6qoe
The first model is based on a broken symmetric theory of gravity, which was suggested by A. Zee in 1979. The second model is an application of Palatini formalism to the first model.  ...  This fact enables us to verify distinct kinds of primordial symmetry breaking with CMB physics.  ...  We presented new EM tensors (28) and (33) for the perturbation theories in each model, to show the way to verify the models with observation.  ... 
arXiv:1908.04630v2 fatcat:xhnvutsyajed7b2j53omljmfqa
Multiple Versions
Citation

Jiwon Park, Tae Hoon Lee. "Probing Primordial Symmetry Breaking with Cosmic Microwave Background Anisotropy." arXiv (2020)

Quantitative Validation of Formal Domain Models

Alexei Iliasov, Alexander Romanovsky, Linas Laibinis
2019 2019 IEEE 19th International Symposium on High Assurance Systems Engineering (HASE)  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (527.4 kB)
https://web.archive.org/web/20200311041451/https://eprint.ncl.ac.uk/file_store/production/252922/701D2A8B-D287-4496-8E21-D97A6E15CF4D.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

Application of formal methods to verification of well-formedness and semantic correctness of data sets from a particular domain becomes increasingly practical with the advances in automated verification  ...  However, it is difficult for domain experts to understand and formulate formal verification constraints (VCs), yet much trust is invested in their validity and completeness.  ...  INTRODUCTION Formal verification offers a reliable and comprehensive way of checking validity of a program, a system, or a data set.  ... 
doi:10.1109/hase.2019.00013 dblp:conf/hase/IliasovRL19 fatcat:vzae62vmpvab7inv6hftopnc4u
Citation

Alexei Iliasov, Alexander Romanovsky, Linas Laibinis. "Quantitative Validation of Formal Domain Models." 2019 IEEE 19th International Symposium on High Assurance Systems Engineering (HASE) (2019) 17-24

PEREGRiNN: Penalized-Relaxation Greedy Neural Network Verifier [article]

Haitham Khedr, James Ferlez, Yasser Shoukry
2021 arXiv   pre-print

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (658.4 kB)
https://web.archive.org/web/20210421043234/https://arxiv.org/pdf/2006.10864v2.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL. The file type is application/pdf.

Other Versions

2020 pre-print
arXiv:2006.10864v1 fatcat:uk5zan7bzfgypc55kido2fiuda
However, unique in our approach is the way we use a convex solver not only as a linear feasibility checker, but also as a means of penalizing the amount of relaxation allowed in solutions.  ...  In this paper, we introduce a new approach to formally verify the most commonly considered safety specifications for ReLU NNs -- i.e. polytopic specifications on the input and output of the network.  ...  In this paper, we propose PEREGRiNN, an algorithm for efficiently and formally verifying the input/output behavior of ReLU NNs.  ... 
arXiv:2006.10864v2 fatcat:fpxkh5p62rg55jaym62haehgm4
Multiple Versions
Citation

Haitham Khedr, James Ferlez, Yasser Shoukry. "PEREGRiNN: Penalized-Relaxation Greedy Neural Network Verifier." arXiv (2021)

Semantic Web Identity of Academic Libraries

Kenning Arlitsch
2017 Journal of Library Administration  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (926.4 kB)
https://web.archive.org/web/20200309162817/https://scholarworks.montana.edu/xmlui/bitstream/handle/1/12744/SWI-of-Academic-Libraries-published-version_2017-04-21.pdf;jsessionid=A1A182CAA39D7CE33CC1C4E19C26AF0B?sequence=1

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

The display of a Knowledge Graph Card in Google search results is an indicator of SWI, as it demonstrates that Google has gathered verifiable facts about the entity.  ...  This article summarizes part of the research conducted for a recent doctoral dissertation, showing that SWI is poor for ARL libraries.  ...  Creating a record in GMB requires a formal "claim and verify" process that involves a two-step communication response. In this way, Google verifies that the location of the claimant is legitimate. 2.  ... 
doi:10.1080/01930826.2017.1288970 fatcat:bqldnc3kvvc53ocyfauveea3se
Citation

Kenning Arlitsch. "Semantic Web Identity of Academic Libraries." Journal of Library Administration 57.3 (2017) 346-358

« Previous Showing results 1 — 15 out of 243,743 results