Abstract. We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to ...
Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Pr...
This chapter presents a dynamic denotational semantics of the Java programming language. This semantics covers almost the full range of the base language, excluding only concurrenc...
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
We survey logic-based and automata-based languages and techniques for the speci cation and veri cation of real-time systems. In particular, we discuss three syntactic extensions of...
Bulk Synchronous Parallel ML is a high-level language for programming parallel algorithms. Built upon OCaml and using the BSP model, it provides a safe setting for their implementa...