391 search results - page 22 / 79 » Formal Universes |
98
Voted
WOLLIC
2009
Springer
15 years 7 months ago
2009
Springer
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
CSL
2004
Springer
15 years 5 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
120
Voted
FORMATS
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we review some recent results on the efficient synthesis of controllers for timed systems. We first recall the basics of controller synthesis for timed games and the...
83
Voted
ENTCS
2007
15 years 11 days ago
2007
Labelled Markov processes (LMPs) are labelled transition systems in which each transition has an associated probability. In this paper we present a universal LMP as the spectrum o...
ECCTD
2011
14 years 6 days ago
2011
Abstract—The design of integrated circuits involves the consideration of a large number of constraints of various types. In addition to the definition of these constraints in a ...