156
Voted
FOSSACS
15 years 5 months ago
2006 Springer 
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...
126
click to vote
FOSSACS
15 years 5 months ago
2006 Springer
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
123
Voted
FOSSACS
15 years 5 months ago
2006 Springer 
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
100
Voted
FOSSACS
15 years 5 months ago
2006 Springer
We prove that the equational theory of the process algebra BCCSP modulo completed simulation equivalence does not have a finite basis. Furthermore, we prove that with a finite alph...
110
Voted
FOSSACS
15 years 5 months ago
2006 Springer
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
|
Software Engineering