1486 search results - page 260 / 298 » A Logically Saturated Extension of |
HASKELL
2008
ACM
13 years 11 months ago
2008
ACM
Eight years ago, functional dependencies, a concept from the theory of relational databases, were proposed as a mechanism for avoiding common problems with multiple parameter type...
LDTA
2010
13 years 10 months ago
2010
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...
ENTCS
2008
13 years 10 months ago
2008
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...