Sciweavers

1768 search results - page 103 / 354
» A Logic for Algebraic Effects
Sort
View
110
Voted
RTSS
1998
IEEE
15 years 5 months ago
Symbolic Schedulability Analysis of Real-Time Systems
We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities....
Hee-Hwan Kwak, Insup Lee, Anna Philippou, Jin-Youn...
ISSAC
1997
Springer
105views Mathematics» more  ISSAC 1997»
15 years 5 months ago
Guarded Expressions in Practice
Computer algebra systems typically drop some degenerate cases when evaluating expressions, e.g., x=x becomes 1 dropping the case x = 0. We claim that it is feasible in practice to...
Andreas Dolzmann, Thomas Sturm
92
Voted
CORR
2010
Springer
120views Education» more  CORR 2010»
15 years 27 days ago
State machine models of timing and circuit design
This paper illustrates a technique for specifying the detailed timing, logical operation, and compositional circuit design of digital circuits in terms of ordinary state machines w...
Victor Yodaiken
81
Voted
APAL
2010
115views more  APAL 2010»
15 years 28 days ago
Kripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
Lev D. Beklemishev
91
Voted
ENTCS
2008
99views more  ENTCS 2008»
15 years 26 days ago
Specifying Properties of Concurrent Computations in CLF
CLF (the Concurrent Logical Framework) is a language for specifying and reasoning about concurrent systems. Its most significant feature is the first-class representation of concu...
Kevin Watkins, Iliano Cervesato, Frank Pfenning, D...