1128 search results - page 85 / 226 » Little Engines of Proof |
ASM
2008
ASM
14 years 11 months ago
2008
ASM
As systems become ever more complex, verification becomes more main stream. Event-B and Alloy are two formal specification languages based on fairly different methodologies. While...
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
168
click to vote
AMAST
2010
Springer
14 years 4 months ago
2010
Springer
Maude modules can be understood as models that can be formally analyzed and verified with respect to different properties expressing various formal requirements. However, Maude lac...
FOSSACS
2012
Springer
13 years 5 months ago
2012
Springer
We study type-directed encodings of the simply-typed λ-calculus in a session-typed π-calculus. The translations proceed in two steps: standard embeddings of simply-typed λ-calcu...