[go: up one dir, main page]

Čerāns, 1992 - Google Patents

Feasibility of finite and infinite paths in data dependent programs

Čerāns, 1992

Document ID
11920492781493817823
Author
Čerāns K
Publication year
Publication venue
International Symposium on Logical Foundations of Computer Science

External Links

Snippet

This paper considers the feasibility of finite and infinite paths in programs in two simple programming languages. The language LBASE allows to express the dependencies of real time systems on integer data, the language LTIM can model quantitative timing constraints in …
Continue reading at link.springer.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/44—Arrangements for executing specific programmes
    • G06F9/4421—Execution paradigms
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30958—Graphs; Linked lists
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/36—Preventing errors by testing or debugging software
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/70—Software maintenance or management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models

Similar Documents

Publication Publication Date Title
Martelli et al. Optimizing decision trees through heuristically guided search
Brewka et al. Abstract dialectical frameworks. An overview
Lamport Real-time model checking is really simple
Berthomieu et al. Bridging the gap between timed automata and bounded time Petri nets
US5787010A (en) Enhanced dynamic programming method for technology mapping of combinational logic circuits
Laenens et al. A fixpoint semantics for ordered logic
Janikow A methodology for processing problem constraints in genetic programming
Ramalingam et al. On the computational complexity of incremental algorithms
Ben-Amram et al. Complexity of Bradley-Manna-Sipma lexicographic ranking functions
Cicerone et al. Graph classes between parity and distance-hereditary graphs
Čerāns Feasibility of finite and infinite paths in data dependent programs
Ball et al. Checking Temporal Properties of Ыoftware with Boolean Programs
Okawa et al. Symbolic computation tree logic model checking of time Petri nets
Kleuker A gentle introduction to specification engineering using a case study in telecommunications
D’Silva et al. Independence abstractions and models of concurrency
Corradini et al. Time and fairness in a process algebra with non-blocking reading
Lano et al. Refinement of distributed object systems
Aman et al. Multi-Agent Systems with Information Sharing: Strategies and Model Checking.
Cheng Complexity results for model checking
Talbot et al. Constraint Programming with External Worst-Case Traversal Time Analysis
Werner et al. Fast Approximate Calculation of Valid Domains in a Satisfiability-based Product Configurator.
Reveliotis Strongly Infinite-Step Opaque Boolean Networks
Fredlund et al. A framework for formal reasoning about open distributed systems
Howar et al. Practical aspects of active automata learning
St-Aubin et al. A formal mathematical framework for modeling probabilistic hybrid systems