133 search results - page 10 / 27 » Proving Properties for Behavioural Specifications with Term ... |
LICS
2008
IEEE
14 years 5 months ago
2008
IEEE
We present an extension of the πI-calculus with formal sums of terms. The study of the properties of this sum reveals that its neutral element can be used to make assumptions abo...
ERSHOV
2009
Springer
14 years 2 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
FOSSACS
2005
Springer
14 years 4 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
CDC
2008
IEEE
14 years 5 months ago
2008
IEEE
— State estimation is addressed for a class of discrete-time systems that may switch among different modes taken from a finite set. The system and measurement equations of each ...
AAAI
1990
13 years 12 months ago
1990
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...