159 search results - page 15 / 32 » Weak Equivalences in Psi-Calculi |
100
click to vote
TCS
2008
15 years 18 days ago
2008
We introduce a new unification procedure for the type inference problem in the intersection type discipline. It is well known that type inference in this case should succeed exact...
68
Voted
TSP
2008
15 years 17 days ago
2008
This paper studies the effect of discretizing the parametrization of a dictionary in the particular context of Matching Pursuit decompositions of signals. Our approach relies on th...
123
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
104
Voted
FUIN
2006
15 years 21 days ago
2006
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...