Sciweavers

    IWFM
    1998
    94views Formal Methods» more  IWFM 1998»
    Strictly Level-Decreasing Logic Programs
    14 years 24 days ago
    Strictly Level-Decreasing Logic Programs
    Download  knoesis.wright.edu
    We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
    Anthony Karel Seda, Pascal Hitzler
    claim paper
    Read More »
    IWFM
    1998
    134views Formal Methods» more  IWFM 1998»
    Facilitating Modular Property-Preserving Extensions of Programming Languages
    14 years 24 days ago
    Facilitating Modular Property-Preserving Extensions of Programming Languages
    Download  www.bcs.org
    We will explore an approach to modular programming language descriptions and extensions in a denotational style. Based on a language core, language features are added stepwise on ...
    Claus Pahl
    claim paper
    Read More »
    IWFM
    1998
    136views Formal Methods» more  IWFM 1998»
    Translating Structured Database Schemas into Abstract Machines
    14 years 24 days ago
    Translating Structured Database Schemas into Abstract Machines
    Download  www.bcs.org
    ing Structured Database Schemas into Abstract Machines Brian Matthews Rutherford Appleton Laboratory, Didcot, OXON, OX11 OQX, U.K. Elvira Locuratolo Istituto di Elaborazione dell&#...
    Brian Matthews, Elvira Locuratolo
    claim paper
    Read More »
    IWFM
    1998
    100views Formal Methods» more  IWFM 1998»
    An Unbounded Nondeterministic Model for CSP-like Languages
    14 years 24 days ago
    An Unbounded Nondeterministic Model for CSP-like Languages
    Download  www.bcs.org
    Luming Lai
    claim paper
    Read More »
    IWFM
    1998
    117views Formal Methods» more  IWFM 1998»
    A Case Study on Proving Transformations Correct: Data-Parallel Conversion
    14 years 24 days ago
    A Case Study on Proving Transformations Correct: Data-Parallel Conversion
    Download  www.bcs.org
    The issue of correctness in the context of a certain style of program transformation is investigated. This style is characterised by the fully automated application of large numbe...
    Stephen Kilpatrick, Maurice Clint, Peter Kilpatric...
    claim paper
    Read More »
    IWFM
    1998
    97views Formal Methods» more  IWFM 1998»
    Towards an Override in Topoi
    14 years 24 days ago
    Towards an Override in Topoi
    Download  www.bcs.org
    Models of software systems are built in Z and VDM using partial functions between sets and certain operations on these partial functions : extension ( ), restriction ( ), removal ...
    Arthur P. Hughes
    claim paper
    Read More »
    IWFM
    1998
    95views Formal Methods» more  IWFM 1998»
    Applications of the TAMPR Transformation System
    14 years 24 days ago
    Applications of the TAMPR Transformation System
    Download  www.bcs.org
    In this paper we present an overview of the uses of the TAMPR transformation system and present experience with using transformation in industrial applications. TAMPR is a fully a...
    Terence J. Harmer, Patrick J. McParland, James M. ...
    claim paper
    Read More »
    IWFM
    1998
    89views Formal Methods» more  IWFM 1998»
    Teaching Formal Methods: Lessons to Learn
    14 years 24 days ago
    Teaching Formal Methods: Lessons to Learn
    Download  www.bcs.org
    J. Paul Gibson, Dominique Méry
    claim paper
    Read More »
    IWFM
    1998
    113views Formal Methods» more  IWFM 1998»
    A Use Case Interpretation of B AMN
    14 years 24 days ago
    A Use Case Interpretation of B AMN
    Download  www.bcs.org
    In this paper we suggest methods to aid the development of specifications using the B method. We propose an objectoriented approach to specification, developing the structure thro...
    Richard Shore
    claim paper
    Read More »
    IWFM
    1998
    98views Formal Methods» more  IWFM 1998»
    Formal Engineering of the Bitonic Sort using PVS
    14 years 24 days ago
    Formal Engineering of the Bitonic Sort using PVS
    Download  www.bcs.org
    In this paper, we present a proof that the bitonic sort is sound using PVS, a powerful specification and verification environment. First, we briefly introduce this well-known para...
    Raphaël Couturier
    claim paper
    Read More »
    12next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.