23 search results - page 3 / 5 » Decidability and proof systems for language-based noninterfe... |
164
Voted
FORMATS
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
175
Voted
TLCA
1997
Springer
15 years 8 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
129
click to vote
CADE
2001
Springer
16 years 4 months ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
155
click to vote
LICS
1991
IEEE
15 years 7 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
122
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
Applied Type System (ATS) is recently proposed as a framework for designing and formalizing (advanced) type systems in support of practical programming. In ATS, the definition of ...