Filters








412 Hits in 5.8 sec

HOL-Z 2.0: A Proof Environment for Z-Specifications

Achim D. Brucker, Burkhart Wolff, Frank Rittinger
2003 Journal of universal computer science (Online)  
We present a new proof environment for the specification language Z. The basis is a semantic representation of Z in a structure-preserving, shallow embedding in Isabelle/HOL.  ...  On top of the embedding, new proof support for the Z schema calculus and for proof structuring are developed.  ...  As the second contribution, we provide an integration of HOL-Z into a specific tool-chain in order to "scale up" the previous work on embedding Z into Isabelle/HOL to a proof environment that has been  ... 
doi:10.3217/jucs-009-02-0152 dblp:journals/jucs/BruckerRW03 fatcat:r6dhtixfwzcfvcv2vadvuvjafe

Semantic Issues of OCL: Past, Present, and Future

Achim D. Brucker, Jürgen Doser, Burkhart Wolff
2007 Electronic Communications of the EASST  
The ultimate goal of the project is to provide a formalized, machine-checked semantic basis for a theorem proving environment for OCL (as an example for an object-oriented specification formalism) which  ...  We report on the results of a long-term project to formalize the semantics of OCL 2.0 in Higher-order Logic (HOL).  ...  A Technical Basis for a Proof-Environment.  ... 
doi:10.14279/tuj.eceasst.5.46 dblp:journals/eceasst/BruckerDW06a fatcat:uci43frk45b63cdabyijx26x6u

A visual token-based formalization of BPMN 2.0 based on in-place transformations

Pieter Van Gorp, Remco Dijkman
2013 Information and Software Technology  
GenGED - a visual definition tool for visual modeling environments. In John L.  ...  code for a specific case study [60].  ... 
doi:10.1016/j.infsof.2012.08.014 fatcat:hsx7ql23y5fpng3mk5a3sd4iqy

HOL-OCL: Experiences, Consequences and Design Choices [chapter]

Achim D. Brucker, Burkhart Wolff
2002 Lecture Notes in Computer Science  
A particular emphasize is put on the issue of mechanized deduction in UML/OCL specification.  ...  Based on experiences gained from an embedding of the Object Constraint Language (OCL) in higher-order logic [1], we explore several key issues of the design of a formal semantics of the OCL.  ...  In our formalization (following OCL 2.0), both conditions are conjoint and form a method specification.  ... 
doi:10.1007/3-540-45800-x_17 fatcat:2g2elwqmh5eulpvrcpwg6szqs4

Semantics, calculi, and analysis for object-oriented specifications

Achim D. Brucker, Burkhart Wolff
2009 Acta Informatica  
We present a formal semantics for an object-oriented specification language.  ...  On this basis, we formally derive several equational and tableaux calculi, which form the basis of an integrated proof environment including automatic proof support and support for the analysis of this  ...  Acknowledgements We thank Lukas Brügger and Simon Meier for valuable discussions on the subject of this paper. Simon Meier implemented the described rewrite procedure.  ... 
doi:10.1007/s00236-009-0093-8 fatcat:2pyqgfsaobgdxlrt6jugyyffyq

Structuring and automating hardware proofs in a higher-order theorem-proving environment

Ramayya Kumar, Klaus Schneider, Thomas Kropf
1993 Formal methods in system design  
By exploiting the structure of the underlying hardware proofs and limiting the form of descriptions used, we have attained nearly complete automation in proving the equivalences of the specifications and  ...  A hardware-specific tool called MEPHISTO converts the original goal into a set of simpler subgoals, which are then automatically solved by a general-purpose, first-order prover called FAUST.  ...  This has been achieved by embedding a hardware specific environment on top of HOL, called MEPHISTO 4 [31, 32] .  ... 
doi:10.1007/bf01383880 fatcat:ss3e53xg65b43kf2jw7reszgoa

Theorema 2.0: Computer-Assisted Natural-Style Mathematics

Bruno Buchberger, Tudor Jebelean, Temur Kutsia, Alexander Maletzky, Wolfgang Windsteiger
2016 Journal of Formalized Reasoning   unpublished
a working language for formulating problem specifications, algorithms, correctness theorems for algorithms and their proofs.  ...  should be a logic and software tool for supporting the entire process of mathematical theory exploration , i.e. definitions of notions, formulation and proof of propositions, formulation of problems,  ...  a working language for formulating problem specifications, algorithms, correctness theorems for algorithms and their proofs.  ... 
fatcat:vfga7gvqkfbmhj6kqjzw4r35wm

Featherweight OCL

Achim D. Brucker, Burkhart Wolff
2012 Proceedings of the 12th Workshop on OCL and Textual Modelling - OCL '12  
At its origins, OCL was conceived as a strict semantics for undefinedness, with the exception of the logical connectives of type Boolean that constitute a three-valued propositional logic.  ...  In this paper, we report on our results in formalizing the core of OCL in higher-order logic (HOL).  ...  Acknowledgments We would like to thank Edward Willink for suggesting the alternative interpretation of null as "don't know."  ... 
doi:10.1145/2428516.2428520 dblp:conf/models/BruckerW12 fatcat:2rxsl5ihibaihfvwbfsipizpim

Extending SMT-LIB v2 with λ-Terms and Polymorphism

Richard Bonichon, David Déharbe, Cláudia Tavares
2014 International Workshop on Satisfiability Modulo Theories  
Since most Smt-solvers only deal with many-sorted first-order formulas, we detail a monomorphization mechanism to allow to use polymorphism in Smt-Lib syntax while retaining a monomorphic solver core.  ...  We warmly thank the anonymous reviewers for their helpful feedback and constructive criticism, which already show promises of future fruitful discussions about the subject of this paper.  ...  untyped first-order proofs.  ... 
dblp:conf/smt/BonichonDT14 fatcat:asyexkxhfjeo5f6emhkmuhgn2a

Improved Tool Support for Machine-Code Decompilation in HOL4 [chapter]

Anthony Fox
2015 Lecture Notes in Computer Science  
The HOL4 interactive theorem prover provides a sound logical environment for reasoning about machine-code programs.  ...  These advancements have been facilitated by the development of a domain specific language, called L3, for the specification of Instruction Set Architectures (ISAs).  ...  Our approach is based on using three programming environments: L3 for developing ISA specifications; Standard ML (compiled using Poly/ML or MLton) for efficient emulation; and HOL4 for formal reasoning  ... 
doi:10.1007/978-3-319-22102-1_12 fatcat:xrbtb3mlrzezrddt2zrci2rl54

Property-Based Testing of the Meta-Theory of Abstract Machines: an Experience Report

Francesco Komauli, Alberto Momigliano
2018 Italian Conference on Computational Logic  
In particular, property-based testing (PBT) is quite effective in mechanized meta-theory of programming languages, where theorems have shallow but tedious proofs that may go wrong for fairly banal mistakes  ...  Finally, we carry out some mutation testing on the given model, to asses the trade-off between exhaustive and randomized data generation, using for the latter the PBT library FSCheck for F#.  ...  Total: 0.012 s: X = z Xs = [z,s(z),z] Ys = [z,z,s(z),z] The tool reports a minimal counterexample to the conjecture, namely a substitution that verifies the antecedent but not the consequent.  ... 
dblp:conf/cilc/KomauliM18 fatcat:aobbdhebxbcb3lu2wvxybjospa

A Survey on Theorem Provers in Formal Methods [article]

M. Saqib Nawaz, Moin Malik, Yi Li, Meng Sun, M. Ikram Ullah Lali
2019 arXiv   pre-print
Technically, mathematical formalisms and automated reasoning based-approaches are employed to perform inferences and to generate proofs in theorem provers.  ...  Mechanical reasoning is a key area of research that lies at the crossroads of mathematical logic and artificial intelligence.  ...  Isabelle unique features is a huge integrated environment for interactive and automated theorem proving. It is like a word-processor for formal logic, with specifications and proofs.  ... 
arXiv:1912.03028v1 fatcat:fabxqg75xjhxlh7u3uyypgyzdy

On Message Specifications in OCL

Marcel Kyas, Frank S. de Boer
2004 Electronical Notes in Theoretical Computer Science  
Recently an extension of OCL has been proposed for the specification of messages sent between objects.  ...  Moreover, to reason compositionally about the behavior of a complex system we distinguish between local specifications of a single object and global specifications describing the interaction between objects  ...  We specify how an object collaborates with its environment using a global specification language.  ... 
doi:10.1016/j.entcs.2004.02.017 fatcat:nxneyb7etbhbvfzxpjbm7fpyci

Semantics of OCL Operation Specifications

Rolf Hennicker, Alexander Knapp, Hubert Baumeister
2004 Electronical Notes in Theoretical Computer Science  
It is argued that the semantics of operation specifications as defined in the OCL 2.0 proposal is not compatible with the view of operation specifications as contracts between a client and a supplier.  ...  The models respect the OCL features for methods with and without results, constructors, and queries.  ...  We would like to thank Michel Bidoit for useful suggestions for improvements.  ... 
doi:10.1016/j.entcs.2003.09.006 fatcat:jyjrvgnznjgodb5obucxmhsuya

Verifying a Plaftorm for Digital Imaging: A Multi-tool Strategy [chapter]

Jónathan Heras, Gadea Mata, Ana Romero, Julio Rubio, Rubén Sáenz
2013 Lecture Notes in Computer Science  
In particular, in our research -made together with a biologists team; we use Fiji in some pre-processing steps before undertaking a homological digital processing of images.  ...  Fiji is a Java platform widely used by biologists and other experimental scientists to process digital images.  ...  The Why/Krakatoa tools [11] are an environment for proving the correctness of Java programs annotated with JML [6] specifications.  ... 
doi:10.1007/978-3-642-39320-4_5 fatcat:r7hup57jtrcwxnix4ux2h7imm4
« Previous Showing results 1 — 15 out of 412 results