69,215 Hits in 5.7 sec

Partial, Total and General Correctness [chapter]

Walter Guttmann
2010 Lecture Notes in Computer Science  
By adding specific axioms to the common ones, we obtain partial, total or general correctness as a specialisation. We continue our previous investigation of axioms for general correctness.  ...  We identify weak semirings, which drop the right annihilation axiom a0 = 0, as a common foundation for partial, total and general correctness.  ...  I thank all anonymous referees for their valuable remarks and helpful suggestions.  ... 
doi:10.1007/978-3-642-13321-3_11 fatcat:nysc2bhhmza7fezmtlocnczhze

Validating WordNet Meronymy Relations using Adimen-SUMO [article]

Javier Álvez and Itziar Gonzalez-Dios and German Rigau
2018 arXiv   pre-print
Our aim is to minimize the manual effort required for an extensive validation process.  ...  In this paper, we report on the practical application of a novel approach for validating the knowledge of WordNet using Adimen-SUMO.  ...  We also carried out an initial error analysis that raised aspects for future work. For instance, metonomic and ontological issues (e.g. classifying humans as animals).  ... 
arXiv:1805.07824v1 fatcat:7cziajmp5vbrdm6lgrb53g3k4m

Enabledness and termination in refinement algebra

Kim Solin, Joakim von Wright
2009 Science of Computer Programming  
Refinement algebras are abstract algebras for reasoning about programs in a total correctness framework.  ...  We extend a reduct of von Wright's demonic refinement algebra with two operators for modelling enabledness and termination of programs.  ...  Meinicke, Bernhard Möller and Viorel Preoteasa for elucidating discussions and careful scrutiny. The authors are also grateful to several anonymous referees for helpful comments.  ... 
doi:10.1016/j.scico.2007.11.004 fatcat:qjrmj7y7pzhebjddugyjpr2mjy

Improving Test Coverage of Formal Verification Systems via Beam Search

Mahmoud Bokhari, Markus Wagner
2015 Proceedings of the Companion Publication of the 2015 on Genetic and Evolutionary Computation Conference - GECCO Companion '15  
Testing the axiomatization thoroughly is one approach to increase the trust in its correctness, however, the manual creation of test cases is a very time-consuming process for verification engineers.  ...  We present a beam search approach for creating test cases through test case modifications.  ...  replacements, and the total number of unsuccessful attempts for replacing the axiom.  ... 
doi:10.1145/2739482.2764670 dblp:conf/gecco/BokhariW15 fatcat:fnegpemuhveizmrdyuj75nltbu

Unifying Recursion in Partial, Total and General Correctness [chapter]

Walter Guttmann
2010 Lecture Notes in Computer Science  
We give an algebraic semantics of non-deterministic, sequential programs which is valid for partial, total and general correctness. It covers full recursion based on a unified approximation order.  ...  UTP's designs and prescriptions represent programs as pairs of termination and state transition information in total and general correctness, respectively.  ...  I thank Georg Struth for helpful discussions and the anonymous referees for valuable remarks.  ... 
doi:10.1007/978-3-642-16690-7_10 fatcat:53gkrg4x7zbw5pyhuw566tgkga

Visual logics help people: An evaluation of diagrammatic, textual and symbolic notations

Eisa Alharbi, John Howse, Gem Stapleton, Ali Hamie, Anestis Touloumis
2017 2017 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)  
MOS outperformed concept diagrams for just one axiom type and DL for only three axiom types. Thus diagrams could ensure ontologies are developed more robustly.  ...  Concept diagrams yielded significantly better task performance than DL for all six, and MOS for four, axiom types.  ...  Each participant answered 18 questions giving a total of 1620 observations, 270 for each axiom type and 540 for each group.  ... 
doi:10.1109/vlhcc.2017.8103475 dblp:conf/vl/AlharbiHSHT17 fatcat:5gxwxk5wqnhsxptvcop3pza5ay

An Improved Beam-Search for the Test Case Generation for Formal Verification Systems [chapter]

Mahmoud A. Bokhari, Thorsten Bormer, Markus Wagner
2015 Lecture Notes in Computer Science  
As a result, it is essential to increase the axiom coverage in order to verify its correctness.  ...  It captures the semantics of the programming language used for writing the target software.  ...  Thus, we force the system to find alternative ways of constructing a correctness proof for a given test case P +(REQ ∪ AUX ), while using only a subset of the total set of axioms.  ... 
doi:10.1007/978-3-319-22183-0_6 fatcat:w3krjap735di5fuheg3wtfvwwy

A note on inconsistent axioms in Rushby's "systematic formal verification for fault-tolerant time-triggered algorithms"

L. Pike
2006 IEEE Transactions on Software Engineering  
I also present corrections for these inconsistencies.  ...  INCONSISTENCIES AND CORRECTIONS I begin by stating Rushby's definition of inverse clocks and Clock Drift Rate Axiom.Definition 1 (Inverse Clock): An inverse clock for process p is a total function C p  ...  Definition 2 (Revised Inverse Clock): An inverse clock for process p is a total function C p : R → Z.  ... 
doi:10.1109/tse.2006.41 fatcat:eibkdecdzbdn7ifdfpwvqbuici

The Three Fatal Mistakes of Yesterday Economics: Profit, I=S, Employment

Egmont Kakarot-Handtke
2014 Social Science Research Network  
Yet, much more important than any political reputation of economics is indeed: without correct axioms, no acceptance as science. There is no way around it, neither for Orthodoxy nor for Heterodoxy.  ...  Without correct axioms, no correct theory. Without correct theory, no understanding of how the economy works. Without empirically corroborated understanding, no useful economic policy advice.  ...  Without correct axioms, no correct theory. Without correct theory, no understanding of how the monetary economy works.  ... 
doi:10.2139/ssrn.2489792 fatcat:n6mxphdp5zeutlguw2fm3civmu

General Correctness Algebra [chapter]

Walter Guttmann
2009 Lecture Notes in Computer Science  
In particular, we propose axioms, correctness statements, a correctness calculus, specification constructs and a loop refinement rule.  ...  General correctness offers a finer semantics of programs than partial and total correctness. We give an algebraic account continuing and extending previous approaches.  ...  I thank the anonymous referees for their valuable remarks and helpful suggestions.  ... 
doi:10.1007/978-3-642-04639-1_11 fatcat:aa73x2bppvefrhbj5ht2taccl4

Unifying Correctness Statements [chapter]

Walter Guttmann
2012 Lecture Notes in Computer Science  
Partial, total and general correctness and further models of sequential computations differ in their treatment of finite, infinite and aborting executions.  ...  We introduce algebras that uniformly describe correctness statements, correctness calculi, pre-post specifications and loop refinement rules in five kinds of computation models.  ...  I thank Jeremy Gibbons and the anonymous referees for providing helpful comments.  ... 
doi:10.1007/978-3-642-31113-0_11 fatcat:wo5cqdbclnhanbt7zrrekxwbdu

Unifying Lazy and Strict Computations [chapter]

Walter Guttmann
2012 Lecture Notes in Computer Science  
We develop a common theory generalising previous algebraic descriptions of strict computation models including partial, total and general correctness and extensions thereof.  ...  We propose axioms that generalise the binary operation known from omega algebra, and derive properties of this new operation which hold for both strict and non-strict computations.  ...  I thank the anonymous referees for valuable comments.  ... 
doi:10.1007/978-3-642-33314-9_2 fatcat:zakpqs55krcbtp36qfvcyaabpq

A commonsense approach to the theory of error correcting codes

1990 Discrete Applied Mathematics  
Axioms for programs and primitive predicates. Rules for the usual logical symbols. Rules for V and +. Axioms for the modal operator. Miscellaneous axioms).  ...  Axioms of Join and Product. Graph and value class: the minimal graph axiom). Choice rule. Remarks on the axiom system (Total variables versus partial variables).  ... 
doi:10.1016/0166-218x(90)90120-2 fatcat:roqo47c6fbhy3gdsfqa57mguai

Maximising axiomatization coverage and minimizing regression testing time

Markus Wagner
2014 2014 IEEE Congress on Evolutionary Computation (CEC)  
One of the contributing factors to the correctness of the whole verification system is the correctness of the background axiomatization, which captures the semantics of the target program language.  ...  We present a framework for the maximization of the proportion of the axiomatization that is used ("covered") during testing of the verification tool.  ...  ACKNOWLEDGEMENTS We thank Mojgan Pourhassan for her very valuable feedback on APPROACH 1-3 that lead to APPROACH 4 and APPROACH 5.  ... 
doi:10.1109/cec.2014.6900324 dblp:conf/cec/Wagner14 fatcat:ll55o7tczvgudn3kjkg4zp2hli

Automatic White-Box Testing of First-Order Logic Ontologies [article]

Javier Álvez and Montserrat Hermo and Paqui Lucio and German Rigau
2019 arXiv   pre-print
Our proposal enables the detection of defects and serves to certify the grade of suitability --for reasoning purposes-- of every axiom.  ...  Additionally, by correcting all the detected defects, we have obtained an improved version of one of the tested ontologies: Adimen-SUMO.  ...  Acknowledgements The authors are grateful to the anonymous reviewers for their valuable comments that improve this publication.  ... 
arXiv:1705.10219v3 fatcat:a46j3kr7cbflljntzdxtc2i4me
« Previous Showing results 1 — 15 out of 69,215 results