Sciweavers

    IWFM
    2000
    167views Formal Methods» more  IWFM 2000»
    An Algebraic Basis for Specifying and Enforcing Access Control in Security Systems
    13 years 5 months ago
    An Algebraic Basis for Specifying and Enforcing Access Control in Security Systems
    Download  www.bcs.org
    Security services in a multi-user environment are often based on access control mechanisms. Static of an access control policy can be formalised using abstract algebraic models. W...
    Claus Pahl
    claim paper
    Read More »
    IWFM
    2000
    162views Formal Methods» more  IWFM 2000»
    Modal Logics for Reasoning about Object-based Component Composition
    13 years 5 months ago
    Modal Logics for Reasoning about Object-based Component Composition
    Download  www.bcs.org
    Component-oriented development of software supports the adaptability and maintainability of large systems, in particular if requirements change over time and parts of a system hav...
    Claus Pahl
    claim paper
    Read More »
    IWFM
    2000
    98views Formal Methods» more  IWFM 2000»
    An Iterator Construct for the Refinement Calculus
    13 years 5 months ago
    An Iterator Construct for the Refinement Calculus
    Download  www.bcs.org
    Steve King, Carroll Morgan
    claim paper
    Read More »
    IWFM
    2000
    112views Formal Methods» more  IWFM 2000»
    A Note on the Relationships Between Logic Programs and Neural Networks
    13 years 5 months ago
    A Note on the Relationships Between Logic Programs and Neural Networks
    Download  people.aifb.kit.edu
    Several recent publications have exhibited relationships between the theories of logic programming and of neural networks. We consider a general approach to representing normal lo...
    Pascal Hitzler, Anthony Karel Seda
    claim paper
    Read More »
    IWFM
    2000
    107views Formal Methods» more  IWFM 2000»
    A Comparison of Three Model Checkers Applied to a Distributed Database Problem
    13 years 5 months ago
    A Comparison of Three Model Checkers Applied to a Distributed Database Problem
    Download  www.bcs.org
    ct Increasingly, model checking is being applied to more abstract problem domains than the traditional protocol analysis. The extent to which such an approach is able to provide us...
    A. J. Currie
    claim paper
    Read More »
    IWFM
    1998
    94views Formal Methods» more  IWFM 1998»
    Strictly Level-Decreasing Logic Programs
    13 years 5 months 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
    13 years 5 months 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
    13 years 5 months 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
    13 years 5 months 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
    13 years 5 months 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 »
    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.