The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...
Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larse...
Abstract. In earlier work, the Abstract State Machine Thesis — that arbitrary algore behaviorally equivalent to abstract state machines — was established for several classes of...
Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Ben...
In this paper, we introduce Applicative functors--an abstract characterisation of an applicative style of effectful programming, weaker than Monads and hence more widespread. it i...
This paper presents a hypothesis about an undiscovered class of mechanisms that exist in standard GP. Rather than being intentionally designed, these mechanisms would be an uninten...