Sciweavers

    264 search results - page 15 / 53
    » entcs 2008
    Sort
    View
    ENTCS
    2008
    108views more  ENTCS 2008»
    E-matching for Fun and Profit
    13 years 6 months ago
    E-matching for Fun and Profit
    Download  research.microsoft.com
    Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quant...
    Michal Moskal, Jakub Lopuszanski, Joseph R. Kiniry
    claim paper
    Read More »
    ENTCS
    2008
    87views more  ENTCS 2008»
    Checking Emptiness of Non-Deterministic Regular Types with Set Operators
    13 years 6 months ago
    Checking Emptiness of Non-Deterministic Regular Types with Set Operators
    Download  www.secs.oakland.edu
    An algorithm to decide the emptiness of a regular type expression with set operators given a set of parameterized type definitions is presented. The algorithm generalizes previous...
    Lunjin Lu
    claim paper
    Read More »
    ENTCS
    2008
    101views more  ENTCS 2008»
    On the Approximation of Stochastic Concurrent Constraint Programming by Master Equation
    13 years 6 months ago
    On the Approximation of Stochastic Concurrent Constraint Programming by Master Equation
    Download  www.dmi.units.it
    We explore the relation between the stochastic semantic associated to stochastic Concurrent Constrain Programming (sCCP) and its fluid-flow approximation. Writing the master equat...
    Luca Bortolussi
    claim paper
    Read More »
    ENTCS
    2008
    84views more  ENTCS 2008»
    Comparing Three Coordination Models: Reo, ARC, and RRD
    13 years 6 months ago
    Comparing Three Coordination Models: Reo, ARC, and RRD
    Download  www-formal.stanford.edu
    Three models of coordination--Reo, Actors-Roles-Coordinators (ARC), and Reflective Russian Dolls (RRD)--are compared and contrasted according to a set of coordination features. Ma...
    Carolyn L. Talcott, Marjan Sirjani, Shangping Ren
    claim paper
    Read More »
    ENTCS
    2008
    85views more  ENTCS 2008»
    Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
    13 years 6 months ago
    Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
    Download  ir.nul.nagoya-u.ac.jp
    Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ...
    Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe
    claim paper
    Read More »
    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.