A formal proof of the deadline driven scheduler in PPTL axiomatic system (Q744103): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CESAR / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.12.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039684730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Theorem Proving: After 25 Years / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressiveness of propositional projection temporal logic with star / rank
 
Normal rank
Property / cites work
 
Property / cites work: Framed temporal logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3806791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cylinder computation model for many-core parallel computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete proof system for propositional projection temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of durations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An intuitive formal proof for deadline driven scheduler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3181698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of propositional projection temporal logic with star / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision procedure for propositional projection temporal logic with infinite models / rank
 
Normal rank

Latest revision as of 02:27, 9 July 2024

scientific article
Language Label Description Also known as
English
A formal proof of the deadline driven scheduler in PPTL axiomatic system
scientific article

    Statements

    A formal proof of the deadline driven scheduler in PPTL axiomatic system (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 October 2014
    0 references
    theorem proving
    0 references
    projection temporal logic
    0 references
    deadline driven scheduler
    0 references
    real-time system
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references