1064 search results - page 146 / 213 » Disjoint Systems (Extended Abstract) |
138
Voted
MPC
2010
Springer
15 years 8 months ago
2010
Springer
Synchronous functional languages such as Lustre or Lucid Synchrone define a restricted class of Kahn Process Networks which can be executed with no buffer. Every expression is as...
175
Voted
DLT
2009
15 years 1 months ago
2009
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
145
click to vote
CSL
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
131
Voted
ECAI
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
146
Voted
POPL
2010
ACM
16 years 1 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...