7988 search results - page 220 / 1598 » A Useful Undecidable Theory |
110
click to vote
ESOP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
CONCUR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL wit...
81
Voted
FSTTCS
2006
Springer
15 years 4 months ago
2006
Springer
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
103
click to vote
PODS
1995
ACM
15 years 4 months ago
1995
ACM
d abstract Marc Andries, Leiden University Luca Cabibbo, University of Romey Jan Paredaens, University of Antwerpz Jan Van den Bussche, INRIAx In the context of object databases...
113
Voted
AMAST
2008
Springer
15 years 2 months ago
2008
Springer
In this paper, we present a novel approach that establishes a synergy between static and dynamic analyses for detecting memory errors in C code. We extend the standard C type syste...